Sciweavers

141 search results - page 1 / 29
» Regular labelings and geometric structures
Sort
View
CCCG
2010
13 years 8 months ago
Regular labelings and geometric structures
Three types of geometric structure--grid triangulations, rectangular subdivisions, and orthogonal polyhedra-can each be described combinatorially by a regular labeling: an assignm...
David Eppstein
ICPR
2008
IEEE
14 years 1 months ago
Semi-supervised discriminant analysis based on UDP regularization
We propose a semi-supervised learning algorithm for discriminant analysis, which uses the geometric structure of both labeled and unlabeled samples and perform a manifold regulari...
Huining Qiu, Jian-Huang Lai, Jian Huang, Yu Chen
TIP
2010
155views more  TIP 2010»
13 years 5 months ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
Xiaofei He
JMLR
2006
186views more  JMLR 2006»
13 years 7 months ago
Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples
We propose a family of learning algorithms based on a new form of regularization that allows us to exploit the geometry of the marginal distribution. We focus on a semi-supervised...
Mikhail Belkin, Partha Niyogi, Vikas Sindhwani
AAAI
2010
13 years 8 months ago
G-Optimal Design with Laplacian Regularization
In many real world applications, labeled data are usually expensive to get, while there may be a large amount of unlabeled data. To reduce the labeling cost, active learning attem...
Chun Chen, Zhengguang Chen, Jiajun Bu, Can Wang, L...