Foundations of Rule Learning
The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439 · cited 7×
“In the well-known C4.5 decision tree algorithm, which uses information-theoretic entropy as a purity measure (Quinlan, 1986), the difference between the original purity value and the sum of the purity values of the successor nodes weighted by the relative sizes of these nodes, is used to estimate…”
BackgroundMethodInfluentialThe use of ranks to avoid the assumption of normality implicit in the analysis of variance
Friedman, M. (1937) · Journal of the American Statistical Association · doi:10.1080/01621459.1937.10503522 · Cited by 7,005
Fundamentals of Database Systems
Elmasri, R. A., & Navathe, S. B. (1989) · Cited by 3,141
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
An empirical study of smoothing techniques for language modeling
Chen, S. F., & Goodman, J. (1999) · Computer Speech & Language · doi:10.1006/csla.1999.0128 · Cited by 2,066
Multiclass cancer diagnosis using tumor gene expression signatures
Ramaswamy, S., Tamayo, P., Rifkin, R., Mukherjee, S., Yeang, C.-H., Angelo, M., Ladd, C., Reich, M., Latulippe, E., Mesirov, J. P., et al. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.211566398 · Cited by 2,023 · cited 4×
“In our rule induction experiments a publicly available dataset described by Ramaswamy et al. (2001) was used.”
BackgroundMethodResultInfluentialKnowledge acquisition via incremental conceptual clustering
Fisher, D. H. (1987) · Machine Learning · doi:10.1007/bf00114265 · Cited by 1,991
On a class of error correcting binary group codes
Bose, R. C., & Ray-Chaudhuri, D. K. (1960) · Information and Control · doi:10.1016/s0019-9958(60)90287-4 · Cited by 1,367
Predictive learning via rule ensembles
Friedman, J. H., & Popescu, B. E. (2008) · The Annals of Applied Statistics · doi:10.1214/07-aoas148 · Cited by 1,315
Learning Efficient Classification Procedures and Their Application to Chess End Games
Quinlan, J. R. (1983) · Machine Learning · doi:10.1007/978-3-662-12405-5_15 · Cited by 1,178 · cited 3×
“CN2 (Clark & Niblett, 1989), named after the initials of its inventors, tried to combine ideas from AQ with the then-popular decision tree learning algorithm ID3 (Quinlan, 1983).”
MethodNew algorithms for fast discovery of association rules
Zaki, M. J., Parthasarathy, S., Ogihara, M., & Wei, L. (1997) · Cited by 1,126
A theory and methodology of inductive learning
Michalski, R. S. (1983) · Computer Compacts · doi:10.1016/0167-7136(83)90132-4 · Cited by 776
An Empirical Comparison of Pruning Methods for Decision Tree Induction
Mingers, J. (1989) · Machine Learning · doi:10.1023/a:1022604100933 · Cited by 627
Applications of machine learning and rule induction
Langley, P., & Simon, H. A. (1995) · Communications of the ACM · doi:10.1145/219717.219768 · Cited by 505
Boolean Feature Discovery in Empirical Learning
Pagallo, G., & Haussler, D. (1990) · Machine Learning · doi:10.1023/a:1022611825350 · Cited by 390
Concept learning and the problem of small disjuncts
Holte, R. C., Acker, L., & Porter, B. (1989) · Cited by 351
(2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46027-6 · Cited by 346
Learning Decision Trees Using the Area Under the ROC Curve
Ferri, C., Flach, P. A., & Hernández‐Orallo, J. (2002) · Bristol Research (University of Bristol) · Cited by 296
Rule Induction Using Information Theory.
Smyth, P., & Goodman, R. M. (1991) · Cited by 239
Expert-Guided Subgroup Discovery: Methodology and Application
Gamberger, D., & Lavrač, N. (2002) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1089 · Cited by 214
Self-citationObtaining Calibrated Probabilities from BoostingPreprint
Niculescu-Mizil, A., & Caruana, R. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.1403 · Cited by 183
Data Mining and Statistics: what's the connection?
Calò, D. G. (2009) · AMS Campus - AlmaDL · Cited by 173
Learning to Classify Ordinal Data: The Data Replication Method
Cardoso, J. S., & da Costa, J. P. (2007) · doi:10.5555/1314498.1314546 · Cited by 161
Comparative Evaluation of Approaches to Propositionalization
Krogel, M.-A., Rawles, S., Železný, F., Flach, P. A., Lavrač, N., & Wrobel, S. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39917-9_14 · Cited by 152
Karalič, A., & Bratko, I. (1997) · Machine Learning · doi:10.1023/a:1007365207130 · Cited by 146
Propositionalization-based relational subgroup discovery with RSD
Železný, F., & Lavrač, N. (2006) · Machine Learning · doi:10.1007/s10994-006-5834-0 · Cited by 114 · cited 1×
“databases, and by Zelezný and Lavrač (2006) with the RSD algorithm for relational subgroup discovery.”
MethodSelf-citationFurther Experimental Evidence against the Utility of Occam's Razor
Webb, G. I. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.228 · Cited by 110
Data Mining for Association Rules and Sequential Patterns: Sequential and Parallel Algorithms
Adamo, J. (2000) · Cited by 109
Repairing concavities in ROC curves
Flach, P. A., & Wu, S. (2005) · Kent Academic Repository (University of Kent) · Cited by 109
Inductive Logic Programming for Knowledge Discovery in Databases
Wrobel, S. (2001) · Springer eBooks · doi:10.1007/978-3-662-04599-2_4 · Cited by 97 · cited 1×
“first-order clustering (Kirsten, Wrobel, & Horvath, 2001), database restructuring (Flach, 1993), subgroup discovery (Flach & Lachiche, 2001; Wrobel, 2001), and other forms of descriptive rule learning.”
BackgroundEfficient Pruning Methods for Separate-and-Conquer Rule Learning Systems.
Cohen, W. W. (1993) · Cited by 83
Mining Changes for Real-Life Applications
Liu, B., Hsu, W., Han, H. S., & Xia, Y. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44466-1_34 · Cited by 81
Using the m -estimate in rule induction
Džeroski, S., Cestnik, B., & Petrovski, I. (1993) · Journal of Computing and Information Technology · Cited by 64
ROCCER: an Algorithm for Rule Learning Based on ROC Analysis
Prati, R. C., & Flach, P. A. (2005) · Explore Bristol Research · Cited by 43
Predicate invention in inductive data engineering
Flach, P. A. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56602-3_129 · Cited by 40
Relational Rule Induction with CProgol4.4: A Tutorial Introduction
Muggleton, S., & Firth, J. (2001) · Springer eBooks · doi:10.1007/978-3-662-04599-2_7 · Cited by 40
Decision tree pruning as a search in the state space
Esposito, F., Malerba, D., & Semeraro, G. M. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56602-3_135 · Cited by 34
Learning Relational Concepts with Decision Trees.
Geibel, P., & Wysotzki, F. (1996) · International Conference on Machine Learning · Cited by 33
Avoiding Pitfalls When Learning Recursive Theories.
Cameron-Jones, R. M., & Quinlan, J. R. (1993) · International Joint Conference on Artificial Intelligence · Cited by 33
Using ILP to Construct Features for Information Extraction from Semi-structured Text
Ramakrishnan, G., Joshi, S., Balakrishnan, S., & Srinivasan, A. (2008) · Springer eBooks · doi:10.1007/978-3-540-78469-2_22 · Cited by 31
Structuring knowledge by asking questions
Muggleton, S. (1987) · Cited by 21
Is the UCI Repository Useful for Data Mining?
Soares, C. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-24580-3_28 · Cited by 20 · cited 1×
“Although there is some evidence that these problems may be overestimated (Soares, 2003), the debate is still going on.”
BackgroundAn Empirical Comparison of Probability Estimation Techniques for Probabilistic Rules
Sulzmann, J.-N., & Fürnkranz, J. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04747-3_25 · Cited by 19
Self-citationPeña‐Castillo, L., & Wrobel, S. (2004) · International Conference on Machine Learning · doi:10.1145/1015330.1015334 · Cited by 17
Subgroup Visualization: A Method and Application in Population Screening
Gamberger, D., & Wettschereck, D. (2002) · Cited by 16
Self-citationRobust Probabilistic Calibration
Stefan Rüping, A. (2006) · Lecture notes in computer science · doi:10.1007/11871842_75 · Cited by 14 · cited 1×
“In machine learning, this problem of correcting overly optimistic probability estimates is also known as calibrating probabilities (Niculescu-Mizil & Caruana, 2005b; Rüping, 2006; Zadrozny & Elkan, 2001).”
BackgroundA Comparison of Techniques for Selecting and Combining Class Association Rules
Sulzmann, J.-N., & Fürnkranz, J. (2008) · Cited by 13
Self-citationCheckpoint evolution for volatile correlation computing
Zhou, W., & Xiong, H. Y. (2010) · Machine Learning · doi:10.1007/s10994-010-5204-9 · Cited by 8
Comparison of search strategies in learning relations
Botta, M., Giordana, A., & Saitta, L. (1992) · Institutional Research Information System University of Turin (University of Turin) · Cited by 7
Gamberger, D., Lavrač, N., & Krstačić, G. (2002) · Journal of Intelligent & Fuzzy Systems · doi:10.3233/ifs-2002-00165 · Cited by 5
Self-citation(2008) · Springer eBooks · doi:10.1007/978-1-4020-6754-9_17794 · Cited by 5
Cited by
Machine Learning: The art and science of algorithms that make sense of data
Flach, P. A. (2012) · Cited by 697
Interpretable Machine Learning – A Brief History, State-of-the-Art and Challenges
Molnar, C., Casalicchio, G., & Bischl, B. (2020) · Communications in Computer and Information Science · doi:10.1007/978-3-030-65965-3_28 · Cited by 677
“Rule-based ML, which covers decision rules and decision trees, has been an active research area since the middle of the 20th century [35].”
BackgroundHybrid approaches to optimization and machine learning methods: a systematic literature review
Azevedo, B. F., Rocha, A. M. A. C., & Pereira, A. I. (2024) · Machine Learning · doi:10.1007/s10994-023-06467-x · Cited by 291
“These models and algorithms intend to generate a mathematical model that describes the data set and generalizes the knowledge to unknown data samples (Azevedo et al., 2019; Fürnkranz et al., 2012).”
Fernandez, A., Herrera, F., Cordon, O., Jose del Jesus, M., & Marcelloni, F. (2019) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2018.2881645 · Cited by 232
Mienye, I. D., Obaido, G., Jere, N., Mienye, E., Aruleba, K., Emmanuel, I. D., & Ogbuokiri, B. (2024) · Informatics in Medicine Unlocked · doi:10.1016/j.imu.2024.101587 · Cited by 212
Metadata
- Authors
- Fürnkranz, J., Gamberger, D., & Lavrač, N.
- Affiliations
- Technische Universität Darmstadt (DE)
- Ruđer Bošković Institute (HR)
- Venue
- Cognitive Technologies
- Publisher
- Springer Berlin Heidelberg
- Published
- 2012
- ISSN
- 1611-2482 (ISSN-L)
- OpenAlex
- W1494581921
- Cited by
- 428
- References
- 51
- Citations by year
- 2026: 11 · 2025: 33 · 2024: 36 · 2023: 52 · 2022: 35 · 2021: 41 · 2020: 56 · 2019: 38 · 2018: 29 · 2017: 22 · 2016: 30 · 2015: 16 · 2014: 20 · 2013: 7 · 2012: 2
- FWCI
- 20.42
- Type
- book
- Language
- en
- Open access
- closed
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- Locations
- Cognitive technologies (publishedVersion)
- Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)) (submittedVersion)
- TUbilio (Technical University of Darmstadt) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
- Physical Sciences › Computer Science › Information Systems › Data Mining and Machine Learning Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Keywords
- rule induction, inductive logic programming, knowledge representation, data mining
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.