返回
Compressed constrained spectral clustering framework for large-scale data sets
DOI:10.1016/j.knosys.2017.08.003.png)
摘要
En 中文
The method of incorporating constraint information into spectral clustering, i.e., \constrained spectral clustering (CSC), can greatly improve clustering accuracy, and thus has been widely employed in the machine learning literature. In this paper, we propose a compressed CSC framework by combining specific graph constructions with a recently introduced CSC model. Particularly, our framework has ability to avoid losing the main partition information in the compression process. By presenting a theoretical analysis and empirical results, we demonstrate that our new framework can achieve the same clustering solution as that of the original model with the specific graph structure. In addition, because our framework utilizes landmark-based graph construction and the approximate matrix decomposition simultaneously, it can be applied to both feature and graph data in a more general way. Moreover, the parameter setting in our framework is rather simple, and therefore it is very practical. Experimental results indicate that our framework has advantages in terms of efficiency and effectiveness. (C) 2017 Published by Elsevier B.V.
Keyword:
Constrained spectral clustering
Landmark
Matrix decomposition
Efficiency
Effectiveness
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Tinnitus Retraining Therapy (TRT) as a Method for Treatment of Tinnitus and Hyperacusis Patients耳鸣再训练疗法 (TRT) 作为治疗耳鸣和高亢患者的方法
LED: A fast overlapping communities detection algorithm based on structural clustering
NEUROCOMPUTING
IF6.5
Ionic liquid-assisted solvothermal synthesis of oriented self-assembled Fe3O4 nanoparticles into monodisperse nanoflakes
CrystEngComm
IF0
Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions
SIAM REVIEW
IF6.1

