Article

Free access

Clustering through decision tree construction

Authors:

Bing Liu,

Yiyuan Xia,

Philip S. YuAuthors Info & Claims

CIKM '00: Proceedings of the ninth international conference on Information and knowledge management

Pages 20 - 29

https://doi.org/10.1145/354756.354775

Published: 06 November 2000 Publication History

PDF eReader

References

[1]

C. Aggarwal, C. Propiuc, J. L. Wolf, P. S. Yu, and J. S. Park. "Fast algorithms for projected clustering." SIGMOD- 99, 1999.]]

Digital Library

Google Scholar

[2]

C. Aggarwal, and P. S. Yu. "Finding generalized projected clusters in high dimensional spaces." SIGMOD-00, 2000.]]

Digital Library

Google Scholar

[3]

R. Agrawal, J. Gehrke, D. Gunopulos and P. Raghavan. "Automatic subspace clustering for high dimensional data for data mining applications." SIGMOD-98, 1998.]]

Digital Library

Google Scholar

[4]

P. Arabie and L. J. Hubert. "An overview of combinatorial data analysis." In P. Arabie, L. Hubert, and G.D. Soets, editors, Clustering and Classification, pages 5-63, 1996.]]

Google Scholar

[5]

K. Beyer, J. Goldstein, R. Ramakrishnan and U. Shaft. "When is nearest neighbor meaningful?" Proc.7 th Int. Conf. on Database Theory (ICDT), 1999.]]

Digital Library

Google Scholar

[6]

P. Bradley, U. Fayyad and C. Reina. "Scaling clustering algorithms to large databases." KDD-98, 1998.]]

Google Scholar

[7]

C. H. Cheng, A. W. Fu and Y Zhang. "Entropy-based subspace clustering for mining numerical data." KDD-99.]]

Digital Library

Google Scholar

[8]

R. Dubes and A. K. Jain, "Clustering techniques: the user's dilemma." Pattern Recognition, 8:247-260, 1976.]]

Crossref

Google Scholar

[9]

M. Ester, H.-P. Kriegal, J. Sander and X. Xu. "A densitybased algorithm for discovering clusters in large spatial databases with noise." KDD-96, 1996.]]

Google Scholar

[10]

M. Ester, H.-P. Kriegel and X. Xu. "A database interface for clustering in large spatial data bases." KDD-95, 1995.]]

Google Scholar

[11]

B. S. Everitt. Cluster analysis. Heinemann, London, 1974.]]

Google Scholar

[12]

U. Fayyad, C. Reina, and P. S. Bradley, "Initialization of iterative refinement clustering algorithms." KDD-98, 1998.]]

Google Scholar

[13]

D. Fisher. "Knowledge acquisition via incremental conceptual clustering." Machine Learning, 2:139-172, 1987.]]

Digital Library

Google Scholar

[14]

J. H. Friedman and N. I. Fisher "Bump hunting in highdimensional data." To appear: Statistics and Computation, 1998.]]

Digital Library

Google Scholar

[15]

K. Fukunaga. Introduction to statistical pattern recognition. Academic Press, 1990.]]

Digital Library

Google Scholar

[16]

V. Ganti, J. Gehrke, and R. Ramakrishnan, "CACTUS- Clustering categorical data using summaries." KDD-99.]]

Digital Library

Google Scholar

[17]

J. Gehrke, R. Ramakrishnan, V. Ganti. "RainForest - A framework for fast decision tree construction of large datasets." VLDB-98, 1998.]]

Digital Library

Google Scholar

[18]

J. Gehrke, V. Ganti, R. Ramakrishnan & W-Y. Loh, "BOAT - Optimistic decision tree construction." SIGMOD-99, 1999.]]

Digital Library

Google Scholar

[19]

S. Guha, R. Rastogi, and K. Shim. "ROCK: a robust clustering algorithm for categorical attributes." ICDE-99.]]

Digital Library

Google Scholar

[20]

S. Guha, R. Rastogi, and K. Shim. "CURE: an efficient clustering algorithm for large databases." SIGMOD-98.]]

Digital Library

Google Scholar

[21]

A. Hinneburg and D. A. Keim. "An efficient approach to clustering in large multimedia databases with noise." KDD- 98, 1998.]]

