Low-rank Kernel Learning for Graph-based Clustering
Constructing the adjacency graph is fundamental to graph-based clustering. Graph learning in kernel space has shown impressive performance on a number of benchmark data sets. However, its performance is largely determined by the chosen kernel matrix. To address this issue, the previous multiple kernel learning algorithm has been applied to learn an optimal kernel from a group of predefined kernels. This approach might be sensitive to noise and limits the representation ability of the consensus kernel. In contrast to existing methods, we propose to learn a low-rank kernel matrix which exploits the similarity nature of the kernel matrix and seeks an optimal kernel from the neighborhood of candidate kernels. By formulating graph construction and kernel learning in a unified framework, the graph and consensus kernel can be iteratively enhanced by each other. Extensive experimental results validate the efficacy of the proposed method.
NurtureToken New!

Token crowdsale for this paper ends in

Buy Nurture Tokens

Authors

Are you an author of this paper? Check the Twitter handle we have for you is correct.

Zhao Kang (edit)
Liangjian Wen (add twitter)
Wenyu Chen (add twitter)
Zenglin Xu (edit)
Ask The Authors

Ask the authors of this paper a question or leave a comment.

Read it. Rate it.
#1. Which part of the paper did you read?

#2. The paper contains new data or analyses that is openly accessible?
#3. The conclusion is supported by the data and analyses?
#4. The conclusion is of scientific interest?
#5. The result is likely to lead to future research?

Github
User:
None (add)
Repo:
None (add)
Stargazers:
0
Forks:
0
Open Issues:
0
Network:
0
Subscribers:
0
Language:
None
Youtube
Link:
None (add)
Views:
0
Likes:
0
Dislikes:
0
Favorites:
0
Comments:
0
Other
Sample Sizes (N=):
Inserted:
Words Total:
Words Unique:
Source:
Abstract:
None
03/14/19 06:02PM
6,653
2,430
Tweets
arxiv_cscv: Low-rank Kernel Learning for Graph-based Clustering https://t.co/0FdZd4x5m3
ChristEd930427: RT @arxiv_org: Low-rank Kernel Learning for Graph-based Clustering. https://t.co/5wYs7a3dal https://t.co/qTOGSjoZDU
arxiv_cscv: Low-rank Kernel Learning for Graph-based Clustering https://t.co/0FdZd4x5m3
arxiv_cscv: Low-rank Kernel Learning for Graph-based Clustering https://t.co/0FdZd4x5m3
shubh_300595: RT @arxiv_org: Low-rank Kernel Learning for Graph-based Clustering. https://t.co/5wYs7a3dal https://t.co/qTOGSjoZDU
ElectronNest: RT @arxiv_org: Low-rank Kernel Learning for Graph-based Clustering. https://t.co/5wYs7a3dal https://t.co/qTOGSjoZDU
robotic_hands: RT @arxiv_org: Low-rank Kernel Learning for Graph-based Clustering. https://t.co/5wYs7a3dal https://t.co/qTOGSjoZDU
arxiv_org: Low-rank Kernel Learning for Graph-based Clustering. https://t.co/5wYs7a3dal https://t.co/qTOGSjoZDU
arxiv_cscv: Low-rank Kernel Learning for Graph-based Clustering https://t.co/0FdZd4x5m3
arxiv_cscv: Low-rank Kernel Learning for Graph-based Clustering https://t.co/0FdZd4x5m3
arxivml: "Low-rank Kernel Learning for Graph-based Clustering", Zhao Kang, Liangjian Wen, Wenyu Chen, Zenglin Xu https://t.co/V0XxB3Z8u1
arxiv_cs_LG: Low-rank Kernel Learning for Graph-based Clustering. Zhao Kang, Liangjian Wen, Wenyu Chen, and Zenglin Xu https://t.co/5wam7HRqZp
ibu_hoshina: RT @StatsPapers: Low-rank Kernel Learning for Graph-based Clustering. https://t.co/aQUZSoWrhA
StatsPapers: Low-rank Kernel Learning for Graph-based Clustering. https://t.co/aQUZSoWrhA
arxiv_cscv: Low-rank Kernel Learning for Graph-based Clustering https://t.co/0FdZd4x5m3
Images
Related