Clustering ensemble method based DILCA distance

A method of clustering ensemble is transforming the clustering ensemble problem into the clustering problem among objects in a nominal information table. The basic problem is to give a method which is used to calculate the distance between the nominal attribute value. In this paper, DILCA method is adopted to calculate the distance between the nominal attribute value. Using the correlation between the attributes, this method calculate the distance more accurately. At the same time, the method uses the correlation and redundancy between attributes to decide the context attributes set of one attribute which is used to reduce the calculation quantity. The superiority of this method are demonstrated by experiments.

[1]  Bin Luo,et al.  Fuzzy Clustering Ensemble Based on Dual Boosting , 2007, Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007).

[2]  Jin Di.  Research on Cluster Aggregation Approaches , 2011 .

[3]  Guo Yutang,et al.  A Fuzzy Clustering Ensemble Based on Dual Boosting* , 2006, 2007 Chinese Control Conference.

[4]  Wang Wen-yuan.  Clustering Ensemble Approaches: An Overview , 2005 .

[5]  Dong-Yol Yang,et al.  Technology Innovation and Future Research Needs in Net Shape Manufacturing , 2005 .

[6]  Ludmila I. Kuncheva,et al.  Moderate diversity for better cluster ensembles , 2006, Inf. Fusion.

[7]  Anil K. Jain,et al.  Combining multiple weak clusterings , 2003, Third IEEE International Conference on Data Mining.

[8]  Shi Hua-ji.  Attribute reduction algorithm based on relation coefficient and conditional information entropy , 2011 .

[9]  Ruggero G. Pensa,et al.  From Context to Distance: Learning Dissimilarity for Categorical Data Clustering , 2012, TKDD.

[10]  Hau-San Wong,et al.  ARImp: A Generalized Adjusted Rand Index for Cluster Ensembles , 2010, 2010 20th International Conference on Pattern Recognition.

[11]  AhmadAmir,et al.  A k-mean clustering algorithm for mixed numeric and categorical data , 2007 .

[12]  Lipika Dey,et al.  A k-mean clustering algorithm for mixed numeric and categorical data , 2007, Data Knowl. Eng..

[13]  Andreas Stafylopatis,et al.  A clustering method based on boosting , 2004, Pattern Recognit. Lett..

[14]  Zhou Zhi,et al.  Bagging-Based Selective Clusterer Ensemble , 2005 .

[15]  Huan Liu,et al.  Feature Selection for High-Dimensional Data: A Fast Correlation-Based Filter Solution , 2003, ICML.