Abstract
Existing decision tree algorithms need to recursively partition dataset into subsets according to some splitting criteria. For large data sets, this requires multiple passes of original dataset and therefore is often infeasible in many applications. In this article we use statistics trees to compute the data cube and then build a decision tree on top of it. Mining on aggregated data will be much more efficient than directly mining on flat data files or relational databases. Since data cube server is usually a required component in an analytical system for answering OLAP queries, we essentially provide “free” classification. Our new algorithm generates trees of the same prediction accuracy as existing decision tree algorithms such as SPRINT and RainForest, but improves performance significantly. In this article we also give a system architecture that integrates DBMS, OLAP, and data mining seamlessly.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Data Warehousing and Mining
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
