A Robust Convex Formulation for Ensemble Clustering

Junning Gao, Makoto Yamada, Samuel Kaski, Hiroshi Mamitsuka, Shanfeng Zhu

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

2 Citations (Scopus)
77 Downloads (Pure)

Abstract

We formulate ensemble clustering as a regularization problem over nuclear norm and cluster-wise group norm, and present an efficient optimization
algorithm, which we call Robust Convex Ensemble Clustering (RCEC). A key feature of RCEC allows to remove anomalous cluster assignments obtained
from component clustering methods by using the group-norm regularization. Moreover, the proposed method is convex and can find the globally optimal solution. We first showed that using synthetic data experiments, RCEC could learn stable cluster assignments from the input matrix including anomalous clusters. We then showed that RCEC outperformed state-of-the-art ensemble clustering methods by using real-world data sets.
Original languageEnglish
Title of host publicationProceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-16)
EditorsSubbarao Kambhampati
Place of Publication2275 East Bayshore Road, Suite 160, Palo Alto CA 94303 USA
PublisherAAAI PRESS
Pages1476-1482
Number of pages6
ISBN (Print)978-1-57735-770-4
Publication statusPublished - Jul 2016
MoE publication typeA4 Article in a conference publication
EventInternational Joint Conference on Artificial Intelligence - New York Hilton Midtown, New York, United States
Duration: 9 Jul 201615 Jul 2016
Conference number: 25
http://ijcai-16.org/index.php/welcome/view/home

Conference

ConferenceInternational Joint Conference on Artificial Intelligence
Abbreviated titleIJCAI
CountryUnited States
CityNew York
Period09/07/201615/07/2016
Internet address

Keywords

  • ensemble clustering
  • convex optimization

Fingerprint Dive into the research topics of 'A Robust Convex Formulation for Ensemble Clustering'. Together they form a unique fingerprint.

Cite this