The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Efficient C4.5 [classification algorithm]
Abstract
We present an analytic evaluation of the runtime behavior of the C4.5 algorithm which highlights some efficiency improvements. Based on the analytic evaluation, we have implemented a more efficient version of the algorithm, called EC4.5. It improves on C4.5 by adopting the best among three strategies for computing the information gain of continuous attributes. All the strategies adopt a binary search of the threshold in the whole training set starting from the local threshold computed at a node. The first strategy computes the local threshold using the algorithm of C4.5, which, in particular, sorts cases by means of the quicksort method. The second strategy also uses the algorithm of C4.5, but adopts a counting sort method. The third strategy calculates the local threshold using a main-memory version of the RainForest algorithm, which does not need sorting. Our implementation computes the same decision trees as C4.5 with a performance gain of up to five times.
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
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
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
Lim, T.-S., Loh, W.-Y., & Shih, Y.-S. (2000) · Machine Learning · doi:10.1023/a:1007608224229 · Cited by 1,133
SPRINT: A Scalable Parallel Classifier for Data Mining
Shafer, J. C., Agrawal, R., & Mehta, M. (1996) · Cited by 787
SLIQ: A fast scalable classifier for data mining
Mehta, M., Agrawal, R., & Rissanen, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0014141 · Cited by 749
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
RainForest—A Framework for Fast Decision Tree Construction of Large Datasets
Gehrke, J., Ramakrishnan, R., & Ganti, V. (2000) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009839829793 · Cited by 348
Cited by
Decision trees: a recent overview
Kotsiantis, S. B. (2013) · Artificial Intelligence Review · doi:10.1007/s10462-011-9272-4 · Cited by 1,568
Decision Tree and SVM-Based Data Analytics for Theft Detection in Smart Grid
Jindal, A., Dua, A., Kaur, K., Singh, M., Kumar, N., & Mishra, S. (2016) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2016.2543145 · Cited by 547
Houssein, E. H., Hammad, A., & Ali, A. A. (2022) · Neural Computing and Applications · doi:10.1007/s00521-022-07292-4 · Cited by 426
Deep and machine learning techniques for medical imaging-based breast cancer: A comprehensive review
Houssein, E. H., Emam, M. M., Ali, A. A., & Suganthan, P. N. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.114161 · Cited by 404
A feature selection algorithm for intrusion detection system based on Pigeon Inspired Optimizer
Alazzam, H., Sharieh, A., & Sabri, K. E. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113249 · Cited by 398
Metadata
- Authors
- Ruggieri, S.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2002
- Volume
- 14
- Issue
- 2
- Pages
- 438-444
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2050829396
- Cited by
- 389
- References
- 19
- FWCI
- 21.94
- 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: Efficient C4.5 [classification algorithm]. https://app.cochat.ai/papers/10.1109/69.991727
- The paper
- Ruggieri, S. (2002). Efficient C4.5 [classification algorithm]. IEEE Transactions on Knowledge and Data Engineering. https://doi.org/10.1109/69.991727
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.