ISCAS OpenIR
a novel multiple kernel clustering method
Zhang Lujiang; Hu Xiaohui
2012
Conference Name8th International Conference on Emerging Intelligent Computing Technology and Applications, ICIC 2012
SourceCommunications in Computer and Information Science
Pages87-92
Conference DateJuly 25, 2012 - July 29, 2012
Conference PlaceHuangshan, China
Indexed TypeEI
ISSN1865-0929
ISBN9783642318368
Department(1) School of Automation Science and Electrical Engineering Beijing University of Aeronautics and Astronautics Beijing China; (2) Institute of Software Chinese Academy of Sciences Beijing China
English AbstractRecently Multiple Kernel Learning (MKL) has gained increasing attention in constructing a combinational kernel from a number of basis kernels. In this paper, we proposed a novel approach of multiple kernel learning for clustering based on the kernel k-means algorithm. Rather than using a convex combination of multiple kernels over the whole input space, our method associates to each cluster a localized kernel. We assign to each cluster a weight vector for feature selection and combine it with a Gaussian kernel to form a unique kernel for the corresponding cluster. A locally adaptive strategy is used to localize the kernel for each cluster with the aim of minimizing the within-cluster variance of the corresponding cluster. We experimentally compared our methods to kernel k-means and spectral clustering on several data sets. Empirical results demonstrate the effectiveness of our method. © 2012 Springer-Verlag.; Recently Multiple Kernel Learning (MKL) has gained increasing attention in constructing a combinational kernel from a number of basis kernels. In this paper, we proposed a novel approach of multiple kernel learning for clustering based on the kernel k-means algorithm. Rather than using a convex combination of multiple kernels over the whole input space, our method associates to each cluster a localized kernel. We assign to each cluster a weight vector for feature selection and combine it with a Gaussian kernel to form a unique kernel for the corresponding cluster. A locally adaptive strategy is used to localize the kernel for each cluster with the aim of minimizing the within-cluster variance of the corresponding cluster. We experimentally compared our methods to kernel k-means and spectral clustering on several data sets. Empirical results demonstrate the effectiveness of our method. © 2012 Springer-Verlag.
KeywordIntelligent Computing
SponsorshipIEEE Computational Intelligence Society; International Neural Network Society; National Science Foundation of China
Language英语
Content Type会议论文
URIhttp://ir.iscas.ac.cn/handle/311060/15801
Collection中国科学院软件研究所
Recommended Citation
GB/T 7714
Zhang Lujiang,Hu Xiaohui. a novel multiple kernel clustering method[C],2012:87-92.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Zhang Lujiang]'s Articles
[Hu Xiaohui]'s Articles
Baidu academic
Similar articles in Baidu academic
[Zhang Lujiang]'s Articles
[Hu Xiaohui]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Zhang Lujiang]'s Articles
[Hu Xiaohui]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.