The Community for Technology Leaders
Green Image
Issue No. 04 - April (2013 vol. 25)
ISSN: 1041-4347
pp: 932-944
Xiaojun Chen , Shenzhen Grad. Sch., Harbin Inst. of Technol., Shenzhen, China
Xiaofei Xu , Dept. of Comput. Sci. & Eng., Harbin Inst. of Technol., Harbin, China
J. Z. Huang , Coll. of Comput. Sci. & Software, Shenzhen Univ., Shenzhen, China
Yunming Ye , Shenzhen Grad. Sch., Harbin Inst. of Technol., Shenzhen, China
This paper proposes TW-k-means, an automated two-level variable weighting clustering algorithm for multiview data, which can simultaneously compute weights for views and individual variables. In this algorithm, a view weight is assigned to each view to identify the compactness of the view and a variable weight is also assigned to each variable in the view to identify the importance of the variable. Both view weights and variable weights are used in the distance function to determine the clusters of objects. In the new algorithm, two additional steps are added to the iterative k-means clustering process to automatically compute the view weights and the variable weights. We used two real-life data sets to investigate the properties of two types of weights in TW-k-means and investigated the difference between the weights of TW-k-means and the weights of the individual variable weighting method. The experiments have revealed the convergence property of the view weights in TW-k-means. We compared TW-k-means with five clustering algorithms on three real-life data sets and the results have shown that the TW-k-means algorithm significantly outperformed the other five clustering algorithms in four evaluation indices.
Clustering algorithms, Partitioning algorithms, Computational modeling, Clustering methods, Web pages, Data models, Algorithm design and analysis,variable weighting, Data mining, clustering, multiview learning, $(k)$-means
Xiaojun Chen, Xiaofei Xu, J. Z. Huang, Yunming Ye, "TW-k-means: Automated two-level variable weighting clustering algorithm for multiview data", IEEE Transactions on Knowledge & Data Engineering, vol. 25, no. , pp. 932-944, April 2013, doi:10.1109/TKDE.2011.262
210 ms
(Ver 3.1 (10032016))