The DOI matches its Crossref record; 107 of the 107 references it cites were found in a registry or an index.
Separate-and-Conquer Rule Learning
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
(1992) · Cited by 23,431
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Classification And Regression Trees
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (2017) · doi:10.1201/9781315139470 · Cited by 11,417
Modeling by shortest data description
Rissanen, J. (1978) · Automatica · doi:10.1016/0005-1098(78)90005-5 · Cited by 6,011
Foundations of Logic Programming
Lloyd, J. W. (1984) · Springer eBooks · doi:10.1007/978-3-642-96826-6 · Cited by 4,128
Cohen, W. W. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50023-2 · Cited by 3,787
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (2015) · Measures of Complexity · doi:10.1007/978-3-319-21852-6_3 · Cited by 3,105
Foundations of Logic Programming
Lloyd, J. W. (1987) · Springer eBooks · doi:10.1007/978-3-642-83189-8 · Cited by 2,736
Quinlan, J. R. (1987) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(87)80053-6 · Cited by 2,553
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (1971) · Theory of Probability & Its Applications · doi:10.1137/1116025 · Cited by 2,448
Clark, P., & Niblett, T. (1989) · Machine Learning · doi:10.1007/bf00116835 · Cited by 2,267
Learning Logical Definitions from Relations
Quinlan, J. R. (1990) · Machine Learning · doi:10.1023/a:1022699322624 · Cited by 1,644
Foundations of logic programming; (2nd extended ed.)
Lloyd, J. W. (1987) · Springer eBooks · Cited by 1,501
Muggleton, S. (1995) · New Generation Computing · doi:10.1007/bf03037227 · Cited by 1,411
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
IVEY, J. E. (1969) · The Musical Quarterly · doi:10.1093/mq/lv.1.87 · Cited by 1,047
Muggleton, S. (1991) · New Generation Computing · doi:10.1007/bf03037089 · Cited by 1,044
A theory and methodology of inductive learning
Michalski, R. S. (1983) · Artificial Intelligence · doi:10.1016/0004-3702(83)90016-4 · Cited by 1,002
An Information Measure for Classification
Wallace, C. S., & Boulton, D. M. (1968) · The Computer Journal · doi:10.1093/comjnl/11.2.185 · Cited by 933
Rivest, R. L. (1987) · Machine Learning · doi:10.1007/bf00058680 · Cited by 886
Rule induction with CN2: Some recent improvements
Clark, P., & Boswell, R. (1991) · Lecture Notes in Computer Science · doi:10.1007/bfb0017011 · Cited by 859
A theory and methodology of inductive learning
Michalski, R. S. (1983) · Computer Compacts · doi:10.1016/0167-7136(83)90132-4 · Cited by 776
Michalski, R. S., Mozetič, I., Hong, J., & Nada Lavrač, A. (1986) · National Conference on Artificial Intelligence · Cited by 747
(1990) · Cited by 671
PRISM: An algorithm for inducing modular rules
Cendrowska, J. (1987) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(87)80003-2 · Cited by 650
An empirical comparison of selection measures for decision-tree induction
Mingers, J. (1989) · Machine Learning · doi:10.1007/bf00116837 · Cited by 561
Generating Production Rules From Decision Trees
Quinlan, J. R. (1987) · Cited by 488
SHAVLIK, J. W., Deitterich, T. E., & Dietterich, T. G. (1991) · Cited by 425
Pattern Recognition as Rule-Guided Inductive Inference
Michalski, R. S. (1980) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1980.4767034 · Cited by 405
Boolean Feature Discovery in Empirical Learning
Pagallo, G., & Haussler, D. (1990) · Machine Learning · doi:10.1023/a:1022611825350 · Cited by 390
Incremental Reduced Error Pruning
Fürnkranz, J., & Widmer, G. (1994) · Elsevier eBooks · doi:10.1016/b978-1-55860-335-6.50017-9 · Cited by 376
Self-citationConcept learning and the problem of small disjuncts
Holte, R. C., Acker, L., & Porter, B. (1989) · Cited by 351
Reducing Misclassification Costs
Pazzani, M., Merz, C., Murphy, P., Ali, K., Hume, T., & Brunk, C. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50034-9 · Cited by 340
Advances in Inductive Logic Programming
Raedt, L. D. (1996) · Cited by 318
Schaffer, C. (1993) · Machine Learning · doi:10.1023/a:1022653209073 · Cited by 310
The utility of knowledge in inductive learning
Pazzani, M., & Kibler, D. (1992) · Machine Learning · doi:10.1007/bf00993254 · Cited by 306
Shift of bias for inductive concept learning
Utgoff, P. E. (1984) · Cited by 279
A further comparison of splitting rules for decision-tree induction
Buntine, W., & Niblett, T. (1992) · Machine Learning · doi:10.1007/bf00994006 · Cited by 269
Wrappers for Performance Enhancements and Oblivious Decision Graphs.
Kohavi, R. (1995) · Cited by 248
Unifying instance-based and rule-based induction
Domingos, P. (1996) · Machine Learning · doi:10.1007/bf00058656 · Cited by 242
Necessary and Sufficient Conditions for the Uniform Convergence of Means to their Expectations
Vapnik, V. N., & Chervonenkis, A. Y. (1982) · Theory of Probability and Its Applications · doi:10.1137/1126059 · Cited by 236
SIA: A supervised inductive algorithm with genetic search for learning attributes based concepts
Venturini, G. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56602-3_142 · Cited by 212
OPUS: An Efficient Admissible Algorithm for Unordered Search
Webb, G. I. (1995) · Journal of Artificial Intelligence Research · doi:10.1613/jair.227 · Cited by 207
Automatic Parameter Selection by Minimizing Estimated Error
Kohavi, R., & John, G. H. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50045-1 · Cited by 202
Rule-based Machine Learning Methods for Functional Prediction
Weiss, S. M., & Indurkhya, N. (1995) · Journal of Artificial Intelligence Research · doi:10.1613/jair.199 · Cited by 183
Induction of logic programs: FOIL and related systems
Quinlan, J. R., & Cameron-Jones, R. M. (1995) · New Generation Computing · doi:10.1007/bf03037228 · Cited by 183
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
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
Karalič, A., & Bratko, I. (1997) · Machine Learning · doi:10.1023/a:1007365207130 · Cited by 146
Interactive theory revision: an inductive logic programming approach
Raedt, L. D. (1992) · Academic Press eBooks · Cited by 143
Pruning Algorithms for Rule Learning
Fürnkranz, J. (1997) · Machine Learning · doi:10.1023/a:1007329424533 · Cited by 137
Self-citationOversearching and layered search in empirical learning
Quinlan, J. R., & Cameron-Jones, R. M. (1995) · Cited by 119
Raedt, L. D., & Laer, W. V. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60454-5_30 · Cited by 112
Inductive Logic Programming: From Machine Learning to Software Engineering
Bergadano, F., & Gunetti, D. (1995) · The MIT Press eBooks · doi:10.7551/mitpress/3731.001.0001 · Cited by 105
Induction of First-Order Decision Lists: Results on Learning the Past Tense of English Verbs
Mooney, R. J., & Califf, M. E. (1995) · Journal of Artificial Intelligence Research · doi:10.1613/jair.148 · Cited by 103
Learning Two-Tiered Descriptions of Flexible Concepts: The POSEIDON System
Bergadano, F., Matwin, S., Michalski, R. S., & Zhang, J. (1992) · Machine Learning · doi:10.1023/a:1022682318197 · Cited by 101
Krämer, S. (1996) · Cited by 92
Cohen, W. W. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90070-1 · Cited by 92
Learning First-Order Definitions of Functions
Quinlan, J. R. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.308 · Cited by 90
An algorithm that infers theories from facts
Shapiro, E. Y. (1981) · International Joint Conference on Artificial Intelligence · Cited by 87
Efficient Pruning Methods for Separate-and-Conquer Rule Learning Systems.
Cohen, W. W. (1993) · Cited by 83
Extensions of Inversion of Resolution Applied to Theory Completion
Rouveirol, C. (1992) · Inductive Logic Programming · Cited by 80
A KNOWLEDGE INTENSIVE APPROACH TO CONCEPT INDUCTION
Bergadano, F., & Giordana, A. (1988) · Elsevier eBooks · doi:10.1016/b978-0-934613-64-4.50037-2 · Cited by 79
An Experimental Comparison of Human and Machine Learning Formalisms
Muggleton, S., Bain, M., Michie, J. H., & Michie, D. (1989) · Elsevier eBooks · doi:10.1016/b978-1-55860-036-2.50037-0 · Cited by 78
Automated concept acquisition in noisy environments
Bergadano, F., Giordana, A., & Saitta, L. (1988) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.3917 · Cited by 74
An Investigation of Noise-Tolerant Relational Concept Learning Algorithms
Brunk, C. A., & Pazzani, M. J. (1991) · Elsevier eBooks · doi:10.1016/b978-1-55860-200-7.50080-5 · Cited by 73
Determinate Literals in Inductive Logic Programming
Quinlan, J. R. (1991) · Elsevier eBooks · doi:10.1016/b978-1-55860-200-7.50091-x · Cited by 73
Weiss, S. M., & Indurkhya, N. (1993) · IEEE Expert · doi:10.1109/64.248354 · Cited by 72
Relational clichés: Constraining constructive induction during relational learning
Silverstein, G., & Pazzani, M. J. (1991) · Elsevier eBooks · doi:10.1016/b978-1-55860-200-7.50044-1 · Cited by 71
Flattening and Saturation: Two Representation Changes for Generalization
Rouveirol, C. (1994) · Machine Learning · doi:10.1023/a:1022678217288 · Cited by 69
Induction as nonmonotonic inference
Helft, N. (1989) · Principles of Knowledge Representation and Reasoning · Cited by 68
Reduced complexity rule induction
Weiss, S. M., & Indurkhya, N. (1991) · Cited by 62
HYDRA: A Noise-tolerant Relational Concept Learning Algorithm.
Ali, K., & Pazzani, M. J. (1993) · eScholarship (California Digital Library) · Cited by 54
Combining Top-down and Bottom-up Techniques in Inductive Logic Programming
Zelle, J. M., Mooney, R. J., & Konvisser, J. B. (1994) · Elsevier eBooks · doi:10.1016/b978-1-55860-335-6.50049-0 · Cited by 53
SMART+: a multi-strategy learning tool
Botta, M., & Giordana, A. (1993) · Institutional Research Information System University of Turin (University of Turin) · Cited by 49
Learning decision lists using homogeneous rules
Segal, R. B., & Etzioni, O. (1994) · Cited by 48
An Interactive System to Learn Functional Logic Programs.
Bergadano, F., & Gunetti, D. (1993) · Institutional Research Information System University of Turin (University of Turin) · Cited by 47
On Overfitting Avoidance as BiasPreprint
Wolpert, D. H. (1993) · RePEc: Research Papers in Economics · Cited by 46
Learning two-tiered descriptions of flexible concepts: The POSEIDON system
Bergadano, F., Matwin, S., Michalski, R. S., & Zhang, J. (1992) · Machine Learning · doi:10.1007/bf00994004 · Cited by 45
BEXA: A Covering Algorithm for Learning Propositional Concept Descriptions
Theron, H., & Cloete, I. (1996) · Machine Learning · doi:10.1007/bf00117830 · Cited by 44
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
The Minimum Description Length Principle and Categorical Theories
Quinlan, J. R. (1994) · Elsevier eBooks · doi:10.1016/b978-1-55860-335-6.50036-2 · Cited by 39
Discrimination-based Constructive Induction
Kijsirikul, B., Numao, M., & Shimura, M. (1992) · National Conference on Artificial Intelligence · Cited by 37
Encouraging Experimental Results on Learning CNF
Mooney, R. J. (1995) · Machine Learning · doi:10.1007/bf00994661 · Cited by 37
FOSSIL: A robust relational learner
Fürnkranz, J. (1994) · Lecture notes in computer science · doi:10.1007/3-540-57868-4_54 · Cited by 33
Self-citationAvoiding Pitfalls When Learning Recursive Theories.
Cameron-Jones, R. M., & Quinlan, J. R. (1993) · International Joint Conference on Artificial Intelligence · Cited by 33
Covering vs divide-and-conquer for top-down induction of logic programs
Boström, H. (1995) · Cited by 30
Learning Structured Concepts Using Genetic Algorithms
Giordana, A., & Sale, C. (1992) · Elsevier eBooks · doi:10.1016/b978-1-55860-247-2.50027-9 · Cited by 27
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
Learning structural decision trees from examples
Watanabe, L., & Rendell, L. A. (1991) · International Joint Conference on Artificial Intelligence · Cited by 26
DEDUCTION IN TOP-DOWN INDUCTIVE LEARNING
Bergadano, F., Giordana, A., & Ponsero, S. (1989) · Elsevier eBooks · doi:10.1016/b978-1-55860-036-2.50011-4 · Cited by 24
Learning as Optimization: Stochastic Generation of Multiple Knowledge
Kononenko, I., & Kovačič, M. (1992) · Elsevier eBooks · doi:10.1016/b978-1-55860-247-2.50038-3 · Cited by 23
Controlling constructive induction in CIPF: An MDL approach
Pfahringer, B. (1994) · Lecture notes in computer science · doi:10.1007/3-540-57868-4_62 · Cited by 21
Applying ILP to diterpene structure elucidation from 13C NMR spectra
Džeroski, S., Schulze-Kremer, S., Heidtke, K. R., Siems, K., & Wettschereck, D. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63494-0_47 · Cited by 20
Efficient Learning of Logic Programs with Non-determinate, Non-discriminating Literals
Kijsirikul, B., Numao, M., & Shimura, M. (1991) · Elsevier eBooks · doi:10.1016/b978-1-55860-200-7.50086-6 · Cited by 17
Indirect relevance and bias in inductive concept-learning
Raedt, L. D., & Bruynooghe, M. (1990) · Knowledge Acquisition · doi:10.1016/s1042-8143(05)80014-7 · Cited by 15
Refinement of rule sets with JoJo
Fensel, D., & Wiese, M. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56602-3_154 · Cited by 14
Experiments in non-monotonic learning
Bain, M. (1991) · Elsevier eBooks · doi:10.1016/b978-1-55860-200-7.50078-7 · Cited by 12
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
A tight integration of pruning and learning (Extended abstract)
Fürnkranz, J. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59286-5_70 · Cited by 6
Self-citationRelational Clichés: Constraining Induction During Relational Learning.
Silverstein, G., & Pazzani, M. J. (1991) · Machine Learning · Cited by 4
Cited by
Machine learning: a review of classification and combining techniques
Kotsiantis, S. B., Zaharakis, I. D., & Pintelas, P. E. (2006) · Artificial Intelligence Review · doi:10.1007/s10462-007-9052-3 · Cited by 1,582
Generating Accurate Rule Sets Without Global Optimization
Frank, E., & Witten, I. H. (1998) · Research Commons (University of Waikato) · doi:10.5555/645527.657305 · Cited by 1,269
Comprehensive Review of Artificial Neural Network Applications to Pattern Recognition
Abiodun, O. I., Kiru, M. U., Jantan, A., Omolara, A. E., Dada, K. V., Umar, A. M., Linus, O. U., Arshad, H., Kazaure, A. A., & Gana, U. (2019) · IEEE Access · doi:10.1109/access.2019.2945545 · Cited by 750
Knowledge Discovery in Multi-label Phenotype Data
Clare, A., & King, R. D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44794-6_4 · Cited by 726
Comprehensible classification models: a position paper
Freitas, A. A. (2014) · ACM SIGKDD Explorations Newsletter · doi:10.1145/2594473.2594475 · Cited by 572
Metadata
- Authors
- Fürnkranz, J.
- Venue
- Artificial Intelligence Review
- Published
- 1999-02
- Volume
- 13
- Issue
- 1
- Pages
- 3-54
- ISSN
- 0269-2821 (ISSN-L)
- 1573-7462
- OpenAlex
- W1671614046
- Cited by
- 528
- References
- 107
- FWCI
- 26.62
- Type
- journal article
- 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.