The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
C5. 0 Algorithm to Improved Decision Tree with Feature Selection and Reduced Error Pruning
Open accessAbstract
Data mining is a knowledge discovery process that analyzes data and generate useful pattern from it.Classification is the technique that uses pre-classified examples to classify the required results.Decision tree is used to model classification process.Using feature values of instances, Decision trees classify those instances.Each node in a decision tree represents a feature in an instance to be classified.In this research work ID3, C4.5 and C5.0 Compare with each other.Among all these classifiers C5.0 gives more accurate and efficient result.This research work used C5.0 as the base classifier so proposed system will classify the result set with high accuracy and low memory usage.The classification process generates fewer rules compare to other techniques so the proposed system has low memory usage.Error rate is low so accuracy in result set is high and pruned tree is generated so the system generates fast results as compare with other technique.In this research work proposed system use C5.0 classifier that Performs feature selection and reduced error pruning techniques which are described in this paper.Feature selection technique assumes that the data contains many redundant features.so remove that features which provides no useful information in any context.Select relevant features which are useful in model construction.Crossvalidation method gives more reliable estimate of predictive.Over fitting problem of the decision tree is solved by using reduced error pruning technique.With the proposed system achieve 1 to 3% of accuracy, reduced error rate and decision tree is construed within less time.
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
Artificial intelligence to deep learning: machine intelligence approach for drug discovery
Gupta, R., Srivastava, D., Sahu, M., Tiwari, S., Ambasta, R. K., & Kumar, P. (2021) · Molecular Diversity · doi:10.1007/s11030-021-10217-3 · Cited by 1,473
“The constructed models were used to evaluate rat oral acute toxicity, respiratory toxicity, and urinary tract toxicity [345–348].”
MethodConcepts of Artificial Intelligence for Computer-Assisted Drug Discovery
Yang, X., Wang, Y., Byrne, R., Schneider, G., & Yang, S. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00728 · Cited by 1,022
Feature selection techniques for machine learning: a survey of more than two decades of research
Theng, D., & Bhoyar, K. K. (2024) · Knowledge and Information Systems · doi:10.1007/s10115-023-02010-5 · Cited by 510
Thakkar, A., & Lohiya, R. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-021-10037-9 · Cited by 350
Prediction of Breast Cancer, Comparative Review of Machine Learning Techniques, and Their Analysis
Fatima, N., Liu, L., Hong, S., & Ahmed, H. (2020) · IEEE Access · doi:10.1109/access.2020.3016715 · Cited by 272
Metadata
- Authors
- Pandya, R., & Pandya, J.
- Venue
- International Journal of Computer Applications
- Publisher
- Foundation of Computer Science
- Published
- 2015-05-20
- Volume
- 117
- Issue
- 16
- Pages
- 18-21
- ISSN
- 0975-8887 (ISSN-L)
- OpenAlex
- W2399542702
- Cited by
- 223
- References
- 1
- FWCI
- 35.14
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: C5. 0 Algorithm to Improved Decision Tree with Feature Selection and Reduced Error Pruning. https://app.cochat.ai/papers/10.5120/20639-3318
- The paper
- Pandya, R., & Pandya, J. (2015). C5. 0 Algorithm to Improved Decision Tree with Feature Selection and Reduced Error Pruning. International Journal of Computer Applications. https://doi.org/10.5120/20639-3318
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.