Ensemble clustering by means of clustering embedding in vector spaces
From MaRDI portal
Publication:898340
DOI10.1016/j.patcog.2013.08.019zbMath1326.62137OpenAlexW2025549250MaRDI QIDQ898340
Publication date: 8 December 2015
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2013.08.019
Related Items (6)
An Edit Distance Between Graph Correspondences ⋮ A clustering ensemble: two-level-refined co-association matrix with path-based transformation ⋮ Ensemble clustering using factor graph ⋮ Exact solution to median surface problem using 3D graph search and application to parameter space exploration ⋮ Cluster ensembles: a survey of approaches with recent extensions and applications ⋮ Clustering ensemble based on sample's stability
Uses Software
Cites Work
- Local equivalences of distances between clusterings -- a geometric perspective
- The consensus string problem for a metric is NP-complete
- Generalized median graph computation by means of graph embedding in vector spaces
- Weighted partition consensus via kernels
- On the point for which the sum of the distances to \(n\) given points is minimum
- NP-hard problems in hierarchical-tree clustering
- Partition-distance: A problem and class of perfect graphs arising in clustering
- Ensemble clustering using semidefinite programming with applications
- Algorithms on Strings, Trees and Sequences
- 10.1162/153244303321897735
- Weighted mean of a pair of graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Ensemble clustering by means of clustering embedding in vector spaces