Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Ji, Boa; * | Ye, Yang-Donga; b | Xiao, Yuc
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
DOI: 10.3233/IDA-130617
Journal: Intelligent Data Analysis, vol. 17, no. 6, pp. 1001-1021, 2013
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl