k-Mnv-Rep: a k-type clustering algorithm for matrix-object data
From MaRDI portal
Publication:2053852
Recommendations
- Nonlinear multicriteria clustering based on multiple dissimilarity matrices
- Partitioning hard clustering algorithms based on multiple dissimilarity matrices
- Relational partitioning fuzzy clustering algorithms based on multiple dissimilarity matrices
- scientific article; zbMATH DE number 2170297
- A model for clustering data from heterogeneous dissimilarities
Cites work
- 10.1162/153244303321897735
- An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers
- Clustering large graphs via the singular value decomposition
- FEEDBACK ON A PUBLICLY DISTRIBUTED IMAGE DATABASE: THE MESSIDOR DATABASE
- Global discriminative-based nonnegative spectral clustering
- scientific article; zbMATH DE number 3858302 (Why is no real title available?)
- scientific article; zbMATH DE number 41467 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Measure, topology, and fractal geometry
- Solving the multiple instance problem with axis-parallel rectangles.
- Statistical comparisons of classifiers over multiple data sets
This page was built for publication: \(k\)-Mnv-Rep: a \(k\)-type clustering algorithm for matrix-object data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053852)