Sciweavers

300 search results - page 33 / 60
» Kernels for Generalized Multiple-Instance Learning
Sort
View
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 7 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang
MM
2005
ACM
134views Multimedia» more  MM 2005»
14 years 2 months ago
Formulating context-dependent similarity functions
Tasks of information retrieval depend on a good distance function for measuring similarity between data instances. The most effective distance function must be formulated in a con...
Gang Wu, Edward Y. Chang, Navneet Panda
ECML
2004
Springer
14 years 1 months ago
Using String Kernels to Identify Famous Performers from Their Playing Style
Abstract. In this paper we show a novel application of string kernels: that is to the problem of recognising famous pianists from their style of playing. The characterstics of perf...
Craig Saunders, David R. Hardoon, John Shawe-Taylo...
WWW
2007
ACM
14 years 9 months ago
A kernel based structure matching for web services search
This paper describes a kernel based Web Services (abbreviated as service) matching mechanism for service discovery and integration. The matching mechanism tries to exploit the lat...
Yu Jianjun, Guo Shengmin, Su Hao, Zhang Hui, Xu Ke
COMPGEOM
2011
ACM
13 years 1 days ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...