A general grid-clustering approach

Pattern Recognition Letters

Volumn 29, Issue 9, 2008, Pages 1372-1384

  Yue, Shihong ^a   Wei, Miaomiao ^a   Wang, Jeen Shing ^b   Wang, Huaxiang ^a  

^a TIANJIN UNIVERSITY   (China)

^b NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

Clustering; Core grid; Grid size; Locality

Indexed keywords

CLUSTER ANALYSIS; CLUSTERING ALGORITHMS; DATA STRUCTURES; FEATURE EXTRACTION; PARAMETER ESTIMATION; USER INTERFACES;

CORE GRID; GRID SIZE; INPUT PARAMETERS; LOCALITY;

GRID COMPUTING;

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

References (25)

1. Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P., 1998. Automatic subspace clustering of high dimensional data. In: Proc. ACM SIGMOD Internat. Conf., Seattle, WA, pp. 73-84.
2. Agrawal R., Gehrke J., Gunopulos D., et al. Automatic subspace clustering of high dimensional data. Data Mining. Knowl. Disc. 11 1 (2005) 5-33
3. AlphaMiner2.0: .
4. Beyer, K.S., Goldstein, J., Ramakrishnan, R., 1999. When is 'Nearest Neighbor' meaningful? In: Proc. 1st Internat. Conf. Database Theory (ICDT), pp. 217-235.
5. Bezdek J.C., Keller J.M., and Krishnapuram R. Will the real Iris data please stand up?. IEEE Trans. Fuzzy Systems 7 3 (1999) 23-26
6. Chiang H., Yue S., and Yin Z. A new approach to fuzzy clustering. IEEE Trans. Fuzzy Systems 15 2 (2004) 45-61
7. Cohen W., and Singer W. Context-sensitive learning methods for text categorization. ACM. Trans. Info. Systems 17 2 (1999) 141-173
8. Eden W., Ma M., and Tommy W.S. A new shifting grid clustering algorithm. Pattern Recognition 37 (2004) 503-514
9. Fabrizio S. Machine learning in automated text categorization. ACM Comput. Surv. 34 1 (2002) 1-47
10. Fred A., and Leitao J. A new cluster isolation criterion based on dissimilarity increments. IEEE Trans. Pattern Anal. Machine Intell. 25 8 (2003) 944-952
11. Grabusts, P., Borisov, A., 2002. Using grid-clustering methods in data classification. In: Internat. Conf. on Parallel Computing in Electrical Engineering.
12. Guha, S., Rastogi, R., Shim, K., 1998. CURE: An efficient clustering algorithm for large databases. In: Proc. ACM SIGMOD Internat. Conf. Management of Data, pp. 73-84.
13. Guha S., Rastogi R., and Shim K. ROCK: A robust clustering algorithm for categorical attributes. Inform. Systems 25 5 (2000) 345-366
14. Han J., and Kanber M. Data Mining: Concepts and Techniques (2001), Morgan Kaufmann Publishers Inc.
15. Hinneburg, A., Keim, D., 1999. Optimal grid-clustering: Toward breaking the curse of dimensionality in high-dimensional clustering. In: Proc. 25th VLDB Conf., pp. 506-517.
16. Huang Z., Ng M.K., and Rong H. Automated variable weighting in k-means type clustering. IEEE Trans. Pattren Anal. Mach. Intell. 27 (2005) 657-668
17. Jenssen R., Erdogmus D., Hild K., et al. Information cut for clustering using a gradient decent approach. Pattern Recognition 40 3 (2007) 796-806
18. Kim M., Yoo H., and Ramakrishn R.S. Cluster validity in high-dimensional datasets. LNAI 3192 (2004) 178-187
19. Ordonez C., and Omiecinski E. Efficient disk-based K-means clustering for relational databases. IEEE Trans. Knowl. Data Eng. 16 8 (2004) 909-921
20. Schikuta, E., 1993. Grid-Clustering: A hierarchical clustering method for very large data sets. In: Technical Report TR-CRPC No. 93358, Center for Research on Parallel Computation, Rice University, P.O. Box 1892, Houston, TX 77251-1892.
21. UCI Machine Learning Repository. .
22. Xu R., and Wunsch D. Survey of clustering algorithm. IEEE Trans. Neural Network 16 3 (2005) 645-661
23. Yang M., and Wu K. Similarity-based robust clustering method. IEEE Trans. Pattern Anal. Machine Intell. 26 4 (2004) 434-441
24. Yu J. A general c-means clustering approach. IEEE Trans. Pattern Anal. Machine Intell. 25 8 (2003) 944-952
25. Zhang, T., Ramakrishnan, R., Livny, M., 1996. BIRCH: An efficient data clustering method for very large databases. In: Proc. ACM SIGMOD Conf. Management of Data, pp. 103-114.