ORCA: Outlier detection and Robust Clustering for Attributed graphs

被引:1
|
作者
Eswar, Srinivas [1 ]
Kannan, Ramakrishnan [2 ]
Vuduc, Richard [1 ]
Park, Haesun [1 ]
机构
[1] Georgia Inst Technol, Sch Computat Sci & Engn, Atlanta, GA 30308 USA
[2] Oak Ridge Natl Lab, 1 Bethel Valley Rd, Oak Ridge, TN 37830 USA
关键词
Attributed graphs; Robust clustering; Anomaly detection; Joint matrix low rank approximation; NONNEGATIVE MATRIX;
D O I
10.1007/s10898-021-01024-z
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
A framework is proposed to simultaneously cluster objects and detect anomalies in attributed graph data. Our objective function along with the carefully constructed constraints promotes interpretability of both the clustering and anomaly detection components, as well as scalability of our method. In addition, we developed an algorithm called Outlier detection and Robust Clustering for Attributed graphs (ORCA) within this framework. ORCA is fast and convergent under mild conditions, produces high quality clustering results, and discovers anomalies that can be mapped back naturally to the features of the input data. The efficacy and efficiency of ORCA is demonstrated on real world datasets against multiple state-of-the-art techniques.
引用
收藏
页码:967 / 989
页数:23
相关论文
共 50 条
  • [1] ORCA: Outlier detection and Robust Clustering for Attributed graphs
    Srinivas Eswar
    Ramakrishnan Kannan
    Richard Vuduc
    Haesun Park
    Journal of Global Optimization, 2021, 81 : 967 - 989
  • [2] Focused Clustering and Outlier Detection in Large Attributed Graphs
    Perozzi, Bryan
    Akoglu, Leman
    Sanchez, Patricia Iglesias
    Mueller, Emmanuel
    PROCEEDINGS OF THE 20TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING (KDD'14), 2014, : 1346 - 1355
  • [3] BOND: Benchmarking Unsupervised Outlier Node Detection on Static Attributed Graphs
    Liu, Kay
    Dou, Yingtong
    Zhao, Yue
    Ding, Xueying
    Hu, Xiyang
    Zhang, Ruitong
    Ding, Kaize
    Chen, Canyu
    Peng, Hao
    Shu, Kai
    Sun, Lichao
    Li, Jundong
    Chen, George H.
    Jia, Zhihao
    Yu, Philip S.
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35 (NEURIPS 2022), 2022,
  • [4] Ranking Outlier Nodes in Subspaces of Attributed Graphs
    Mueller, Emmanuel
    Sanchez, Patricia Iglesias
    Muelle, Yvonne
    Boehm, Klemens
    2013 IEEE 29TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING WORKSHOPS (ICDEW), 2013, : 216 - 222
  • [5] Central Clustering of Attributed Graphs
    Brijnesh J. Jain
    Fritz Wysotzki
    Machine Learning, 2004, 56 : 169 - 207
  • [6] INCREMENTAL CLUSTERING OF ATTRIBUTED GRAPHS
    SEONG, DS
    KIM, HS
    PARK, KH
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1993, 23 (05): : 1399 - 1411
  • [7] Central clustering of attributed graphs
    Jain, BJ
    Wysotzki, F
    MACHINE LEARNING, 2004, 56 (1-3) : 169 - 207
  • [8] OUTLIER-AWARE ROBUST CLUSTERING
    Forero, Pedro A.
    Kekatos, Vassilis
    Giannakis, Georgios B.
    2011 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2011, : 2244 - 2247
  • [9] Synthesis of function-described graphs and clustering of attributed graphs
    Serratosa, F
    Alquézar, R
    Sanfeliu, A
    INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2002, 16 (06) : 621 - 655
  • [10] Effective and Scalable Clustering on Massive Attributed Graphs
    Yang, Renchi
    Shi, Jieming
    Yang, Yin
    Huang, Keke
    Zhang, Shiqi
    Xiao, Xiaokui
    PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE 2021 (WWW 2021), 2021, : 3675 - 3687