arrow
返回

Agglomerative clustering via maximum incremental path integral

delete2013-11-01
delete90
PRE
AI
W
Wei Zhang
D
Deli Zhao
王小岗 封面图
王小岗 (Xiaogang Wang) *
DOI:10.1016/j.patcog.2013.04.013delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Agglomerative clustering, which iteratively merges small clusters, is commonly used for clustering because it is conceptually simple and produces a hierarchy of clusters. In this paper, we propose a novel graph-structural agglomerative clustering algorithm, where the graph encodes local structures of data. The idea is to define a structural descriptor of clusters on the graph and to assume that two clusters have large affinity if their structural descriptors undergo substantial change when merging them into one cluster. A key insight of this paper to treat a cluster as a dynamical system and its samples as states. Based on that, Path Integral, which has been introduced in statistical mechanics and quantum mechanics, is utilized to measure the stability of a dynamical system. It is proposed as the structural descriptor, and the affinity between two clusters is defined as Incremental Path Integral, which can be computed in a closed-form exact solution, with linear time complexity with respect to the maximum size of clusters. A probabilistic justification of the algorithm based on absorbing random walk is provided. Experimental comparison on toy data and imagery data shows that it achieves considerable improvement over the state-of-the-art clustering algorithms. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Agglomerative clustering
Path integral
Graph algorithms
Random walk
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Pattern Recognition 封面图
Pattern Recognition
IF:
7.6
论文数:
1.3W
被引数:
4.5W

机构

C
Chinese University of Hong Kong
学者数:
3.4W
论文数: 3.2W
被引数: 5.6W
引用论文

引用论文

err分享
err收藏
err分享
err收藏
Consistency of spectral clustering
err2008-04-01
err402
errOAAI
errvon Luxburg, Ulrike; Belkin, Mikhail; Bousquet, Olivier
err分享
err收藏
学者 查看更多内容