Extension of partitional clustering methods for handling mixed data

Proceedings - IEEE International Conference on Data Mining Workshops, ICDM Workshops 2008

Volumn , Issue , 2008, Pages 257-266

  Naija, Yosr ^a   Blibech, Kaouther ^a   Chakhar, Salem ^b,c   Robbana, Riadh ^a  

^a FACULTÉ DES SCIENCES DE TUNIS   (Tunisia)

^b UNIVERSITÉ PARIS DAUPHINE   (France)

^c ECOLE CENTRALE PARIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; INFORMATION MANAGEMENT; TECHNICAL PRESENTATIONS;

CATEGORICAL ATTRIBUTES; CLUSTERING METHODS; DATA-SETS; DENSITY-BASED METHODS; DISTANCE MEASURES; HIERARCHICAL METHODS; IN FIELDS; MIXED DATUM; NUMERICAL ATTRIBUTES; PARTITIONAL CLUSTERING; PARTITIONAL METHODS; RESEARCH TOPICS; ROAD TRAFFICS;

NUMERICAL METHODS;

EID: 62449232284     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDMW.2008.85     Document Type: Conference Paper

References (15)

1. A. Ahmed and D. Lipika. A k-mean clustering algorithm for mixed numeric and categorical data. Data and Knowledge Engineering, 63(2):503-527, 2007.
2. H. Chung-Chian, C. Chin-Long, and S. Yu-Wei. Hierarchical clustering of mixed data based on distance hierarchy. Information Sciences, 177(20):4474-4492, 2007.
3. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A densitybased algorithm for discovering clusters in large spatial databases with noise. In Proc. of 2nd Int. Conf. on Knowledge Discovery and Data Mining (KDD), pages 226-231, Portland, Oregon, August 1996.
4. S. Guha, R. Rastogi, and K. Shim. CURE: An efficient clustering algorithm for large databases. In Proc. of ACM SIGMOD Int. Conf. on Management of Data, pages 73-84, Seatle, USA, June 1998.
5. M. Halkidi, Y. Batistakis, and M. Vazirgiannis. On clustering validation techniques. Journal of Intelligent Information Systems, 17(2):107-145, 2001.
6. Z. He, X. Xu, and S. Deng. Scalable algorithms for clustering mixed type attributes in large datasets. International Journal of Intelligent Systems, 20(10):1077-1089, 2005.
7. Z. Huang. A fast clustering algorithm to cluster very large categorical data sets in data mining. In Proc. of SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, pages 1-8, 1997.
8. Z. Huang. Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Mining and Knowledge Discovery, 2(3):283-304, 1998.
9. A.-K. Jain, M. Murty, and P.-J. Flynn. Data clustering: A review. ACM Computing Surveys, 31(3):264-323, 1999.
10. L. Kaufman and P. Rousseeuw. Finding groups in data: An introduction to cluster analysis. John Wiley & Sons, 1990.
11. C. Li and G. Biswas. Unsupervised clustering with mixed numeric and nominal data-a new similarity based agglomerative system. In Proc. of the First Asian Pacific Conference on Knowledge Discovery from Databases, pages 35-61, Singapore, 1997.
12. J. Mcqueen. some methods for classification and analysis of multivariate observations. In 5th Berkeley Symp. on Math. Statistics and Probability, pages 281-298, Berkley, CA: University of California Press, 1967.
13. R.-T. Ng and J. Han. Efficient and effective clustering methods for spatial data mining. In 20th Int. Conf. on Very Large Data Bases (VLDB), pages 144-155, Santiago, Chile, September 1994.
14. H. Ralambondrainy. A conceptual version of the k-means algorithm. Pattern Recognition Letters, 16(11):1147-1157, 1995.
15. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: An efficient data clustering method for very large databases. In Proc. of ACM SIGMOD Int. Conf. on Management of data, Montreal, Canada, June 1996.