Google Scholar

[22]

A. Hinneburg and D. A. Keim. "An optimal grid-clustering: towards breaking the curse of dimensionality in highdimensional clustering." VLDB-99, 1999.]]

Digital Library

Google Scholar

[23]

A. K. Jain and R. C. Dubes. Algorithms for clustering data. Prentice Hall, 1988.]]

Digital Library

Google Scholar

[24]

B. Liu, K. Wang, L. Mun and X. Qi. "Using decision tree induction for discovering holes in data." PRICAI-98, 1998.]]

Digital Library

Google Scholar

[25]

B. Liu, Y. Xia, and P. S. Yu. "CLTree - Clustering through decision tree construction." Forthcoming, an earlier version appeared as an IBM Research Report RC 21695, 20/3/2000.]]

Google Scholar

[26]

R. Ng and J. Han. "Efficient and effective clustering methods for spatial data mining." VLDB-94.]]

Digital Library

Google Scholar

[27]

J. R. Quinlan. C4.5: program for machine learning. Morgan Kaufmann, 1992.]]

Digital Library

Google Scholar

[28]

J.C. Shafer, R. Agrawal, & M. Mehta. "SPRINT: A scalable parallel classifier for data mining." VLDB-96, 1996.]]

Digital Library

Google Scholar

[29]

G. Sheikholeslami, S. Chatterjee and A. Zhang. "WaveCluster: a multi-resolution clustering Approach for very large spatial databases." VLDB-98, 1998.]]

Digital Library

Google Scholar

[30]

K. Wang, C. Xu, and B Liu. "Clustering transactions using large items." CIKM-99, 1999.]]

Digital Library

Google Scholar

[31]

W. Wang, J. Yang and R. Muntz. "STING: A statistical information grid approach to spatial data mining." VLDB-97, 1997.]]

Digital Library

Google Scholar

[32]

X. Xu, M. Ester, H-P. Kriegel and J. Sander. "A nonparametric clustering algorithm for knowledge discovery in large spatial databases." ICDE-98, 1998.]]

Google Scholar

[33]

T. Zhang, R. Ramakrishnan and M. Linvy. "BIRCH: an efficient data clustering method for very large databases." SIGMOD-96, 1996.]]

Digital Library

Google Scholar

Cited By

View all

Attaoui MFahmy HPastore FBriand L(2024)Supporting Safety Analysis of Image-processing DNNs through Clustering-based ApproachesACM Transactions on Software Engineering and Methodology10.1145/364367133:5(1-48)Online publication date: 3-Jun-2024
https://dl.acm.org/doi/10.1145/3643671
Romanov DGadasina L(2024)Using a Decision Tree for the Clustering Problem2024 International Russian Smart Industry Conference (SmartIndustryCon)10.1109/SmartIndustryCon61328.2024.10515744(273-279)Online publication date: 25-Mar-2024
https://doi.org/10.1109/SmartIndustryCon61328.2024.10515744
Lawless CGünlük OKrause ABrunskill ECho KEngelhardt BSabato SScarlett J(2023)Cluster explanation via polyhedral descriptionsProceedings of the 40th International Conference on Machine Learning10.5555/3618408.3619178(18652-18666)Online publication date: 23-Jul-2023
https://dl.acm.org/doi/10.5555/3618408.3619178
Show More Cited By

Index Terms

Clustering through decision tree construction

Recommendations

Clustering based distributed phylogenetic tree construction

Phylogenetic tree construction has received much attention recently due to the availability of vast biological data. In this study, we provide a three step method to build phylogenetic trees. Firstly, a density-based clustering algorithm is used to ...
Interpretable Hierarchical Clustering by Constructing an Unsupervised Decision Tree

In this paper, we propose a method for hierarchical clustering based on the decision tree approach. As in the case of supervised decision tree, the unsupervised decision tree is interpretable in terms of rules, i.e., each leaf node represents a cluster, ...
BOAT—optimistic decision tree construction

Classification is an important data mining problem. Given a training database of records, each tagged with a class label, the goal of classification is to build a concise model that can be used to predict the class label of future, unlabeled records. A ...

Comments

Information & Contributors

Information

Published In

CIKM '00: Proceedings of the ninth international conference on Information and knowledge management

