Nonlinear adaptive distance metric learning for clustering

@inproceedings{Chen2007NonlinearAD,
  title={Nonlinear adaptive distance metric learning for clustering},
  author={Jianhui Chen and Zheng Zhao and Jieping Ye and Huan Liu},
  booktitle={KDD},
  year={2007}
}
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a low-dimensional manifold, where geometric relationships such as pairwise distances are preserved. It can be extended to the nonlinear case by applying the kernel trick, which embeds the data into a feature space by specifying the kernel function that computes the dot products between data points in the feature space. In this… CONTINUE READING
Highly Cited
This paper has 51 citations. REVIEW CITATIONS
24 Extracted Citations
6 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 24 extracted citations

51 Citations

051015'09'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 51 citations based on the available data.

See our FAQ for additional information.

Referenced Papers

Publications referenced by this paper.
Showing 1-6 of 6 references

The MOSEK interior point optimizer for linear programming: an implementation of the homogeneous algorithm

  • E. D. Andersen, K. D. Andersen
  • T. T. H. Frenk, K. Roos and S. Zhang, editors…
  • 2000
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…