论文信息 - Clustering Data Without Distance Functions

Clustering Data Without Distance Functions

Data mining is being applied with profit in many applications . Clustering or segmentation of data is an important data mining application. One of the problems with traditional clustering methods is that they require the analyst to define distance functions that are not always available. In this paper, we describe a new method for clustering without distance functions.

Arun N. Swami | G. D. Ramkumar | A. Swami

[1] Tian Zhang,et al. BIRCH: an efficient data clustering method for very large databases , 1996, SIGMOD '96.

[2] J. Ross Quinlan,et al. C4.5: Programs for Machine Learning , 1992 .

[3] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[4] Vipin Kumar,et al. Clustering Based On Association Rule Hypergraphs , 1997, DMKD.

[5] Ali S. Hadi,et al. Finding Groups in Data: An Introduction to Chster Analysis , 1991 .

[6] Jiawei Han,et al. Efficient and Effective Clustering Methods for Spatial Data Mining , 1994, VLDB.

[7] Aiko M. Hormann,et al. Programs for Machine Learning. Part I , 1962, Inf. Control..

[8] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[9] Douglas H. Fisher,et al. Improving Inference through Conceptual Clustering , 1987, AAAI.

[10] AgrawalRakesh,et al. Mining association rules between sets of items in large databases , 1993 .

[11] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.

[12] Douglas Fisher. Optimization and Simplification of Hierarchical Clusterings , 1995, KDD.

[13] Ramakrishnan Srikant,et al. Fast algorithms for mining association rules , 1998, VLDB 1998.

[14] Padhraic Smyth,et al. From Data Mining to Knowledge Discovery: An Overview , 1996, Advances in Knowledge Discovery and Data Mining.