k-Mnv-Rep: a k-type clustering algorithm for matrix-object data
From MaRDI portal
Publication:2053852
DOI10.1016/J.INS.2020.06.071zbMATH Open1475.62199OpenAlexW3040824804MaRDI QIDQ2053852FDOQ2053852
Authors: Yanyan Li 
Publication date: 30 November 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2020.06.071
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
- Statistical comparisons of classifiers over multiple data sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- 10.1162/153244303321897735
- Title not available (Why is that?)
- Clustering large graphs via the singular value decomposition
- Solving the multiple instance problem with axis-parallel rectangles.
- Measure, topology, and fractal geometry
- Global discriminative-based nonnegative spectral clustering
- An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers
- FEEDBACK ON A PUBLICLY DISTRIBUTED IMAGE DATABASE: THE MESSIDOR DATABASE
Uses Software
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)
