Sciweavers

1435 search results - page 11 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
CVPR
2004
IEEE
14 years 5 days ago
Diffeomorphic Matching of Distributions: A New Approach for Unlabelled Point-Sets and Sub-Manifolds Matching
In the paper, we study the problem of optimal matching of two generalized functions (distributions) via a diffeomorphic transformation of the ambient space. In the particular case...
Joan Glaunes, Alain Trouvé, Laurent Younes
ICML
2003
IEEE
14 years 9 months ago
The Set Covering Machine with Data-Dependent Half-Spaces
We examine the set covering machine when it uses data-dependent half-spaces for its set of features and bound its generalization error in terms of the number of training errors an...
Mario Marchand, Mohak Shah, John Shawe-Taylor, Mar...
IJSI
2008
156views more  IJSI 2008»
13 years 8 months ago
Co-Training by Committee: A Generalized Framework for Semi-Supervised Learning with Committees
Many data mining applications have a large amount of data but labeling data is often difficult, expensive, or time consuming, as it requires human experts for annotation. Semi-supe...
Mohamed Farouk Abdel Hady, Friedhelm Schwenker
CVPR
2006
IEEE
14 years 10 months ago
Semi-Supervised Classification Using Linear Neighborhood Propagation
We consider the general problem of learning from both labeled and unlabeled data. Given a set of data points, only a few of them are labeled, and the remaining points are unlabele...
Fei Wang, Changshui Zhang, Helen C. Shen, Jingdong...
MM
2006
ACM
113views Multimedia» more  MM 2006»
14 years 2 months ago
Transductive inference using multiple experts for brushwork annotation in paintings domain
Many recent studies perform annotation of paintings based on brushwork. In these studies the brushwork is modeled indirectly as part of the annotation of high-level artistic conce...
Yelizaveta Marchenko, Tat-Seng Chua, Ramesh Jain