The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Class-dependent discretization for inductive learning from continuous and mixed-mode data
Abstract
Inductive learning systems can be effectively used to acquire classification knowledge from examples. Many existing symbolic learning algorithms can be applied in domains with continuous attributes when integrated with a discretization algorithm to transform the continuous attributes into ordered discrete ones. In this paper, a new information theoretic discretization method optimized for supervised learning is proposed and described. This approach seeks to maximize the mutual dependence as measured by the interdependence redundancy between the discrete intervals and the class labels, and can automatically determine the most preferred number of intervals for an inductive learning application. The method has been tested in a number of inductive learning examples to show that the class-dependent discretizer can significantly improve the classification performance of many existing learning algorithms in domains containing numeric attributes.>
Overview
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
Cited by
Neighborhood rough set based heterogeneous feature subset selection
Hu, Q., Yu, D., Liu, J., & Wu, C. (2008) · Information Sciences · doi:10.1016/j.ins.2008.05.024 · Cited by 1,085
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 novel evolutionary data mining algorithm with applications to churn prediction
Au, W.-H., Chan, K. C. C., & Yao, X. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.819264 · Cited by 348
Self-citationTutorial 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
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
- Ching, J. Y., Wong, A. K. C., & Chan, K. C. C.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1995-07
- Volume
- 17
- Issue
- 7
- Pages
- 641-651
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2160671582
- Cited by
- 241
- References
- 1
- FWCI
- 13.07
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Class-dependent discretization for inductive learning from continuous and mixed-mode data. https://app.cochat.ai/papers/10.1109/34.391407
- The paper
- Ching, J. Y., Wong, A. K. C., & Chan, K. C. C. (1995). Class-dependent discretization for inductive learning from continuous and mixed-mode data. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/34.391407
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.
