返回
Locally adaptive multiple kernel clustering
DOI:10.1016/j.neucom.2013.05.064.png)
摘要
En 中文
Conventional multiple kernel learning aims to construct a global combination of multiple kernels in input space. For a data set which has varying local distributions in input space, using a uniform combination of multiple kernels may not always work well. In this paper, we proposed a localized multiple kernel learning method for clustering. Instead of using a uniform combinational kernel 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 each weight vector with a Gaussian kernel to form a unique kernel for the corresponding cluster. By optimizing the weight vector and the width parameter of Gaussian kernel jointly for each cluster, each kernel can be localized to match the data distribution of its corresponding cluster. A locally adaptive strategy based on the kernel k-means clustering is used to optimize the kernel for each cluster. We experimentally compared our methods to the kernel k-means clustering, averaged multiple kernel clustering, self-tuning spectral clustering and Variable Bandwidth Mean Shift algorithm. Experimental results demonstrate the effectiveness of our method. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Kernel clustering methods
Kernel k-means clustering
Multiple kernel learning
Localized multiple kernel clustering
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Fuzzy C-Means Clustering With Local Information and Kernel Metric for Image Segmentation基于局部信息和核度量的模糊C均值聚类图像分割
Evaluation of the performance of clustering algorithms in kernel-induced feature space
PATTERN RECOGNITION
IF7.6
Text categorization with support vector machines.: How to represent texts in input space?
MACHINE LEARNING
IF2.9
Can primary care research be conducted more efficiently using routinely reported practice-level data: a cluster randomised controlled trial conducted in England?
BMJ Open
IF0

