The DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.
Discovery of frequent DATALOG patterns
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907
Agrawal, R., & Srikant, R. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380415 · Cited by 5,155
Solving the multiple instance problem with axis-parallel rectangles
Dietterich, T. G., Lathrop, R. H., & Lozano-Pérez, T. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(96)00034-3 · Cited by 2,866
Mining sequential patterns: Generalizations and performance improvements
Srikant, R., & Agrawal, R. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0014140 · Cited by 2,711
Principles of database and knowledge-base systems
(1989) · Choice Reviews Online · doi:10.5860/choice.26-5107 · Cited by 2,683
Fast discovery of association rules
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H. T. T., & Verkamo, A. I. (1996) · Knowledge Discovery and Data Mining · Cited by 2,376
Self-citationClark, P., & Niblett, T. (1989) · Machine Learning · doi:10.1007/bf00116835 · Cited by 2,267
Mining generalized association rules
Srikant, R., & Agrawal, R. (1997) · Future Generation Computer Systems · doi:10.1016/s0167-739x(97)00019-8 · Cited by 1,618
An Efficient Algorithm for Mining Association Rules in Large Databases
Savasere, A., Omiecinski, E. R., & Navathe, S. B. (1995) · Cited by 1,590
Cited by
Knowledge Graph Embedding: A Survey of Approaches and Applications
Wang, Q., Mao, Z., Wang, B., & Guo, L. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2754499 · Cited by 2,654
State of the art of graph-based data mining
Washio, T., & Motoda, H. (2003) · ACM SIGKDD Explorations Newsletter · doi:10.1145/959242.959249 · Cited by 448
Propositionalization Approaches to Relational Data Mining
Kramer, S., Lavrač, N., & Flach, P. (2001) · Relational Data Mining · doi:10.1007/978-3-662-04599-2_11 · Cited by 271
Confirmation-Guided Discovery of First-Order Rules with Tertius
Flach, P. A., & Lachiche, N. (2001) · Machine Learning · doi:10.1023/a:1007656703224 · Cited by 131
The Game of Bridge: A Challenge for ILP
Legras, S., Rouveirol, C., & Ventos, V. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-99960-9_5 · Cited by 7
Metadata
- Authors
- Dehaspe, L., & Toivonen, H.
- Venue
- Data Mining and Knowledge Discovery
- Published
- 1999-03
- Volume
- 3
- Issue
- 1
- Pages
- 7-36
- ISSN
- 1384-5810 (ISSN-L)
- 1573-756X
- OpenAlex
- W2113243831
- Cited by
- 313
- References
- 56
- FWCI
- 36.12
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Discovery of frequent DATALOG patterns. https://app.cochat.ai/papers/10.1023/a:1009863704807
- The paper
- Dehaspe, L., & Toivonen, H. (1999). Discovery of frequent DATALOG patterns. Data Mining and Knowledge Discovery. https://doi.org/10.1023/a%3A1009863704807
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
