返回
Low-rank representation with adaptive graph regularization
DOI:10.1016/j.neunet.2018.08.007.png)
摘要
En 中文
Low-rank representation (LRR) has aroused much attention in the community of data mining. However, it has the following two problems which greatly limit its applications: (1) it cannot discover the intrinsic structure of data owing to the neglect of the local structure of data; (2) the obtained graph is not the optimal graph for clustering. To solve the above problems and improve the clustering performance, we propose a novel graph learning method named low-rank representation with adaptive graph regularization (LRR_AGR) in this paper. Firstly, a distance regularization term and a non-negative constraint are jointly integrated into the framework of LRR, which enables the method to simultaneously exploit the global and local information of data for graph learning. Secondly, a novel rank constraint is further introduced to the model, which encourages the learned graph to have very clear clustering structures, i.e., exactly c connected components for the data with c clusters. These two approaches are meaningful and beneficial to learn the optimal graph that discovers the intrinsic structure of data. Finally, an efficient iterative algorithm is provided to optimize the model. Experimental results on synthetic and real datasets show that the proposed method can significantly improve the clustering performance. (C) 2018 Elsevier Ltd. All rights reserved.
Keyword:
Low-rank representation
Graph regularization
Data clustering
Rank constraint
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
7.9K
被引数:
3.0W
机构
引用论文
Tinnitus Retraining Therapy (TRT) as a Method for Treatment of Tinnitus and Hyperacusis Patients耳鸣再训练疗法 (TRT) 作为治疗耳鸣和高亢患者的方法
The flow and heat transfer characteristics of superheated steam in offshore wells and analysis of superheated steam performance海上油井过热蒸汽流动传热特性及过热蒸汽性能分析

