The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
CAIM discretization algorithm
Abstract
The task of extracting knowledge from databases is quite often performed by machine learning algorithms. The majority of these algorithms can be applied only to data described by discrete numerical or nominal attributes (features). In the case of continuous attributes, there is a need for a discretization algorithm that transforms continuous attributes into discrete ones. We describe such an algorithm, called CAIM (class-attribute interdependence maximization), which is designed to work with supervised data. The goal of the CAIM algorithm is to maximize the class-attribute interdependence and to generate a (possibly) minimal number of discrete intervals. The algorithm does not require the user to predefine the number of intervals, as opposed to some other discretization algorithms. The tests performed using CAIM and six other state-of-the-art discretization algorithms show that discrete attributes generated by the CAIM algorithm almost always have the lowest number of intervals and the highest class-attribute interdependency. Two machine learning algorithms, the CLIP4 rule algorithm and the decision tree algorithm, are used to generate classification rules from data discretized by CAIM. For both the CLIP4 and decision tree algorithms, the accuracy of the generated rules is higher and the number of the rules is lower for data discretized using the CAIM algorithm when compared to data discretized using six other discretization algorithms. The highest classification accuracy was achieved for data sets discretized with the CAIM algorithm, as compared with the other six algorithms.
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
(1992) · Cited by 23,431
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
An Algorithm for Vector Quantizer Design
Linde, Y., Buzo, A., & Gray, R. (1980) · IEEE Transactions on Communications · doi:10.1109/tcom.1980.1094577 · Cited by 7,201
Pattern Recognition Principles
(2009) · Classification Methods for Remotely Sensed Data, Second Edition · doi:10.1201/9781420090741.ch2 · Cited by 3,188
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
Clark, P., & Niblett, T. (1989) · Machine Learning · doi:10.1007/bf00116835 · Cited by 2,267
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
Rule induction with CN2: Some recent improvements
Clark, P., & Boswell, R. (1991) · Lecture Notes in Computer Science · doi:10.1007/bfb0017011 · Cited by 859
Michalski, R. S., Mozetič, I., Hong, J., & Nada Lavrač, A. (1986) · National Conference on Artificial Intelligence · Cited by 747
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
ChiMerge: discretization of numeric attributes
Kerber, R. (1992) · National Conference on Artificial Intelligence · Cited by 657
Data Mining Methods for Knowledge Discovery
Cios, K. J., Pedrycz, W., & Swiniarsk, R. M. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.728406 · Cited by 452
Self-citationOn changing continuous attributes into ordered discrete attributes
Catlett, J. (1991) · Lecture Notes in Computer Science · doi:10.1007/bfb0017012 · Cited by 426
Feature selection via discretization
Liu, H., & Setiono, R. (1997) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.617056 · Cited by 325
Data Mining Methods for Knowledge Discovery
Cios, K. J., Pedrycz, W., & Swiniarski, R. W. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5589-6 · Cited by 315
Self-citationClass-dependent discretization for inductive learning from continuous and mixed-mode data
Ching, J. Y., Wong, A. K. C., & Chan, K. C. C. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.391407 · Cited by 241
Synthesizing Statistical Knowledge from Incomplete Mixed-Mode Data
Wong, A. K. C., & Chiu, D. K. Y. (1987) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1987.4767986 · Cited by 192
Discretization Algorithm that Uses Class-Attribute Interdependence Maximization
Cios, K. J. (2001) · International Conference on Artificial Intelligence · Cited by 54
Self-citationCLIP4: Hybrid inductive machine learning algorithm that generates inequality rules
Cios, K. J., & Kurgan, L. (2003) · Information Sciences · doi:10.1016/j.ins.2003.03.015 · Cited by 52
Self-citation
Cited by
A Survey of Discretization Techniques: Taxonomy and Empirical Analysis in Supervised Learning
Garcia, S., Luengo, J., Sáez, J. A., López, V., & Herrera, F. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2012.35 · Cited by 548
A review of epileptic seizure detection using machine learning classifiers
Siddiqui, M. K., Morales-Menendez, R., Huang, X., & Hussain, N. (2020) · Brain Informatics · doi:10.1186/s40708-020-00105-1 · Cited by 432
Tutorial on practical tips of the most influential data preprocessing algorithms in data mining
García, S., Luengo, J., & Herrera, F. (2016) · Knowledge-Based Systems · doi:10.1016/j.knosys.2015.12.006 · Cited by 310
Data preprocessing in predictive data mining
Alexandropoulos, S.-A. N., Kotsiantis, S. B., & Vrahatis, M. N. (2019) · The Knowledge Engineering Review · doi:10.1017/s026988891800036x · Cited by 209
An effective hybrid learning system for telecommunication churn prediction
Huang, Y., & Kechadi, T. (2013) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.04.020 · Cited by 90
Metadata
- Authors
- Kurgan, L. A., & Cios, K. J.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2004-02
- Volume
- 16
- Issue
- 2
- Pages
- 145-153
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2170595610
- Cited by
- 443
- References
- 19
- FWCI
- 42.72
- 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.