0


学习结合复杂表示的距离

Learning to Combine Distances for Complex Representations
课程网址: http://videolectures.net/icml07_woznica_lcdf/  
主讲教师: Adam Woznica
开课单位: 日内瓦大学
开课时间: 2007-06-23
课程语种: 英语
中文简介:
只要在输入空间上给出适当的相异度函数,k近邻算法可以容易地适用于对复杂对象(例如集合,图形)进行分类。学习实例的表示和在该表示上使用的不相似性都应该基于领域知识来确定。然而,即使存在领域知识,也不能明显应该使用哪种复杂表示或者应该对所选择的表示应用哪种不相似性。在本文中,我们提出了一个框架,允许组合给定学习问题的不同复杂表示和/或在这些表示上定义的不同差异。我们建立在先前为矢量数据的度量学习开发的想法上。我们通过学习如何组合不同的设定距离度量来证明我们的方法在域中的效用,其中学习实例被表示为向量集。
课程简介: The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Both the representation of the learning instances and the dissimilarity employed on that representation should be determined on the basis of domain knowledge. However, even in the presence of domain knowledge, it can be far from obvious which complex representation should be used or which dissimilarity should be applied on the chosen representation. In this paper we present a framework that allows to combine different complex representations of a given learning problem and/or different dissimilarities defined on these representations. We build on ideas developed previously on metric learning for vectorial data. We demonstrate the utility of our method in domains in which the learning instances are represented as sets of vectors by learning how to combine different set distance measures.
关 键 词: 相异度函数; k近邻算法; 矢量数据
课程来源: 视频讲座网
最后编审: 2019-04-17:lxf
阅读次数: 61