Spectral Clustering Based on k-Nearest Neighbor Graph

被引：0

作者：

Lucinska, Malgorzata ^{[1
]}

Wierzchon, Lawomir T. ^{[2
,3
]}

机构：

[1] Kielce Univ Technol, Kielce, Poland

[2] Polish Acad Sci, Inst Comp Sci, Warsaw, Poland

[3] Univ Gdansk, Gdansk, Poland

来源：

COMPUTER INFORMATION SYSTEMS AND INDUSTRIAL MANAGEMENT (CISIM) | 2012年 / 7564卷

关键词：

Spectral clustering; nearest neighbor graph; signless Laplacian;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Finding clusters in data is a challenging task when the clusters differ widely in shapes, sizes, and densities. We present a novel spectral algorithm Speclus with a similarity measure based on modified mutual nearest neighbor graph. The resulting affinity matrix reflex the true structure of data. Its eigenvectors, that do not change their sign, are used for clustering data. The algorithm requires only one parameter - a number of nearest neighbors, which can be quite easily established. Its performance on both artificial and real data sets is competitive to other solutions.

引用

页码：254 / 265

页数：12

共 50 条

[41] Sublinear time approximation of the cost of a metric k-nearest neighbor graph
Czumaj, Artur
Sohler, Christian
PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 2973 - 2992
[42] Graph Theoretic Approach to the Robustness of k-Nearest Neighbor Vehicle Platoons
Pirani, Mohammad
Hashemi, Ehsan
Simpson-Porco, John W.
Fidan, Baris
Khajepour, Amir
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2017, 18 (11) : 3218 - 3224
[43] Greedy Filtering: A Scalable Algorithm for K-Nearest Neighbor Graph Construction
Park, Youngki
Park, Sungchan
Lee, Sang-goo
Jung, Woosung
DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, DASFAA 2014, PT I, 2014, 8421 : 327 - 341
[44] A Novel clustering method based on hybrid K-nearest-neighbor graph
Qin, Yikun
Yu, Zhu Liang
Wang, Chang-Dong
Gu, Zhenghui
Li, Yuanqing
PATTERN RECOGNITION, 2018, 74 : 1 - 14
[45] Connected K-nearest neighbor clustering algorithm for radar signal sorting
Si W.
Zhang Y.
Deng Z.
Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics, 2023, 45 (08): : 2463 - 2470
[46] Using the k-nearest neighbor graph for proximity searching in metric spaces
Paredes, Rodrigo
Chavez, Edgar
STRING PROCESSING AND INFORMATION RETRIEVAL, PROCEEDINGS, 2005, 3772 : 127 - 138
[47] Using k-nearest neighbor and feature selection as an improvement to hierarchical clustering
Mylonas, P
Wallace, M
Kollias, S
METHODS AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 3025 : 191 - 200
[48] An Enhanced K-Nearest Neighbor Algorithm Using Information Gain and Clustering
Taneja, Shweta
Gupta, Charu
Goyal, Kratika
Gureja, Dharna
2014 FOURTH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTING AND COMMUNICATION TECHNOLOGIES (ACCT 2014), 2014, : 325 - 329
[49] Sublinear time approximation of the cost of a metric k-nearest neighbor graph
Czumaj, Artur
Sohler, Christian
PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 2973 - 2992
[50] A new affinity matrix weighted k-nearest neighbors graph to improve spectral clustering accuracy
Ahmed, Muhammad Jamal
Saeed, Faisal
Paul, Anand
Jan, Sadeeq
Seo, Hyuncheol
PEERJ COMPUTER SCIENCE, 2021, 7 : 1 - 19

← 1 2 3 4 5 →