Pages that link to "Item:Q2380012"
From MaRDI portal
The following pages link to On constructing an optimal consensus clustering from multiple clusterings (Q2380012):
Displaying 10 items.
- A randomized PTAS for the minimum consensus clustering with a fixed number of clusters (Q418755) (← links)
- An efficient algorithm for computing the distance between close partitions (Q617900) (← links)
- Consensus of partitions: a constructive approach (Q1761306) (← links)
- HC\_AB: a new heuristic clustering algorithm based on approximate backbone (Q1944152) (← links)
- On the parameterized complexity of consensus clustering (Q2015135) (← links)
- \textit{MultiClust} special issue on discovering, summarizing and using multiple clusterings (Q2260915) (← links)
- A commentary on some recent methods in sibling group reconstruction based on set coverings (Q3096891) (← links)
- A Biclustering Framework for Consensus Problems (Q5174318) (← links)
- Determinantal consensus clustering (Q6062809) (← links)
- Condorcet’s Jury Theorem for Consensus Clustering (Q6488082) (← links)