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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Inductive Logic Programming: Theory and methods
Muggleton, S., & de Raedt, L. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90035-3 · Cited by 1,537
Discovery of Frequent Episodes in Event Sequences
Mannila, H., Toivonen, H., & Inkeri Verkamo, A. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009748302351 · Cited by 1,463
Self-citation(1988) · Computer Science Press, Inc. eBooks · Cited by 1,435
Mitchell, T. M. (1982) · Artificial Intelligence · doi:10.1016/0004-3702(82)90040-6 · Cited by 1,412
Muggleton, S. (1995) · New Generation Computing · doi:10.1007/bf03037227 · Cited by 1,411
Sampling Large Databases for Association Rules
Toivonen, H. T. T. (1996) · Cited by 1,089
Self-citationDiscovery of Multiple-Level Association Rules from Large Databases
Han, J., & Fu, Y. (1995) · Cited by 922
Levelwise Search and Borders of Theories in Knowledge Discovery
Mannila, H., & Toivonen, H. T. T. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009796218281 · Cited by 889
Self-citationMining association rules with item constraints
Srikant, R., Vu, Q., & Agrawal, R. (1997) · Cited by 766
Ashby, J., & Tennant, R. W. (1991) · Mutation Research/Reviews in Genetic Toxicology · doi:10.1016/0165-1110(91)90003-e · Cited by 688
Top-down induction of first-order logical decision trees
Blockeel, H., & De Raedt, L. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(98)00034-4 · Cited by 685
An algorithm for multi-relational discovery of subgroups
Wrobel, S. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63223-9_108 · Cited by 568
Langley, P. (1995) · Medical Entomology and Zoology · Cited by 559
Explora: a multipattern and multistrategy discovery assistant
Klösgen, W. (1996) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · Cited by 438
Top-down induction of clustering trees
Blockeel, H., Raedt, L. D., & Ramon, J. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0011032 · Cited by 397
Discovering generalized episodes using minimal occurrences
Mannila, H., & Toivonen, H. T. T. (1996) · Cited by 306
Self-citationDe Raedt, L., & Dehaspe, L. (1997) · Machine Learning · doi:10.1023/a:1007361123060 · Cited by 235
Self-citationKing, R. D., Muggleton, S. H., Srinivasan, A., & Sternberg, M. J. (1996) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.93.1.438 · Cited by 231
Muggleton, S. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63494-0_65 · Cited by 204
Relational reinforcement learning
Džeroski, S., De Raedt, L., & Blockeel, H. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0027307 · Cited by 193
Mining association rules in multiple relations
Dehaspe, L., & Raedt, L. (1997) · Lecture Notes in Computer Science · doi:10.1007/3540635149_40 · Cited by 188
Self-citationFinding frequent substructures in chemical compounds
Raedt, L. D., Toivonen, H. T. T., & King, R. D. (1998) · Lirias · Cited by 171
Self-citationSituation recognition: Representation and algorithms
Dousson, C., Gaborit, P., & Ghallab, M. (1993) · Cited by 162
Combinatorial pattern discovery for scientific data: some preliminary results
Wang, J. T.-L., Chirn, G., Marr, T. G., Shapiro, B. A., Shasha, D. E., & Zhang, K. (1994) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/191839.191863 · Cited by 149
First-order jk-clausal theories are PAC-learnable
Raedt, L. D., & Džeroski, S. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90112-0 · Cited by 140
Carcinogenesis predictions using ILP
Srinivasan, A., King, R. D., Muggleton, S., & Sternberg, M. J. E. (1997) · Lecture notes in computer science · doi:10.1007/3540635149_56 · Cited by 118
NeuroRule: A Connectionist Approach to Data MiningPreprint
Lü, H., Setiono, R., & Liu, H. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.01358 · Cited by 113
Raedt, L. D., & Laer, W. V. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60454-5_30 · Cited by 112
A Perspective on Databases and data mining
Holsheimer, M., Kersten, M. L., Mannila, H., & Toivonen, H. T. T. (1995) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 111
Self-citationInductive logic programming and knowledge discovery in databases
Džeroski, S. (1996) · Knowledge Discovery and Data Mining · Cited by 95
Shen, W., Ong, K., Mitbander, B. G., & Zaniolo, C. (1996) · Cited by 86
Rule Discovery in Telecommunication Alarm Data
Klemettinen, M., Mannila, H., & Toivonen, H. T. T. (1999) · Journal of Network and Systems Management · doi:10.1023/a:1018787815779 · Cited by 84
Self-citationThe NIEHS Predictive-Toxicology Evaluation Project.
Bristol, D. W., Wachsman, J. T., & Greenwell, A. (1996) · Environmental Health Perspectives · doi:10.1289/ehp.96104s51001 · Cited by 79
Searching for Structure in Multiple Streams of Data.
Oates, T., & Cohen, P. R. (1996) · Cited by 74
King, R. D., & Srinivasan, A. (1996) · Environmental Health Perspectives · doi:10.1289/ehp.96104s51031 · Cited by 67
Data mining and forecasting in large-scale telecommunication networks
Sasisekharan, R., Seshadri, V., & Weiss, S. M. (1996) · IEEE Expert · doi:10.1109/64.482956 · Cited by 61
An Efficient Subsumption Algorithm for Inductive Logic Programming
Kietz, J.-U., & Lübbe, M. (1994) · Elsevier eBooks · doi:10.1016/b978-1-55860-335-6.50024-6 · Cited by 50
Muggleton, S. (1997) · doi:10.1007/3-540-63494-0 · Cited by 48
Declarative Bias for Specific-to-General ILP Systems
Adé, H., Raedt, L. D., & Bruynooghe, M. (1995) · Machine Learning · doi:10.1007/bf00993477 · Cited by 40
Controlling the Complexity of Learning in Logic through Syntactic and Task-Oriented Models
Kietz, J.-U., & Wrobel, S. (1991) · Cited by 35
DLAB: A declarative language bias formalism
Dehaspe, L., & Raedt, L. D. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61286-6_185 · Cited by 27
Self-citationAnalyzing the benefits of domain knowledge in substructure discovery
Djoko, S., Cook, D. J., & Holder, L. B. (1995) · Cited by 25
Relational knowledge discovery in databases
Blockeel, H., & Raedt, L. D. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63494-0_56 · Cited by 23
Raedt, L. D. (1996) · Cited by 18
Mining for causes of cancer: machine learning experiments at various levels of detail
Krämer, S., Pfahringer, B., & Helma, C. (1997) · Cited by 9
A declarative language bias for levelwise search of first-order regularities
Weber, I. (1999) · Lecture notes in computer science · doi:10.1007/bfb0095111 · Cited by 3
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
Graph mining: Laws, generators, and algorithms
Chakrabarti, D., & Faloutsos, C. (2006) · ACM Computing Surveys · doi:10.1145/1132952.1132954 · Cited by 609
AMIE: association rule mining under incomplete evidence in ontological knowledge bases
Galárraga, L. A., Teflioudi, C., Hose, K., & Suchanek, F. (2013) · Proceedings of the 22nd international conference on World Wide Web · doi:10.1145/2488388.2488425 · Cited by 603
Džeroski, S. (2006) · Data Mining and Knowledge Discovery Handbook · doi:10.1007/0-387-25465-x_41 · Cited by 520
Fast rule mining in ontological knowledge bases with AMIE $$+$$ +
Galárraga, L., Teflioudi, C., Hose, K., & Suchanek, F. M. (2015) · The VLDB Journal · doi:10.1007/s00778-015-0394-1 · Cited by 516
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
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.