Referenced Items are not available for this document.
Early ID3, C4.5, CART and the other decision tree algorithms are no longer met the situation of massive data analysis for the time being. Those algorithms has the same limitations that they can not handle the updated data sets dynamically and the decision tree generated by these algorithms need to be purned. These weaknesses limit the use of the above-mentioned algorithms. So a novel parallel decision tree classification algorithm based on combination (PCDT) is put forward in this paper. This algorithm has the excellent features that it can be updated when the data set is renewing and it is scalable and no pruning. It has been proved by the experiment that the PCDT algorithm has higher classification accuracy and is easy to parallel.
Published in:
Information Technology and Applications (IFITA), 2010 International Forum on
(Volume:1
)
Date of Conference: 16-18 July 2010
- Page(s):
- 99 - 101
- E-ISBN :
- 978-1-4244-7622-0
- Print ISBN:
- 978-1-4244-7621-3
- INSPEC Accession Number:
- 11648360
- Conference Location :
- Kunming
- Digital Object Identifier :
- 10.1109/IFITA.2010.115
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
