The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Discretization: An Enabling Technique
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
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
Classification And Regression Trees
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (2017) · doi:10.1201/9781315139470 · Cited by 11,417
Lohrli, A. (1985) · Notes and Queries · doi:10.1093/notesj/32.3.377-a · Cited by 4,352
Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning
Fayyad, U. M., & Irani, K. B. (1993) · International Joint Conference on Artificial Intelligence · Cited by 2,870
Irrelevant Features and the Subset Selection Problem
John, G. H., Kohavi, R., & Pfleger, K. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50023-4 · Cited by 2,368
UCI Repository of Machine Learning Databases
Merz, C. J. (1996) · Medical Entomology and Zoology · Cited by 2,363
Estimating the error rate of a prediction rule: improvement on cross-validation
Efron, B. (1983) · Journal of the American Statistical Association · doi:10.1080/01621459.1983.10477973 · Cited by 2,300
Supervised and Unsupervised Discretization of Continuous Features
Dougherty, J., Kohavi, R., & Sahami, M. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50032-3 · Cited by 1,936
Improved Use of Continuous Attributes in C4.5
Quinlan, J. R. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.279 · Cited by 1,846
Very Simple Classification Rules Perform Well on Most Commonly Used Datasets
Holte, R. C. (1993) · Machine Learning · doi:10.1023/a:1022631118932 · Cited by 1,791
An analysis of Bayesian classifiers
Langley, P., Iba, W., & Thompson, K. (1992) · Cited by 1,214
Quinlan (2003) · Cited by 1,000
Chi2: feature selection and discretization of numeric attributes
Liu, H., & Setiono, R. (2002) · Proceedings of 7th IEEE International Conference on Tools with Artificial Intelligence · doi:10.1109/tai.1995.479783 · Cited by 933
Self-citationIncremental Induction of Decision Trees
Utgoff, P. E. (1989) · Machine Learning · doi:10.1023/a:1022699900025 · Cited by 791
On the handling of continuous-valued attributes in decision tree generation
Fayyad, U. M., & Irani, K. B. (1992) · Machine Learning · doi:10.1007/bf00994007 · Cited by 745
Beyond Independence: Conditions for the Optimality of the Simple Bayesian Classifier.
Domingos, P., & Pazzani, M. J. (1996) · Cited by 690
Submodel Selection and Evaluation in Regression. The X-Random Case
Breiman, L., & Spector, P. (1992) · International Statistical Review / Revue Internationale de Statistique · doi:10.2307/1403680 · Cited by 669
ChiMerge: discretization of numeric attributes
Kerber, R. (1992) · National Conference on Artificial Intelligence · Cited by 657
Induction of Selective Bayesian Classifiers
LANGLEY, P., & SAGE, S. (1994) · Uncertainty Proceedings 1994 · doi:10.1016/b978-1-55860-332-5.50055-9 · Cited by 657
On changing continuous attributes into ordered discrete attributes
Catlett, J. (1991) · Lecture Notes in Computer Science · doi:10.1007/bfb0017012 · Cited by 426
A Distance-Based Attribute Selection Measure for Decision Tree Induction
De Mántaras, R. L. (1991) · Machine Learning · doi:10.1023/a:1022694001379 · Cited by 417
Concept learning and the problem of small disjuncts
Holte, R. C., Acker, L., & Porter, B. (1989) · Cited by 351
Global discretization of continuous attributes as preprocessing for machine learning
Chmielewski, M. R., & Grzymala-Busse, J. W. (1996) · International Journal of Approximate Reasoning · doi:10.1016/s0888-613x(96)00074-6 · Cited by 347
A Conservation Law for Generalization Performance
Schaffer, C. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50039-8 · Cited by 335
Feature selection via discretization
Liu, H., & Setiono, R. (1997) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.617056 · Cited by 325
Self-citationOptimal partitioning for classification and regression trees
Chou, P. A. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.88569 · Cited by 248
Discretizing continuous attributes while learning Bayesian networks
Friedman, N., & Goldszmidt, M. (1996) · Cited by 196
Decision trees and multi-valued attributes
Quilan, J. R. (1988) · Machine intelligence · Cited by 122
Large datasets lead to overly complex models: an explanation and a solution
Oates, T., & Jensen, D. D. (1998) · Cited by 68
Estimating the accuracy of learned concepts
Bailey, T. L., & Elkan, C. (1993) · International Joint Conference on Artificial Intelligence · Cited by 42
Decision tree pruning: biased or optimal?
Weiss, S. M., & Indurkhya, N. (1994) · National Conference on Artificial Intelligence · Cited by 29
BAYDA: software for Bayesian classification and feature selection
Kontkanen, P. T., Myllymäki, P. J., Silander, T., & Tirri, K. A. (1998) · Cited by 14
Cited by
Toward integrating feature selection algorithms for classification and clustering
Liu, H., & Yu, L. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.66 · Cited by 2,706
Self-citationUsing AUC and accuracy in evaluating learning algorithms
Huang, J., & Ling, C. X. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.50 · Cited by 2,148
KEEL: a software tool to assess evolutionary algorithms for data mining problems
Alcalá-Fdez, J., Sánchez, L., García, S., del Jesus, M. J., Ventura, S., Garrell, J. M., Otero, J., Romero, C., Bacardit, J., Rivas, V. M., et al. (2009) · Soft Computing · doi:10.1007/s00500-008-0323-y · Cited by 1,505
Prediction of Postoperative Pulmonary Complications in a Population-based Surgical Cohort
Canet, J., Gallart, L., Gomar, C., Paluzie, G., Vallès, J., Castillo, J., Sabaté, S., Mazo, V., Briones, Z., & Sanchis, J. (2010) · Anesthesiology · doi:10.1097/aln.0b013e3181fc6e0a · Cited by 1,459
Consistency-based search in feature selection
Dash, M., & Liu, H. (2003) · Artificial Intelligence · doi:10.1016/s0004-3702(03)00079-1 · Cited by 889
Self-citation
Metadata
- Authors
- Liu, H., Hussain, F., Tan, C. L., & Dash, M.
- Venue
- Data Mining and Knowledge Discovery
- Published
- 2002-10
- Volume
- 6
- Issue
- 4
- Pages
- 393-423
- ISSN
- 1384-5810 (ISSN-L)
- 1573-756X
- OpenAlex
- W2135511047
- Cited by
- 981
- References
- 35
- FWCI
- 46.87
- 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.