QROCK: A quick version of the ROCK algorithm for clustering of categorical data

Pattern Recognition Letters

Volumn 26, Issue 15, 2005, Pages 2364-2373

  Dutta, M ^a   Mahanta, A Kakoti ^b   Pujari, Arun K ^c  

^a TEZPUR UNIVERSITY   (India)

^b GAUHATI UNIVERSITY   (India)

^c UNIVERSITY OF HYDERABAD   (India)

Author keywords

Categorical attributes; Data clustering; Hierarchical clustering; Similarity measure

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; INTERNET; PATTERN RECOGNITION;

CATEGORICAL ATTRIBUTES; DATA CLUSTERING; HIERARCHICAL CLUSTERING; SIMILARITY MEASURE;

ALGORITHMS;

EID: 25844444240     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2005.04.008     Document Type: Article

References (15)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman Data Structures and Algorithms 1987 Addison-Wesley Reading, MA
2. R.O. Duda, and P.E. Hard Pattern Classification and Scene Analysis 1973 A Wiley-Interscience Publication NY
3. Dutta, M., Bhattacharyya, D.K., 2001. On the complexity of the ROCK algorithm for clustering of categorical data. In: Proc. SDIS'01, National Workshop on Soft Data Mining and Intelligent Systems, Tezpur, India.
4. Ester, M., Kriegel, H.-P., Sander, J., Xu, X., 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proc. 2nd Internat. Conf. Knowledge Discovery and Data Mining (KDD-96), Portland, OR, 1996, pp. 226-231.
5. Ganti, V., Gehrke, J., Ramakrishnan, R., 1999. CACTUS: Clustering categorical data using summaries. In: Proc. ACM SIGKDD, Internat. Conf. Knowledge Discovery & Data Mining, San Diego, CA, USA.
6. Ganti, V., Ramakrishnan, R., Gehrke, J., Powell, A., French, J., 1999. Clustering large datasets in arbitrary metric spaces. In: Proc. Internat. Conf. Data Engineering.
7. Gibson, D., Kleinberg, J., Raghavan, P., 1998. Clustering categorical data: an approach based on dynamical systems. In: Proc. 24th VLDB Conf., NY, USA.
8. Goil, S., Nagesh, H., Choudhary, A., 2001. MAFIA: Efficient and scalable subspace clustering for very large data sets. ICDE (International Conference on Data Engineering), Germany.
9. Guha S., Rastogi, R., Shim, K., 1999. ROCK: A robust clustering algorithm for categorical attributes. In: Proc. IEEE Internat. Conf. Data Engineering, Sydney, March 1999.
10. Guha, S., Rastogi, R., Shim, K., 1998. CURE: An efficient algorithm for clustering large databases. Proc. ACM-SIGMOD 1998 Internat. Conf. Management of Data, Seattle.
11. Karyapis, G., Han, E.H., Kumar, V., 1999. CHAMELEON: A hierarchical clustering algorithm using dynamic modeling. In IEEE Computer, Special Issue on Data Analysis and Mining.
12. Ng, R.T., Han, J., 1994. Efficient and effective clustering methods for spatial data mining. In: Proc. 1994 Internat. Conf. Very Large DataBases (VLDB'94), Santiago, Chile, September 1994, pp. 144-155.
13. A.K. Pujari Data Mining Techniques 2001 Universities Press Hyderabad, India
14. J. Vitter Random sampling with a reservoir ACM Trans. Math. Software 11 1 1985 37 57
15. Zhang, T., Ramakrishnan, R., Livny, M., 1996. BIRCH: An efficient data clustering method for very large databases. In: Proc. ACM SIGMOD Internat. Conf. Management of Data.