QQ客服 官方微博 反馈留言

	On learning with dissimilarity functions
	Wang, Liwei ; Yang, Cheng ; Feng, Jufu
	2007
英文摘要	We study the problem of learning a classification task in which only a dissimilarity function of the objects is accessible. That is, data are not represented by feature vectors but in terms of their pairwise dissimilarities. We investigate the sufficient conditions for dissimilarity functions to allow building accurate classifiers. Our results have the advantages that they apply to unbounded dissimilarities and are invariant to order-preserving transformations. The theory immediately suggests a learning paradigm: construct an ensemble of decision stumps each depends on a pair of examples, then find a convex combination of them to achieve a large margin. We next develop a practical algorithm called Dissimilarity based Boosting (DBoost) for learning with dissimilarity functions under the theoretical guidance. Experimental results demonstrate that DBoost compares favorably with several existing approaches on a variety of databases and under different conditions.; EI; 0
语种	英语
DOI标识	10.1145/1273496.1273621
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/295120]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Wang, Liwei,Yang, Cheng,Feng, Jufu. On learning with dissimilarity functions. 2007-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。