Theory and Algorithm for Learning with Dissimilarity Functions

Theory and Algorithm for Learning with Dissimilarity Functions
复制标题

相异函数学习的理论和算法

DOI:
10.1162/neco.2008.08-06-805
复制
发表时间:
2009-05
期刊:
影响因子:
2.9
通讯作者:
Sugiyama, Masashi
Sugiyama, Masashi
中科院分区:
计算机科学4区
文献类型:
--
作者:
Wang, Liwei;Hatano, Kohei;Feng Jufu;Yang, Cheng;Sugiyama, Masashi

文献摘要

参考文献

相似文献

我们研究了当对象之间只有相异函数可达时的分类问题。也就是说,数据样本不是由特征向量表示的,而是根据它们的成对相异度来表示的。为了构造准确的分类器,我们建立了相异函数的充分条件。该理论立即提出了一种学习范式:构建一个简单量词的集合,每个简单量词依赖于一对例子;然后找到它们的一个凸集组合,以实现较大的差距。接下来,我们开发了一种实用的算法,称为基于相异函数的Boosting(DBoost),用于在理论指导下使用相异函数进行学习。在不同的数据库上的实验表明,DBoost算法对于实际中广泛使用的几种不同度量是有前景的。
We study the problem of classification when only a dissimilarity function between objects is accessible. That is, data samples are represented not by feature vectors but in terms of their pairwise dissimilarities. We establish sufficient conditions for dissimilarity functions to allow building accurate classifiers. The theory immediately suggests a learning paradigm: construct an ensemble of simple classifiers, each depending on a pair of examples; then find a convex combination of them to achieve a large margin. We next develop a practical algorithm referred to as dissimilarity-based boosting (DBoost) for learning with dissimilarity functions under theoretical guidance. Experiments on a variety of databases demonstrate that the DBoost algorithm is promising for several dissimilarity measures widely used in practice.
DOI: 10.1016/c2009-0-27872-x
发表时间: 1972
期刊:
影响因子: --
作者:
H. Shimodaira;Iain Murray
通讯作者: Iain Murray
DOI: 10.1002/0470854774.ch1
发表时间: 2006
期刊: --
影响因子: --
作者:
P. Pudil;P. Somol;M. Haindl
通讯作者: P. Pudil;P. Somol;M. Haindl
DOI: 10.1007/978-3-540-30215-5_16
发表时间: 2004-10
期刊: --
影响因子: --
作者:
Maria-Florina Balcan;Avrim Blum;S. Vempala
通讯作者: Maria-Florina Balcan;Avrim Blum;S. Vempala
DOI: 10.1023/a:1007614523901
发表时间: 1999-12-01
期刊: MACHINE LEARNING
影响因子: 7.5
作者:
Schapire, RE;Singer, Y
通讯作者: Singer, Y
DOI: 10.1007/s10994-006-7550-1
发表时间: 2006-10
期刊: Machine Learning
影响因子: 7.5
作者:
Maria-Florina Balcan;Avrim Blum;S. Vempala
通讯作者: Maria-Florina Balcan;Avrim Blum;S. Vempala