November 2000

532 pages

ISBN:1581133200

DOI:10.1145/354756

Chairmen:
Arvin Agah
Univ. of Kansas, Lawrence
,
Jamie Callan
Carnegie Mellon Univ., Pittsburgh, PA
,
Elke Rundensteiner
Worcester Polytechnic Institute, Worcester, MA
,
Susan Gauch
Univ. of Kansas, Lawrence

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 November 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

CIKM00

Sponsor:

CIKM00: Ninth International Conference on Information and Knowledge Management

November 6 - 11, 2000

Virginia, McLean, USA

Acceptance Rates

Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

140
Total Citations
View Citations
3,578
Total Downloads

Downloads (Last 12 months)520
Downloads (Last 6 weeks)55

Reflects downloads up to 23 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Attaoui MFahmy HPastore FBriand L(2024)Supporting Safety Analysis of Image-processing DNNs through Clustering-based ApproachesACM Transactions on Software Engineering and Methodology10.1145/364367133:5(1-48)Online publication date: 3-Jun-2024
https://dl.acm.org/doi/10.1145/3643671
Romanov DGadasina L(2024)Using a Decision Tree for the Clustering Problem2024 International Russian Smart Industry Conference (SmartIndustryCon)10.1109/SmartIndustryCon61328.2024.10515744(273-279)Online publication date: 25-Mar-2024
https://doi.org/10.1109/SmartIndustryCon61328.2024.10515744
Lawless CGünlük OKrause ABrunskill ECho KEngelhardt BSabato SScarlett J(2023)Cluster explanation via polyhedral descriptionsProceedings of the 40th International Conference on Machine Learning10.5555/3618408.3619178(18652-18666)Online publication date: 23-Jul-2023
https://dl.acm.org/doi/10.5555/3618408.3619178
Li ZZhong WLiao WZhao JYu MHe G(2023)A Novel Clustering Method Based on Adjacent Grids SearchingEntropy10.3390/e2509134225:9(1342)Online publication date: 15-Sep-2023
https://doi.org/10.3390/e25091342
MİRASÇI SAKSOY A(2023)ÇELİK MALZEME SATIN ALMA SÜREÇLERİNDE VERİ MADENCİLİĞİ VE MAKİNE ÖĞRENMESİ UYGULAMALARIDATA MINING AND MACHINE LEARNING APPLICATIONS IN STEEL MATERIALS PURCHASINGMühendislik Bilimleri ve Tasarım Dergisi10.21923/jesd.122163511:3(1174-1189)Online publication date: 28-Sep-2023
https://doi.org/10.21923/jesd.1221635
Chen LZhong CZhang Z(2023)Explanation of clustering result based on multi-objective optimizationPLOS ONE10.1371/journal.pone.029296018:10(e0292960)Online publication date: 27-Oct-2023
https://doi.org/10.1371/journal.pone.0292960
Pan RLi XChakrabarty K(2023)Unsupervised Two-Stage Root-Cause Analysis With Transfer Learning for Integrated SystemsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2022.317699842:2(497-508)Online publication date: Feb-2023
https://doi.org/10.1109/TCAD.2022.3176998
Domanska OMartsyshyn VBuhrii O(2023)Density-Based Outlier Detection: Supervised Approach Based on Virtual Points2023 IEEE 13th International Conference on Electronics and Information Technologies (ELIT)10.1109/ELIT61488.2023.10311038(97-101)Online publication date: 26-Sep-2023
https://doi.org/10.1109/ELIT61488.2023.10311038
Laber EMurtinho L(2023)Nearly tight bounds on the price of explainability for the k-center and the maximum-spacing clustering problemsTheoretical Computer Science10.1016/j.tcs.2023.113744(113744)Online publication date: Feb-2023
https://doi.org/10.1016/j.tcs.2023.113744
Laber E(2023)The computational complexity of some explainable clustering problemsInformation Processing Letters10.1016/j.ipl.2023.106437(106437)Online publication date: Sep-2023
https://doi.org/10.1016/j.ipl.2023.106437
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Clustering based distributed phylogenetic tree construction

Interpretable Hierarchical Clustering by Constructing an Unsupervised Decision Tree

BOAT—optimistic decision tree construction