Categorical-and-numerical-attribute data clustering based on a unified similarity metric without knowing cluster number

被引:104
作者
Cheung, Yiu-ming [1 ,2 ,3 ]
Jia, Hong [1 ,2 ]
机构
[1] Hong Kong Baptist Univ, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
[2] Hong Kong Baptist Univ, Inst Computat & Theoret Studies, Hong Kong, Hong Kong, Peoples R China
[3] Hong Kong Baptist Univ, Beijing Normal Univ, United Int Coll, Zhuhai, Peoples R China
关键词
Clustering; Similarity metric; Categorical attribute; Numerical attribute; Number of clusters; K-MEANS; ALGORITHM; MODEL; LIKELIHOOD; EM;
D O I
10.1016/j.patcog.2013.01.027
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Most of the existing clustering approaches are applicable to purely numerical or categorical data only, but not the both. In general, it is a nontrivial task to perform clustering on mixed data composed of numerical and categorical attributes because there exists an awkward gap between the similarity metrics for categorical and numerical data. This paper therefore presents a general clustering framework based on the concept of object-cluster similarity and gives a unified similarity metric which can be simply applied to the data with categorical, numerical, and mixed attributes. Accordingly, an iterative clustering algorithm is developed, whose outstanding performance is experimentally demonstrated on different benchmark data sets. Moreover, to circumvent the difficult selection problem of cluster number, we further develop a penalized competitive learning algorithm within the proposed clustering framework. The embedded competition and penalization mechanisms enable this improved algorithm to determine the number of clusters automatically by gradually eliminating the redundant clusters. The experimental results show the efficacy of the proposed approach. (C) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:2228 / 2238
页数:11
相关论文
共 37 条
[1]   COMPETITIVE LEARNING ALGORITHMS FOR VECTOR QUANTIZATION [J].
AHALT, SC ;
KRISHNAMURTHY, AK ;
CHEN, PK ;
MELTON, DE .
NEURAL NETWORKS, 1990, 3 (03) :277-290
[2]   NEW LOOK AT STATISTICAL-MODEL IDENTIFICATION [J].
AKAIKE, H .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1974, AC19 (06) :716-723
[3]  
Andritsos P, 2004, LECT NOTES COMPUT SC, V2992, P123
[4]  
[Anonymous], 1996, ADV KNOWLEDGE DISCOV
[5]  
[Anonymous], 2005, ADV NEURAL INFORM PR
[6]  
Barbara D., 2002, Proceedings of the Eleventh International Conference on Information and Knowledge Management. CIKM 2002, P582, DOI 10.1145/584792.584888
[7]   Interpretable hierarchical clustering by constructing an unsupervised decision tree [J].
Basak, J ;
Krishnapuram, R .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (01) :121-132
[8]   Fast and robust fuzzy c-means clustering algorithms incorporating local information for image segmentation [J].
Cai, Weiling ;
Chen, Songean ;
Zhang, Daoqiang .
PATTERN RECOGNITION, 2007, 40 (03) :825-838
[9]   A new initialization method for categorical data clustering [J].
Cao, Fuyuan ;
Liang, Jiye ;
Bai, Liang .
EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (07) :10223-10228
[10]   Top-down parameter-free clustering of high-dimensional categorical data [J].
Cesario, Eugenio ;
Manco, Giuseppe ;
Ortale, Riccardo .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2007, 19 (12) :1607-1624