The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Learning decision lists
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Modeling by shortest data description
Rissanen, J. (1978) · Automatica · doi:10.1016/0005-1098(78)90005-5 · Cited by 6,011
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1987) · Information Processing Letters · doi:10.1016/0020-0190(87)90114-1 · Cited by 1,054
Computational limitations on learning from examples
Pitt, L., & Valiant, L. G. (1988) · Journal of the ACM · doi:10.1145/48014.63140 · Cited by 515
Generating Production Rules From Decision Trees
Quinlan, J. R. (1987) · Cited by 488
On the learnability of Boolean formulae
Kearns, M., Li, M., Pitt, L., & Valiant, L. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28426 · Cited by 284
Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12158 · Cited by 159
ON THE CONNECTION BETWEEN THE COMPLEXITY AND CREDIBILITY OF INFERRED MODELS
Pearl, J. (1978) · International Journal of General Systems · doi:10.1080/03081077808960690 · Cited by 93
Valiant, L. G. (2026) · Foundations of Computation and Machine Learning · doi:10.1145/3749740.3749746
Cited by
The Strength of Weak Learnability
Schapire, R. E. (1990) · Machine Learning · doi:10.1007/bf00116037 · Cited by 4,600
Unsupervised word sense disambiguation rivaling supervised methods
Yarowsky, D. (1995) · Proceedings of the 33rd annual meeting on Association for Computational Linguistics - · doi:10.3115/981658.981684 · Cited by 2,385
Clark, P., & Niblett, T. (1989) · Machine Learning · doi:10.1007/bf00116835 · Cited by 2,267
Learnability and the Vapnik-Chervonenkis dimension
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1989) · Journal of the ACM · doi:10.1145/76359.76371 · Cited by 1,839
Word sense disambiguation: A survey
Navigli, R. (2009) · ACM Computing Surveys · doi:10.1145/1459352.1459355 · Cited by 1,819
Learning Logical Definitions from Relations
Quinlan, J. R. (1990) · Machine Learning · doi:10.1023/a:1022699322624 · Cited by 1,644
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
Artificial Intelligence: A New Synthesis
(1998) · Elsevier eBooks · doi:10.1016/c2009-0-27773-7 · Cited by 1,163
Interpretable machine learning: Fundamental principles and 10 grand challenges
Rudin, C., Chen, C., Chen, Z., Huang, H., Semenova, L., & Zhong, C. (2022) · Statistics Surveys · doi:10.1214/21-ss133 · Cited by 958
A survey of multiple classifier systems as hybrid systems
Woźniak, M., Graña, M., & Corchado, E. (2014) · Information Fusion · doi:10.1016/j.inffus.2013.04.006 · Cited by 912
Rule induction with CN2: Some recent improvements
Clark, P., & Boswell, R. (1991) · Lecture Notes in Computer Science · doi:10.1007/bfb0017011 · Cited by 859
Letham, B., Rudin, C., McCormick, T. H., & Madigan, D. (2015) · The Annals of Applied Statistics · doi:10.1214/15-aoas848 · Cited by 766
“In the past, associative classifiers have been constructed from heuristic greedy sorting mechanisms [Rivest (1987), Liu, Hsu and Ma (1998), Marchand and Sokolova (2005), Rudin, Letham and Madigan (2013)].”
MethodPrécis of Simple heuristics that make us smart
Todd, P. M., & Gigerenzer, G. (2000) · Behavioral and Brain Sciences · doi:10.1017/s0140525x00003447 · Cited by 713
Interpretable Decision Sets: A Joint Framework for Description and Prediction
Lakkaraju, H., Bach, S. H., & Leskovec, J. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939874 · Cited by 687
García, S., Fernández, A., Luengo, J., & Herrera, F. (2009) · Soft Computing · doi:10.1007/s00500-008-0392-y · Cited by 682
Efficient noise-tolerant learning from statistical queries
Kearns, M. (1998) · Journal of the ACM · doi:10.1145/293347.293351 · Cited by 665
LERS-A System for Learning from Examples Based on Rough Sets
Grzymala-Busse, J. W. (1992) · Intelligent Decision Support · doi:10.1007/978-94-015-7975-9_1 · Cited by 653
Constant depth circuits, Fourier transform, and learnability
Linial, N., Mansour, Y., & Nisan, N. (1993) · Journal of the ACM · doi:10.1145/174130.174138 · Cited by 572
Operations for Learning with Graphical Models
Buntine, W. L. (1994) · Journal of Artificial Intelligence Research · doi:10.1613/jair.62 · Cited by 530
Separate-and-Conquer Rule Learning
Fürnkranz, J. (1999) · Artificial Intelligence Review · doi:10.1023/a:1006524209794 · Cited by 528
Deep learning-based feature engineering for stock price movement prediction
Long, W., Lu, Z., & Cui, L. (2019) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.10.034 · Cited by 483
A general lower bound on the number of examples needed for learning
Ehrenfeucht, A., Haussler, D., Kearns, M., & Valiant, L. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90002-3 · Cited by 403
Boolean Feature Discovery in Empirical Learning
Pagallo, G., & Haussler, D. (1990) · Machine Learning · doi:10.1023/a:1022611825350 · Cited by 390
The independent choice logic for modelling multiple agents under uncertainty
Poole, D. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00027-1 · Cited by 383
Yarowsky, D. (1993) · Proceedings of the workshop on Human Language Technology - HLT '93 · doi:10.3115/1075671.1075731 · Cited by 376
Efficient distribution-free learning of probabilistic concepts
Kearns, M. J., & Schapire, R. E. (1994) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(05)80062-5 · Cited by 373
Teleo-Reactive Programs for Agent Control
Nilsson, N. (1994) · Journal of Artificial Intelligence Research · doi:10.1613/jair.30 · Cited by 366
Stochastic dynamic programming with factored representations
Boutilier, C., Dearden, R., & Goldszmidt, M. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(00)00033-3 · Cited by 361
An information theoretic approach to rule induction from databases
Smyth, P., & Goodman, R. M. (1992) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.149926 · Cited by 356
Yarowsky, D. (1994) · Proceedings of the 32nd annual meeting on Association for Computational Linguistics - · doi:10.3115/981732.981745 · Cited by 356
Learning in the Presence of Malicious Errors
Kearns, M., & Li, M. (1993) · SIAM Journal on Computing · doi:10.1137/0222052 · Cited by 340
Computational learning theory: survey and selected bibliography
Angluin, D. (1992) · Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 · doi:10.1145/129712.129746 · Cited by 316
The relationship between trust in AI and trustworthy machine learning technologies
Toreini, E., Aitken, M., Coopamootoo, K., Elliott, K., Zelaya, C. G., & van Moorsel, A. (2020) · Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency · doi:10.1145/3351095.3372834 · Cited by 296
Goldman, S. A., & Kearns, M. J. (1995) · Journal of Computer and System Sciences · doi:10.1006/jcss.1995.1003 · Cited by 257
Rulematrix: Visualizing and understanding classifiers with rules
Ming, Y., Qu, H., & Bertini, E. (2019) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2018.2864812 · Cited by 243
(2015) · International Conference on Artificial Intelligence and Statistics · Cited by 162
Narayanan, M., Chen, E., He, J., Kim, B., Gershman, S., & Doshi-Velez, F. (2018) · arXiv · doi:10.48550/arxiv.1802.00682 · Cited by 153
Agnostic Learning of Monomials by Halfspaces Is Hard
Feldman, V., Guruswami, V., Raghavendra, P., & Wu, Y. (2012) · SIAM Journal on Computing · doi:10.1137/120865094 · Cited by 143
An Evaluation of the Human-Interpretability of Explanation
Lage, I., Chen, E., He, J., Narayanan, M., Kim, B., Gershman, S., & Doshi-Velez, F. (2019) · arXiv · doi:10.48550/arxiv.1902.00006 · Cited by 125
Learning Certifiably Optimal Rule Lists for Categorical Data
Angelino, E., Larus-Stone, N., Alabi, D., Seltzer, M., & Rudin, C. (2017) · arXiv · doi:10.48550/arxiv.1704.01701 · Cited by 108
(2017) · doi:10.1145/3097983.3098047 · Cited by 104
A Review on Human–Machine Trust Evaluation: Human-Centric and Machine-Centric Perspectives
Gebru, B., Zeleke, L., Blankson, D., Nabil, M., Nateghi, S., Homaifar, A., & Tunstel, E. (2022) · IEEE Transactions on Human-Machine Systems · doi:10.1109/thms.2022.3144956 · Cited by 101
Fairwashing: the risk of rationalization
Aïvodji, U., Arai, H., Fortineau, O., Gambs, S., Hara, S., & Tapp, A. (2019) · arXiv · doi:10.48550/arxiv.1901.09749 · Cited by 54
Classification in the Wild: The Science and Art of Transparent Decision Making
Katsikopoulos, K. V., Şimşek, Ö., Buckmann, M., & Gigerenzer, G. (2021) · doi:10.7551/mitpress/11790.001.0001 · Cited by 42
Supersparse Linear Integer Models for Interpretable Classification
Ustun, B., Tracà, S., & Rudin, C. (2013) · arXiv · doi:10.48550/arxiv.1306.6677 · Cited by 26
Metadata
- Authors
- Rivest, R. L.
- Venue
- Machine Learning
- Published
- 1987-11
- Volume
- 2
- Issue
- 3
- Pages
- 229-246
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W2428981601
- Cited by
- 886
- References
- 10
- FWCI
- 16.83
- Type
- journal article
- Language
- en
- Open access
- bronze
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.