.png){kind=icon}
.png){kind=icon}
Return
Consensus local graph for multiple kernel clustering
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2024.128252.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Due to the ability to represent the relationship among data, graph has received extensive attention in clustering field. As illustrated by existing studies, learning graph in kernel space is an effective way to capture the structure of data. Among kernel-based methods, multiple kernel learning (MKL) is increasingly popular since it can automatically utilize the complementary information contained in base kernels. Although many existing MKL-based graph learning algorithms have promising learning abilities, we observe that they (1) put too much attention on learning the consensus kernel which probably contains lots of redundant information and loses the diversity of base kernels; (2) ignore the local structure of the representations in multiple kernel spaces. To eliminate the bad effect of these issues, we propose a novel graph learning method, termed consensus local graph based on MKL (CLGMKL), for clustering. In CLGMKL, a low-rank kernel matrix is used to extract the discriminative information of each base kernel and a local graph is constructed to capture the local structure contained in each new kernel. Then CLGMKL combines these local graphs in a self-weighed way. Since the above processes are associated with each other, we jointly optimize them to obtain the overall optimality. An effective learning scheme with proved convergence is developed to optimize the combined objective function. Finally, extensive experiments on some popular datasets are conducted to test the effectiveness of the presented method. As illustrated, CLGMKL is more competitive than the state-of-the-art algorithms.
Keywords:
Graph
Kernel
Multiple kernel learning
Clustering
Local structure