AMOS: AN AUTOMATED MODEL ORDER SELECTION ALGORITHM FOR SPECTRAL GRAPH CLUSTERING

被引:0
|
作者
Chen, Pin-Yu [1 ]
Gensollen, Thibaut [1 ]
Hero, Alfred O. [1 ]
机构
[1] Univ Michigan, Dept Elect Engn & Comp Sci, Ann Arbor, MI 48109 USA
关键词
D O I
暂无
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
One of the longstanding problems in spectral graph clustering (SGC) is the so-called model order selection problem: automated selection of the correct number of clusters. This is equivalent to the problem of finding the number of connected components or communities in an undirected graph. In this paper, we propose AMOS, an automated model order selection algorithm for SGc. Based on a recent analysis of clustering reliability for SGC under the random interconnection model, AMOS works by incrementally increasing the number of clusters, estimating the quality of identified clusters, and providing a series of clustering reliability tests. Consequently, AMOS outputs clusters of minimal model order with statistical clustering reliability guarantees. Comparing to three other automated graph clustering methods on real-world datasets, AMOS shows superior performance in terms of multiple external and internal clustering metrics.
引用
收藏
页码:6448 / 6452
页数:5
相关论文
共 50 条
  • [41] Unified Spectral Clustering with Optimal Graph
    Kang, Zhao
    Peng, Chong
    Cheng, Qiang
    Xu, Zenglin
    THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 3366 - 3373
  • [42] Spectral feature vectors for graph clustering
    Luo, Bin
    Wilson, Richard C.
    Hancock, Edwin R.
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2002, 2396 : 83 - 93
  • [43] Connected graph decomposition for spectral clustering
    Tong, Tao
    Zhu, Xiaofeng
    Du, Tingting
    MULTIMEDIA TOOLS AND APPLICATIONS, 2019, 78 (23) : 33247 - 33259
  • [44] Commute times for graph spectral clustering
    Qiu, HJ
    Hancock, ER
    COMPUTER ANALYSIS OF IMAGES AND PATTERNS, PROCEEDINGS, 2005, 3691 : 128 - 136
  • [45] Spectral methods for graph clustering - A survey
    Nascimento, Maria C. V.
    de Carvalho, Andre C. P. L. F.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 211 (02) : 221 - 231
  • [46] Spectral clustering with eigenvector selection
    Xiang, Tao
    Gong, Shaogang
    PATTERN RECOGNITION, 2008, 41 (03) : 1012 - 1029
  • [47] Efficient Model Selection in Switching Linear Dynamic Systems by Graph Clustering
    Karimi, Parisa
    Butala, Mark D.
    Zhao, Zhizhen
    Kamalabadi, Farzad
    IEEE SIGNAL PROCESSING LETTERS, 2022, 29 : 2482 - 2486
  • [48] A Model Selection Algorithm For Mixture Model Clustering Of Heterogeneous Multivariate Data
    Erol, Hamza
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INNOVATIONS IN INTELLIGENT SYSTEMS AND APPLICATIONS (IEEE INISTA), 2013,
  • [49] An Automated Clustering Algorithm Based On Agglomerative Clustering
    Karabina, Armagan
    Kilic, Erdal
    2016 24TH SIGNAL PROCESSING AND COMMUNICATION APPLICATION CONFERENCE (SIU), 2016, : 1801 - 1804
  • [50] Clustering-based order-picking sequence algorithm for an automated warehouse
    Kim, BI
    Heragu, SS
    Graves, RJ
    Onge, AS
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2003, 41 (15) : 3445 - 3460