Distance metric learning guided adaptive subspace semi-supervised clustering

DOI10.1007/S11704-010-0376-9zbMATH Open1267.68195OpenAlexW2006584410MaRDI QIDQ352041FDOQ352041

Authors: Xuesong Yin, Enliang Hu 

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

Recommendations

• Semi-supervised clustering with metric learning: an adaptive kernel method
• Semi-supervised distance metric learning in high-dimensional spaces by using equivalence constraints
• Semi-supervised metric learning via topology preserving multiple semi-supervised assumptions
• Discriminative semi-supervised clustering analysis with pairwise constraints
• Kernel-based metric learning for semi-supervised clustering

zbMATH Keywords

data miningdistance metric learningpairwise constraintsemi-supervise clustering

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Principal component analysis.
• Convergence of a block coordinate descent method for nondifferentiable minimization
• Title not available (Why is that?)
• Extending the relevant component analysis algorithm for metric learning using both positive and negative equivalence constraints
• Discriminative semi-supervised clustering analysis with pairwise constraints
• Learning a Mahalanobis distance metric for data clustering and classification

Cited In (3)

• Semi-supervised distance metric learning in high-dimensional spaces by using equivalence constraints
• Semi-supervised metric learning via topology preserving multiple semi-supervised assumptions
• Semi-supervised clustering with metric learning: an adaptive kernel method

This page was built for publication: Distance metric learning guided adaptive subspace semi-supervised clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q352041)