Metacluster-based Projective Clustering Ensembles

被引:15
|
作者
Gullo, Francesco [1 ]
Domeniconi, Carlotta [2 ]
Tagarelli, Andrea [3 ]
机构
[1] Yahoo Res, Barcelona 08018, Spain
[2] George Mason Univ, Dept Comp Sci, Fairfax, VA 22030 USA
[3] Univ Calabria, DIMES Dept, I-87036 Arcavacata Di Rende, CS, Italy
关键词
Clustering; Clustering ensembles; Projective clustering; Subspace clustering; Dimensionality reduction; Optimization; SUBSPACE; CONSENSUS;
D O I
10.1007/s10994-013-5395-y
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The Projective Clustering Ensemble (PCE) problem is a recent clustering advance aimed at combining the two powerful tools of clustering ensembles and projective clustering. PCE has been formalized as either a two-objective or a single-objective optimization problem. Two-objective PCE has been recognized as more accurate than its single-objective counterpart, although it is unable to jointly handle the object-based and feature-based cluster representations. In this paper, we push forward the current PCE research, aiming to overcome the limitations of all existing PCE formulations. We propose a novel single-objective PCE formulation so that (i) the object-based and feature-based cluster representations are jointly considered, and (ii) the resulting optimization strategy follows a metacluster-based methodology borrowed from traditional clustering ensembles. As a result, the proposed formulation features best suitability to the PCE problem, thus guaranteeing improved effectiveness. Experiments on benchmark datasets have shown how the proposed approach achieves better average accuracy than all existing PCE methods, as well as efficiency superior to the most accurate existing metacluster-based PCE method on larger datasets.
引用
收藏
页码:181 / 216
页数:36
相关论文
共 50 条
  • [31] A survey: Clustering ensembles techniques
    Ghaemi, Reza
    Sulaiman, Nasir
    Ibrahim, Hamidah
    Mustapha, Norwati
    World Academy of Science, Engineering and Technology, 2009, 38 : 644 - 653
  • [32] Clustering Ensembles with Active Constraints
    Al-Razgan, Muna
    Domeniconi, Carlotta
    APPLICATIONS OF SUPERVISED AND UNSUPERVISED ENSEMBLE METHODS, 2009, 245 : 175 - 189
  • [33] A mixture model for clustering ensembles
    Topchy, A
    Jain, AK
    Punch, W
    PROCEEDINGS OF THE FOURTH SIAM INTERNATIONAL CONFERENCE ON DATA MINING, 2004, : 379 - 390
  • [34] Framework for Active Clustering With Ensembles
    Barr, Jeremiah R.
    Bowyer, Kevin W.
    Flynn, Patrick J.
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2014, 9 (11) : 1986 - 2001
  • [35] Clustering ensembles of social networks
    Sweet, Tracy M.
    Flynt, Abby
    Choi, David
    NETWORK SCIENCE, 2019, 7 (02) : 141 - 159
  • [36] The Performance Factors of Clustering Ensembles
    Amasyali, M. Fatih
    Ersoy, Okan
    2008 IEEE 16TH SIGNAL PROCESSING, COMMUNICATION AND APPLICATIONS CONFERENCE, VOLS 1 AND 2, 2008, : 201 - 204
  • [37] Nonparametric Bayesian Clustering Ensembles
    Wang, Pu
    Domeniconi, Carlotta
    Laskey, Kathryn Blackmond
    MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, PT III, 2010, 6323 : 435 - 450
  • [38] A Projective Clustering Algorithm based on Significant Local Dense Areas
    Zong, Yu
    Xu, Guandong
    Jin, Ping
    Yi, Xun
    Chen, Enhong
    Wu, Zongda
    2012 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2012,
  • [39] SIMPLE AND EFFICIENT PROJECTIVE CLUSTERING
    Olson, Clark F.
    Lyons, Henry J.
    KDIR 2010: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND INFORMATION RETRIEVAL, 2010, : 45 - 55
  • [40] Validation indices for projective clustering
    Chen, Lifei
    He, Shanjun
    Jiang, Qingshan
    FRONTIERS OF COMPUTER SCIENCE IN CHINA, 2009, 3 (04): : 477 - 484