Sciweavers

180 search results - page 31 / 36
» Improved bounds on the sample complexity of learning
Sort
View
GRAPHICSINTERFACE
2007
13 years 9 months ago
Robust pixel classification for 3D modeling with structured light
Modeling 3D objects and scenes is an important part of computer graphics. One approach to modeling is projecting binary patterns onto the scene in order to obtain correspondences ...
Yi Xu, Daniel G. Aliaga
ICANN
2005
Springer
14 years 1 months ago
The LCCP for Optimizing Kernel Parameters for SVM
Abstract. Tuning hyper-parameters is a necessary step to improve learning algorithm performances. For Support Vector Machine classifiers, adjusting kernel parameters increases dra...
Sabri Boughorbel, Jean-Philippe Tarel, Nozha Bouje...
KDD
2009
ACM
230views Data Mining» more  KDD 2009»
14 years 8 months ago
Cross domain distribution adaptation via kernel mapping
When labeled examples are limited and difficult to obtain, transfer learning employs knowledge from a source domain to improve learning accuracy in the target domain. However, the...
ErHeng Zhong, Wei Fan, Jing Peng, Kun Zhang, Jiang...
SIGIR
2006
ACM
14 years 1 months ago
LDA-based document models for ad-hoc retrieval
Search algorithms incorporating some form of topic model have a long history in information retrieval. For example, cluster-based retrieval has been studied since the 60s and has ...
Xing Wei, W. Bruce Croft
MCS
2000
Springer
13 years 11 months ago
Combining Fisher Linear Discriminants for Dissimilarity Representations
Abstract Investigating a data set of the critical size makes a classification task difficult. Studying dissimilarity data refers to such a problem, since the number of samples equa...
Elzbieta Pekalska, Marina Skurichina, Robert P. W....