The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Foundations of Rule Learning
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).”
Method
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Foundations of Rule Learning. https://app.cochat.ai/papers/10.1007/978-3-540-75197-7
- The paper
- Fürnkranz, J., Gamberger, D., & Lavrač, N. (2012). Foundations of Rule Learning. Cognitive Technologies. https://doi.org/10.1007/978-3-540-75197-7
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.