返回
Sparse kernel spectral clustering models for large-scale data analysis
DOI:10.1016/j.neucom.2011.01.001.png)
摘要
En 中文
Kernel spectral clustering has been formulated within a primal-dual optimization setting allowing natural extensions to out-of-sample data together with model selection in a learning framework. This becomes important for predictive purposes and for good generalization capabilities. The clustering model is formulated in the primal in terms of mappings to high-dimensional feature spaces typical of support vector machines and kernel-based methodologies. The dual problem corresponds to an eigenvalue decomposition of a centered Laplacian matrix derived from pairwise similarities within the data. The out-of-sample extension can also be used to introduce sparsity and to reduce the computational complexity of the resulting eigenvalue problem. In this paper, we propose several methods to obtain sparse and highly sparse kernel spectral clustering models. The proposed approaches are based on structural properties of the solutions when the clusters are well formed. Experimental results with difficult toy examples and images show the applicability of the proposed sparse models with predictive capabilities. (C) 2011 Elsevier B.V. All rights reserved.
Keyword:
Kernel spectral clustering
Sparseness
Large-scale data
Kernel methods
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Tinnitus Retraining Therapy (TRT) as a Method for Treatment of Tinnitus and Hyperacusis Patients耳鸣再训练疗法 (TRT) 作为治疗耳鸣和高亢患者的方法
Planar gradiometer for magnetic induction tomography (MIT): theoretical and experimental sensitivity maps for a low-contrast phantom用于磁感应断层扫描 (MIT) 的平面梯度仪: 低对比度体模的理论和实验灵敏度图

