| SQL database primitives for decision tree classifiers |
| Full text |
Pdf
(1.50 MB)
|
| Source
|
Conference on Information and Knowledge Management
archive
Proceedings of the tenth international conference on Information and knowledge management
table of contents
Atlanta, Georgia, USA
Session: Classification
table of contents
Pages: 379 - 386
Year of Publication: 2001
ISBN:1-58113-436-3
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 10, Downloads (12 Months): 74, Citation Count: 8
|
|
|
ABSTRACT
Scalable data mining in large databases is one of today's challenges to database technologies. Thus, substantial effort is dedicated to a tight coupling of database and data mining systems leading to database primitives supporting data mining tasks. In order to support a wide range of tasks and to be of general usage these primitives should be rather building blocks than implementations of specific algorithms. In this paper, we describe primitives for building and applying decision tree classifiers. Based on the analysis of available algorithms and previous work in this area we have identified operations which are useful for a number of classification algorithms. We discuss the implementation of these primitives on top of a commercial DBMS and present experimental results demonstrating the performance benefit.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
K. Alsabti, S. Ranka, and V. Singh. CLOUDS: A Decision Tree Classifier for Large Datasets. In R. Agrawal, P. Stolorz, and G. Piatetsky-Shapiro, editors, Proc. KDD-98, New York City, New York, 1998.
|
| |
2
|
L. Breiman, J. Friedman, R. Olshen, and C. Stone. CIassiJication and Regression Trees. Chapman & Hall, 1984.
|
| |
3
|
S. Chaudhuri. Data Mining and Database Systems: Where is the Intersection? Data Engineering Bulletin, 21( 1):48, 1998.
|
| |
4
|
|
| |
5
|
|
 |
6
|
|
 |
7
|
Minos Garofalakis , Dongjoon Hyun , Rajeev Rastogi , Kyuseok Shim, Efficient algorithms for constructing decision trees with constraints, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, p.335-339, August 20-23, 2000, Boston, Massachusetts, United States
[doi> 10.1145/347090.347163]
|
 |
8
|
Johannes Gehrke , Venkatesh Ganti , Raghu Ramakrishnan , Wei-Yin Loh, BOAT—optimistic decision tree construction, Proceedings of the 1999 ACM SIGMOD international conference on Management of data, p.169-180, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
|
| |
9
|
|
| |
10
|
D. M. Group. Predictive Model Markup Language (PMML) 1.1,2000. http://www.dmg.org/html/pmml-vl-l.html.
|
| |
11
|
|
 |
12
|
|
| |
13
|
|
| |
14
|
|
| |
15
|
M. Mehta, J. Rissanen, and R. Agrawal. MDL-based Decision Tree Pruning. In U. Fayyad and R. Uthurusamy, editors, Proc. KDD-95, Montreal, Canada, 1995.
|
| |
16
|
|
| |
17
|
|
 |
18
|
|
| |
19
|
|
| |
20
|
|
 |
21
|
Sunita Sarawagi , Shiby Thomas , Rakesh Agrawal, Integrating association rule mining with relational database systems: alternatives and implications, Proceedings of the 1998 ACM SIGMOD international conference on Management of data, p.343-354, June 01-04, 1998, Seattle, Washington, United States
|
| |
22
|
|
| |
23
|
|
| |
24
|
|
|