Affiliations: [a] School of Information Engineering, Zhengzhou University, Zhengzhou, Henan, China | [b] The State Key Laboratory of Train Traffic Control and Safety, Beijing Jiaotong University, Beijing, China | [c] Business School, Hohai University, Nanjing, China
Correspondence:
[*]
Corresponding author: Bo Ji, School of Information Engineering, Zhengzhou University, Zhengzhou 450052, Henan, China. Tel.: +86 136 0384 8440; E-mail: iebji@zzu.edu.cn.
Abstract: Feature weighting is one of the popular and effective ways to improve clustering quality. How to choose a proper weighting method for a data object is widely recognized as a difficult problem. Among majority of weighting schemes and combination weighting methods, the traditional way is evaluating the performance of feature weighting by measuring the quality of clustering. However, it is a time-consuming task because clustering algorithms should be run many times, and the number of times depends on the number of weighting schemes or the number of combination weighting iteration. To address the issue, we propose to apply the Mutual Information to predict the performance of feature weighting. We propose to judge the quality of feature weighting by the resulting gain in mutual information. Therefore, the top s weighted data representations can be selected from the weighting data representation set. Then, the best/second best cluster result can be obtained from the top s representations. Experimental results show that the Mutual Information evaluation reduces the running time without sacrificing the quality of clustering.
Keywords: Mutual information, feature weighting, evaluation, clustering, information bottleneck
