- 1、本文档共8页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Distance Metric Learning, With Application To Clustering With Side-Information-英文文献
Distance metric learning, with application
to clustering with side-information
Eric P. Xing, Andrew Y. Ng, Michael I. Jordan and Stuart Russell
University of California, Berkeley
Berkeley, CA 94720
fepxing,ang,jordan,russellg @cs.berkeley.edu
Abstract
Many algorithms rely critically on being given a good metric over their
inputs. For instance, data can often be clustered in many “plausible”
ways, and if a clustering algorithm such as K-means initially fails to find
one that is meaningful to a user, the only recourse may be for the user to
manually tweak the metric until sufficiently good clusters are found. For
these and other applications requiring good metrics, it is desirable that
we provide a more systematic way for users to indicate what they con-
sider “similar.” For instance, we may ask them to provide examples. In
this paper, we present an algorithm that, given examples of similar (and,
if desired, dissimilar) pairs of points in Rn , learns a distance metric over
Rn that respects these relationships. Our method is based on posing met-
ric learning as a convex optimization problem, which allows us to give
efficient, local-optima-free algorithms. We also demonstrate empirically
that the learned metrics can be used to significantly improve clustering
performance.
1 Introduction
The performance of many learning and datamining algorithms depend critically on their
being given a good metric over the input space. For instance, K-means, nearest-neighbors
classifiers and kernel algorithms such as SVMs all need to be given good metrics that reflect
reasonably well the important relationships between the data. This proble
您可能关注的文档
- Bayesian Density Estimation and Inference Using Mixtures-英文文献.pdf
- Basic concepts and taxonomy of dependable and secure computing-英文文献.pdf
- Bayesian Interpolation-英文文献.pdf
- Bayesian Network Classifiers-英文文献.pdf
- Behavior recognition via sparse spatio-temporal features-英文文献.pdf
- Beyond pleasure and pain-英文文献.pdf
- Blind Beamforming for Non Gaussian Signals-英文文献.pdf
- Books in graphs-英文文献.pdf
- Bounds on Multiprocessing Timing Anomalies-英文文献.pdf
- Breaking and Fixing the Needham-Schroeder Public-Key Protocol using FDR-英文文献.pdf
文档评论(0)