1/2014 - 10 |
Fast Decision Tree AlgorithmPURDILA, V. , PENTIUC, S.-G. |
Extra paper information in |
Click to see author's profile in SCOPUS, IEEE Xplore, Web of Science |
Download PDF (607 KB) | Citation | Downloads: 1,217 | Views: 5,068 |
Author keywords
algorithm, chi-merge, classification, data compression, decision tree, pruning
References keywords
decision(10), tree(7), data(7), pruning(6), mining(6), trees(5)
Blue keywords are present in both the references section and the paper title.
About this article
Date of Publication: 2014-02-28
Volume 14, Issue 1, Year 2014, On page(s): 65 - 68
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2014.01010
Web of Science Accession Number: 000332062300010
SCOPUS ID: 84894631111
Abstract
There is a growing interest nowadays to process large amounts of data using the well-known decision-tree learning algorithms. Building a decision tree as fast as possible against a large dataset without substantial decrease in accuracy and using as little memory as possible is essential. In this paper we present an improved C4.5 algorithm that uses a compression mechanism to store the training and test data in memory. We also present a very fast tree pruning algorithm. Our experiments show that presented algorithms perform better than C5.0 in terms of speed and classification accuracy in most cases at the expense of tree size - the resulting trees are larger than the ones produced by C5.0. The data compression and pruning algorithms can be easily parallelized in order to achieve further speedup. |
References | | | Cited By |
Web of Science® Times Cited: 8 [View]
View record in Web of Science® [View]
View Related Records® [View]
Updated today
SCOPUS® Times Cited: 12
View record in SCOPUS® [Free preview]
View citations in SCOPUS® [Free preview]
[1] Rotating machinery fault diagnosis for imbalanced data based on decision tree and fast clustering algorithm, Zhang, Xiaochen, Jiang, Dongxiang, Long, Quan, Han, Te, Journal of Vibroengineering, ISSN 1392-8716, Issue 6, Volume 19, 2017.
Digital Object Identifier: 10.21595/jve.2017.18373 [CrossRef]
[2] A Proposal for Cardiac Arrhythmia Classification using Complexity Measures, AROTARITEI, D., COSTIN, H., PASARICA, A., ROTARIU, C., Advances in Electrical and Computer Engineering, ISSN 1582-7445, Issue 3, Volume 17, 2017.
Digital Object Identifier: 10.4316/AECE.2017.03004 [CrossRef] [Full text]
[3] Novel Coronavirus and Common Pneumonia Detection from CT Scans Using Deep Learning-Based Extracted Features, Latif, Ghazanfar, Morsy, Hamdy, Hassan, Asmaa, Alghazo, Jaafar, Viruses, ISSN 1999-4915, Issue 8, Volume 14, 2022.
Digital Object Identifier: 10.3390/v14081667 [CrossRef]
[4] A Novel Splitting Criterion Inspired by Geometric Mean Metric Learning for Decision Tree, Li, Dan, Chen, Songcan, 2022 26th International Conference on Pattern Recognition (ICPR), ISBN 978-1-6654-9062-7, 2022.
Digital Object Identifier: 10.1109/ICPR56361.2022.9956124 [CrossRef]
[5] Messaging activity impact on learner's profiling, Popescu, Paul Stefan, Mocanu, Mihai, Dan Burdescu, Dumitru, Mihaescu, Marian Cristian, 2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA), ISBN 978-1-4673-9311-9, 2015.
Digital Object Identifier: 10.1109/IISA.2015.7387980 [CrossRef]
[6] Physical Exercise Classification from Body Keypoints Using Machine Learning Techniques, Rahman, Aadhila, Saji, Aldrin, Teresa, Avelin, Nair, Divya R, Saritha, S, 2024 3rd International Conference on Applied Artificial Intelligence and Computing (ICAAIC), ISBN 979-8-3503-7519-0, 2024.
Digital Object Identifier: 10.1109/ICAAIC60222.2024.10575612 [CrossRef]
Disclaimer: All information displayed above was retrieved by using remote connections to respective databases. For the best user experience, we update all data by using background processes, and use caches in order to reduce the load on the servers we retrieve the information from. As we have no control on the availability of the database servers and sometimes the Internet connectivity may be affected, we do not guarantee the information is correct or complete. For the most accurate data, please always consult the database sites directly. Some external links require authentication or an institutional subscription.
Web of Science® is a registered trademark of Clarivate Analytics, Scopus® is a registered trademark of Elsevier B.V., other product names, company names, brand names, trademarks and logos are the property of their respective owners.
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.