Distance metric learning guided adaptive subspace semi-supervised clustering
From MaRDI portal
Publication:352041
DOI10.1007/s11704-010-0376-9zbMath1267.68195OpenAlexW2006584410MaRDI QIDQ352041
Publication date: 4 July 2013
Published in: Frontiers of Computer Science in China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11704-010-0376-9
Cites Work
- Learning a Mahalanobis distance metric for data clustering and classification
- Principal component analysis.
- Extending the relevant component analysis algorithm for metric learning using both positive and negative equivalence constraints
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Unnamed Item
- Unnamed Item
This page was built for publication: Distance metric learning guided adaptive subspace semi-supervised clustering