Generalized Cluster Aggregation
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 1279-1283.
Abstract
Clustering aggregation has emerged as an important extension of the classical clustering problem. It refers to the situation in which a number of different (input) clusterings have been obtained for a particular data set and it is desired to aggregate those clustering results to get a better clustering solution. In this paper, we propose a unified framework to solve the clustering aggregation problem, where the aggregated clustering result is obtained by minimizing the (weighted) sum of the Bregman divergence between it and all the input clusterings. Moreover, under our algorithm framework, we also propose a novel cluster aggregation problem where some must-link and cannot-link constraints are given in addition to the input clusterings. Finally the experimental results on some real world data sets are presented to show the effectiveness of our method.Fei Wang, Xin Wang, Tao Li
@inproceedings{ijcai2009p215,
title = {Generalized Cluster Aggregation},
author = {Wang, Fei and Wang, Xin and Li, Tao},
booktitle = {Proceedings of the Twenty-First International Joint Conference on
Artificial Intelligence, {IJCAI-09}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Hiroaki Kitano},
pages = {1279--1283},
year = {2009},
url = {https://ijcai.org/proceedings/2009/215},
}
TY - CPAPER TI - Generalized Cluster Aggregation AU - Wang, Fei AU - Wang, Xin AU - Li, Tao T2 - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 PB - International Joint Conferences on Artificial Intelligence PY - 2009 SP - 1279 EP - 1283 UR - https://ijcai.org/proceedings/2009/215 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: