NP-hard problems in hierarchical-tree clustering
Acta Informatica
Bootstrap technique in cluster analysis
Pattern Recognition
A cutting plane algorithm for a clustering problem
Mathematical Programming: Series A and B
Integrating Microarray Data by Consensus Clustering
ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
Making decisions in multi partitioning
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
Least square consensus clustering: criteria, methods, experiments
ECIR'13 Proceedings of the 35th European conference on Advances in Information Retrieval
Data weighing mechanisms for clustering ensembles
Computers and Electrical Engineering
Lagrangian relaxation and pegging test for the clique partitioning problem
Advances in Data Analysis and Classification
| Hi-index | 0.00 |
Given a profile (family) 驴 of partitions of a set of objects or items X, we try to establish a consensus partition containing a maximum number of joined or separated pairs in X that are also joined or separated in the profile. To do so, we define a score function, S 驴 associated to any partition on X. Consensus partitions for 驴 are those maximizing this function. Therefore, these consensus partitions have the median property for the profile and the symmetric difference distance. This optimization problem can be solved, in certain cases, by integer linear programming. We define a polynomial heuristic which can be applied to partitions on a large set of items. In cases where an optimal solution can be computed, we show that the partitions built by this algorithm are very close to the optimum which is reached in practically all the cases, except for some sets of bipartitions.