Learning representations from dendrograms
From MaRDI portal
Publication:2217438
Recommendations
Cites work
- A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
- A fast minimum spanning tree algorithm based on \(K\)-means
- Adaptive trajectory analysis of replicator dynamics for data clustering
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
- An introduction to support vector machines and other kernel-based learning methods.
- Application of cut polyhedra. I
- Clustering with qualitative information
- Correlation clustering
- Correlation clustering in general weighted graphs
- Correlation clustering with noisy input
- Factor graphs and the sum-product algorithm
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance
- Kernel methods in machine learning
- Robust path-based spectral clustering
Cited in
(3)
This page was built for publication: Learning representations from dendrograms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2217438)