TW-k-means: Automated two-level variable weighting clustering algorithm for multiview data

Citations Over TimeTop 10% of 2011 papers

Abstract

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.

Related Papers

• → Extended implied weighting(2013)233 cited
• → Weighting in LCA – approaches and applications(2000)92 cited
• → The application of combination weighting approach in multiple attribute decision making(2009)9 cited
• → New Internet search volume-based weighting method for integrating various environmental impacts(2015)24 cited
• → A study of weighting factors of the quadratic performance index(1969)5 cited