A Biclustering Framework for Consensus Problems
From MaRDI portal
Abstract: We consider grouping as a general characterization for problems such as clustering, community detection in networks, and multiple parametric model estimation. We are interested in merging solutions from different grouping algorithms, distilling all their good qualities into a consensus solution. In this paper, we propose a bi-clustering framework and perspective for reaching consensus in such grouping problems. In particular, this is the first time that the task of finding/fitting multiple parametric models to a dataset is formally posed as a consensus problem. We highlight the equivalence of these tasks and establish the connection with the computational Gestalt program, that seeks to provide a psychologically-inspired detection theory for visual events. We also present a simple but powerful bi-clustering algorithm, specially tuned to the nature of the problem we address, though general enough to handle many different instances inscribed within our characterization. The presentation is accompanied with diverse and extensive experimental results in clustering, community detection, and multiple parametric model estimation in image processing applications.
Recommendations
- A survey of consensus clustering
- On constructing an optimal consensus clustering from multiple clusterings
- Clustering and isolation in the consensus problem for partitions
- On the parameterized complexity of consensus clustering
- On the parameterized complexity of consensus clustering
- An improved heuristic for consistent biclustering problems
- A review on consensus clustering methods
Cited in
(4)
This page was built for publication: A Biclustering Framework for Consensus Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5174318)
