返回
Hierarchical kernel spectral clustering
DOI:10.1016/j.neunet.2012.06.007.png)
摘要
En 中文
Kernel spectral clustering fits in a constrained optimization framework where the primal problem is expressed in terms of high-dimensional feature maps and the dual problem is expressed in terms of kernel evaluations. An eigenvalue problem is solved at the training stage and projections onto the eigenvectors constitute the clustering model. The formulation allows out-of-sample extensions which are useful for model selection in a learning setting. In this work, we propose a methodology to reveal the hierarchical structure present on the data. During the model selection stage, several clustering model parameters leading to good clusterings can be found. These results are then combined to display the underlying cluster hierarchies where the optimal depth of the tree is automatically determined. Simulations with toy data and real-life problems show the benefits of the proposed approach. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Hierarchical clustering
Spectral clustering
Kernel methods
Out-of-sample extensions
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
8.2K
被引数:
3.0W
机构
引用论文
Tinnitus Retraining Therapy (TRT) as a Method for Treatment of Tinnitus and Hyperacusis Patients耳鸣再训练疗法 (TRT) 作为治疗耳鸣和高亢患者的方法
Preservation of Putative Continence Nerves during Radical Retropubic Prostatectomy Leads to More Rapid Return of Urinary Continence
Urology
IF0
The activation of the contact phase of coagulation by physiologic surfaces in plasma: the effect of large negatively charged liposomal vesicles
Blood
IF0

