\(k\)-Mnv-Rep: a \(k\)-type clustering algorithm for matrix-object data
From MaRDI portal
Publication:2053852
DOI10.1016/j.ins.2020.06.071zbMath1475.62199OpenAlexW3040824804MaRDI QIDQ2053852
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
Uses Software
Cites Work
- Clustering large graphs via the singular value decomposition
- An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers
- Solving the multiple instance problem with axis-parallel rectangles.
- Global discriminative-based nonnegative spectral clustering
- 10.1162/153244303321897735
- FEEDBACK ON A PUBLICLY DISTRIBUTED IMAGE DATABASE: THE MESSIDOR DATABASE
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item