Welcome to the InfoSci Platform
Reference Hub2
Novel Efficient Classifiers Based on Data Cube

Novel Efficient Classifiers Based on Data Cube

Lixin Fu
Copyright: © 2005 |Volume: 1 |Issue: 3 |Pages: 13
ISSN: 1548-3924|EISSN: 1548-3932|ISSN: 1548-3924|EISBN13: 9781615202157|EISSN: 1548-3924|DOI: 10.4018/jdwm.2005070102
Cite Article Cite Article

MLA

Fu, Lixin. "Novel Efficient Classifiers Based on Data Cube." IJDWM vol.1, no.3 2005: pp.15-27. http://doi.org/10.4018/jdwm.2005070102

APA

Fu, L. (2005). Novel Efficient Classifiers Based on Data Cube. International Journal of Data Warehousing and Mining (IJDWM), 1(3), 15-27. http://doi.org/10.4018/jdwm.2005070102

Chicago

Fu, Lixin. "Novel Efficient Classifiers Based on Data Cube," International Journal of Data Warehousing and Mining (IJDWM) 1, no.3: 15-27. http://doi.org/10.4018/jdwm.2005070102

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.