The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
Propositionalization Approaches to Relational Data Mining
Overview
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
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
(1992) · Cited by 23,431
A Tutorial on Support Vector Machines for Pattern Recognition
Burges, C. J. C. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009715923555 · Cited by 16,429
Data mining and knowledge discovery: making sense out of data
Feyyad, U. M. (1996) · IEEE Expert · doi:10.1109/64.539013 · Cited by 4,612
A TUTORIAL ON SUPPORT VECTOR MACHINES FOR PATTERN RECOGNITION, DATA MINING AND KNOWLEDGE DISCOVERY
Burger, C. J. C. (1998) · Cited by 3,313
Advances in knowledge discovery and data mining
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90007-3 · Cited by 2,971
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
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
Clark, P., & Niblett, T. (1989) · Machine Learning · doi:10.1007/bf00116835 · Cited by 2,267
Estimation of Dependences Based on Empirical Data
Vapnik, V. (2006) · Information Science and Statistics · doi:10.1007/0-387-34239-7 · Cited by 2,238
Toward optimal feature selection
Koller, D., & Sahami, M. (1996) · Cited by 1,482
Muggleton, S. (1995) · New Generation Computing · doi:10.1007/bf03037227 · Cited by 1,411
Muggleton, S. (1991) · New Generation Computing · doi:10.1007/bf03037089 · Cited by 1,044
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
Rule induction with CN2: Some recent improvements
Clark, P., & Boswell, R. (1991) · Lecture Notes in Computer Science · doi:10.1007/bfb0017011 · Cited by 859
Inductive Logic Programming: Techniques and Applications
Lavrač, N., & Džeroski, S. (1993) · Cited by 760
Self-citation(1990) · Cited by 671
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
Substructure Discovery Using Minimum Description Length and Background Knowledge
Cook, D. J., & Holder, L. B. (1994) · Journal of Artificial Intelligence Research · doi:10.1613/jair.43 · Cited by 480
Explora: a multipattern and multistrategy discovery assistant
Klösgen, W. (1996) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · Cited by 438
ASSISTANT 86: a knowledge-elicitation tool for sophisticated users
Cestnik, B., Kononenko, I., & Bratko, I. (1987) · Medical Entomology and Zoology · Cited by 428
Klopman, G. (1984) · Journal of the American Chemical Society · doi:10.1021/ja00336a004 · Cited by 427
Boolean Feature Discovery in Empirical Learning
Pagallo, G., & Haussler, D. (1990) · Machine Learning · doi:10.1023/a:1022611825350 · Cited by 390
Advances in Inductive Logic Programming
Raedt, L. D. (1996) · Cited by 318
MULTICASE 1. A Hierarchical Computer Automated Structure Evaluation Program
Klopman, G. (1992) · Quantitative Structure-Activity Relationships · doi:10.1002/qsar.19920110208 · Cited by 313
Discovery of frequent DATALOG patterns
Dehaspe, L., & Toivonen, H. (1999) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009863704807 · Cited by 313
Theories for mutagenicity: a study in first-order and feature-based induction
Srinivasan, A., Muggleton, S. H., Sternberg, M. J. E., & King, R. D. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(95)00122-0 · Cited by 300
Data Mining Using MLC a Machine Learning Library in C
Kohavi, R., Sommerfield, D., & Dougherty, J. (1997) · Cited by 298
Vapnik, V. N. (1982) · Springer eBooks · Cited by 295
Learning Trees an ules with Set-val ed Features
Cohen, W. W. (1996) · Cited by 247
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Dean, T. (1999) · Cited by 186
Hypothesis-Driven Constructive Induction in AQ17-HCI: A Method and Experiments
Wnek, J., & Michalski, R. S. (1994) · Machine Learning · doi:10.1023/a:1022622132310 · Cited by 182
KARDIO: A study in deep and qualitative knowledge for expert systems
(1991) · Artificial Intelligence in Medicine · doi:10.1016/0933-3657(91)90006-w · Cited by 174
Learning nonrecursive definitions of relations with linus
Lavrač, N., Džeroski, S., & Grobelnik, M. (1991) · Lecture Notes in Computer Science · doi:10.1007/bfb0017020 · Cited by 161
Self-citationLogical settings for concept-learning
Raedt, L. D. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00041-6 · Cited by 154
Proceedings of the Ninth International Workshop on Machine Learning
Sleeman, D. H., & Edwards, P. J. (1992) · Cited by 153
Data mining using /spl Mscr/ℒ/spl Cscr/++ a machine learning library in C++
Kohavi, R., Sommerfield, D. A., & Dougherty, J. (2005) · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/tai.1996.560457 · Cited by 146
Learning relations by pathfinding
Richards, B. L., & Mooney, R. J. (1992) · Cited by 144
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
Self-citationAttribute-value learning versus inductive logic programming: The missing links
Raedt, L. D. (1998) · Lecture notes in computer science · doi:10.1007/bfb0027304 · Cited by 118
Srinivasan, A., & King, R. D. (1999) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009815821645 · Cited by 93
Krämer, S. (1996) · Cited by 92
1BC: A First-Order Bayesian Classifier
Flach, P. A., & Lachiche, N. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48751-4_10 · Cited by 85
Self-citationTractable induction and classification in first order logic via stochastic matching
Sébag, M., & Rouveirol, C. (1997) · Cited by 78
Strongly typed inductive concept learning
Flach, P. A., Giraud-Carrier, C. G., & Lloyd, J. W. (1998) · Lecture notes in computer science · doi:10.1007/bfb0027322 · Cited by 49
Self-citationStochastic propositionalization of non-determinate background knowledge
Kramer, S., Pfahringer, B., & Helma, C. (1998) · Lecture notes in computer science · doi:10.1007/bfb0027312 · Cited by 35
Self-citationBiochemical Knowledge Discovery Using Inductive Logic Programming
Muggleton, S., Srinivasan, A., King, R. D., & Sternberg, M. J. E. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49292-5_29 · Cited by 33
Representation Changes for Efficient Learning in Structural Domains.
Zucker, J., & Ganascia, J. (1996) · International Conference on Machine Learning · Cited by 30
Predicate Invention in Inductive Logic Programming
Athakravi, D., Broda, K. B., & Russo, A. (2012) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/oasics.iccsw.2012.15 · Cited by 24
Learning structurally indeterminate clauses
Zucker, J., & Ganascia, J. (1998) · Lecture notes in computer science · doi:10.1007/bfb0027327 · Cited by 23
Pac-learning nondeterminate clauses
Cohen, W. W. (1994) · Cited by 20
Turney, P. D. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0212039 · Cited by 12
Are Substitutions the Better Examples? Learning complete Set of Clauses with Frog.
Fensel, D., Zickwolff, M., & Wiese, M. (1995) · UvA-DARE (University of Amsterdam) · Cited by 6
Learning rules that classify ocular fundus images for glaucoma diagnosis
Mizoguchi, F., Ohwada, H., Daidoji, M., & Shirato, S. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63494-0_53 · Cited by 6
Cited by
Collective Classification in Network Data
Sen, P., Namata, G., Bilgic, M., Getoor, L., Gallagher, B., & Eliassi‐Rad, T. (2008) · AI Magazine · doi:10.1609/aimag.v29i3.2157 · Cited by 3,293
Fraud detection system: A survey
Abdallah, A., Maarof, M. A., & Zainal, A. (2016) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2016.04.007 · Cited by 708
Patki, N., Wedge, R., & Veeramachaneni, K. (2016) · 2016 IEEE International Conference on Data Science and Advanced Analytics (DSAA) · doi:10.1109/dsaa.2016.49 · Cited by 616
Getoor, L. (2006) · Advanced Information and Knowledge Processing · doi:10.1007/1-84628-284-5_7 · Cited by 612
Džeroski, S. (2006) · Data Mining and Knowledge Discovery Handbook · doi:10.1007/0-387-25465-x_41 · Cited by 520
Metadata
- Authors
- Kramer, S., Lavrač, N., & Flach, P.
- Venue
- Relational Data Mining
- Publisher
- Springer Berlin Heidelberg
- Published
- 2001
- Pages
- 262-291
- OpenAlex
- W1545331097
- Cited by
- 271
- References
- 54
- FWCI
- 49.77
- Type
- book chapter
- Language
- en
- Open access
- closed
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.