A multiplex-network based approach for clustering ensemble selection

被引:8
|
作者
Rastin, Parisa [1 ]
Kanawati, Rushed [1 ]
机构
[1] UP13 SPC, LIPN CNRS UMR 7030, 99 Av JB Clement, F-9430 Villetaneuse, France
关键词
Ensemble clustering; Clustering ensemble selection; Multiplex network; Community detection; COMMUNITY STRUCTURE;
D O I
10.1145/2808797.2808825
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Performance of cluster ensemble approaches is now known to be tightly related to both quality and diversity of input base clusterings. Cluster ensemble selection (CES) refers to the process of filtering the raw set of base clusterings in order to select a subset of high quality and diverse clusterings. Most of existing CES approaches apply one index for measuring the quality and another for evaluating the diversity of clusterings. Moreover the number of clusterings to select is usually given as an input to the CES function. In this work we propose a new CES approach that allow taking into account an ensemble of quality and diversity indexes. In addition, the proposed approach computes automatically the number of clusterings to return. The basic idea is to define a multiplex network over the provided set of base clusterings. Each slice in the multiplex network is obtained by defining a proximity-graph over the set of base clusterings using a given clustering dissimilarity index. A community detection algorithm is applied to the obtained multiplex network. We then rank clusterings in each community applying an ensemble-ranking approach using different (internal) clustering quality indexes. From each community we select the base clustering ranked at the top. First experiments on benchmark datasets shows the effectiveness of the proposed CES approach.
引用
收藏
页码:1332 / 1339
页数:8
相关论文
共 50 条
  • [21] Classifier subset selection based on classifier representation and clustering ensemble
    Danyang Li
    Zhuhong Zhang
    Guihua Wen
    Applied Intelligence, 2023, 53 : 20730 - 20752
  • [22] A clustering ensemble framework based on elite selection of weighted clusters
    Hamid Parvin
    Behrouz Minaei-Bidgoli
    Advances in Data Analysis and Classification, 2013, 7 : 181 - 208
  • [23] Leveraging Frequency and Diversity based Ensemble Selection to Consensus Clustering
    Banerjee, Arko
    2014 SEVENTH INTERNATIONAL CONFERENCE ON CONTEMPORARY COMPUTING (IC3), 2014, : 123 - 129
  • [24] Classifier subset selection based on classifier representation and clustering ensemble
    Li, Danyang
    Zhang, Zhuhong
    Wen, Guihua
    APPLIED INTELLIGENCE, 2023, 53 (18) : 20730 - 20752
  • [25] A clustering ensemble framework based on elite selection of weighted clusters
    Parvin, Hamid
    Minaei-Bidgoli, Behrouz
    ADVANCES IN DATA ANALYSIS AND CLASSIFICATION, 2013, 7 (02) : 181 - 208
  • [26] A Graph Based Approach for Clustering Ensemble of Fuzzy Partitions
    Ahmadzadeh, Mohammad
    Vahidi, Javad
    Golestan, Zahra Azartash
    Shirazi, Babak
    JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE-JMCS, 2013, 6 (02): : 154 - 165
  • [27] Ensemble clustering based approach for software architecture recovery
    Puchala S.P.R.
    Chhabra J.K.
    Rathee A.
    International Journal of Information Technology, 2022, 14 (4) : 2013 - 2019
  • [28] Clustering Ensemble: A Multiobjective Genetic Algorithm based Approach
    Chatterjee, Sujoy
    Mukhopadhyay, Anirban
    FIRST INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE: MODELING TECHNIQUES AND APPLICATIONS (CIMTA) 2013, 2013, 10 : 443 - 449
  • [29] Adaptive Data Clustering Ensemble Algorithm Based on Stability Feature Selection and Spectral Clustering
    Li, Zuhong
    Ma, Zhixin
    Ma, Zhicheng
    Yang, Shibo
    2019 2ND INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND BIG DATA (ICAIBD 2019), 2019, : 277 - 281
  • [30] Community Detection in Multiplex Networks Based on Evolutionary Multitask Optimization and Evolutionary Clustering Ensemble
    Lyu, Chao
    Shi, Yuhui
    Sun, Lijun
    Lin, Chin-Teng
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2023, 27 (03) : 728 - 742