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 条
  • [1] Refining a k-nearest neighbor graph for a computationally efficient spectral clustering
    Alshammari, Mashaan
    Stavrakakis, John
    Takatsuka, Masahiro
    PATTERN RECOGNITION, 2021, 114
  • [2] Graph Clustering with K-Nearest Neighbor Constraints
    Jakawat, Wararat
    Makkhongkaew, Raywat
    2019 16TH INTERNATIONAL JOINT CONFERENCE ON COMPUTER SCIENCE AND SOFTWARE ENGINEERING (JCSSE 2019), 2019, : 309 - 313
  • [3] Graph Based K-Nearest Neighbor Minutiae Clustering for Fingerprint Recognition
    Pawar, Vaishali
    Zaveri, Mukesh
    2014 10TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2014, : 675 - 680
  • [4] Fast agglomerative clustering using a k-nearest neighbor graph
    Franti, Pasi
    Virmajoki, Olli
    Hautamaki, Ville
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2006, 28 (11) : 1875 - 1881
  • [5] Fast PNN-based clustering using K-nearest neighbor graph
    Fränti, P
    Virmajoki, O
    Hautamäki, V
    THIRD IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2003, : 525 - 528
  • [6] A split-merge clustering algorithm based on the k-nearest neighbor graph
    Wang, Yan
    Ma, Yan
    Huang, Hui
    Wang, Bin
    Acharjya, Debi Prasanna
    INFORMATION SYSTEMS, 2023, 111
  • [7] Data Clustering Based on Community Structure in Mutual k-Nearest Neighbor Graph
    Zhang, Honglei
    Kiranyaz, Serkan
    Gabbouj, Moncef
    2018 41ST INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS AND SIGNAL PROCESSING (TSP), 2018, : 262 - 268
  • [8] A robust clustering method with noise identification based on directed K-nearest neighbor graph
    Li, Lin
    Chen, Xiang
    Song, Chengyun
    NEUROCOMPUTING, 2022, 508 : 19 - 35
  • [9] Spectral Clustering with Reverse Soft K-Nearest Neighbor Density Estimation
    Kursun, Olcay
    2010 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS IJCNN 2010, 2010,
  • [10] k-Nearest Neighbor based Clustering with Shape Alternation Adaptivity
    Lu, Yifeng
    Zhang, Yao
    Richter, Florian
    Seidl, Thomas
    2020 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2020,
12345