Sciweavers

358 search results - page 20 / 72
» Learning from labeled and unlabeled data on a directed graph
Sort
View
CVPR
2008
IEEE
16 years 1 months ago
Manifold learning using robust Graph Laplacian for interactive image search
Interactive image search or relevance feedback is the process which helps a user refining his query and finding difficult target categories. This consists in partially labeling a ...
Hichem Sahbi, Patrick Etyngier, Jean-Yves Audibert...
ICML
2008
IEEE
16 years 17 days ago
Graph transduction via alternating minimization
Graph transduction methods label input data by learning a classification function that is regularized to exhibit smoothness along a graph over labeled and unlabeled samples. In pr...
Jun Wang, Tony Jebara, Shih-Fu Chang
FGR
2008
IEEE
214views Biometrics» more  FGR 2008»
15 years 6 months ago
Normalized LDA for semi-supervised learning
Linear Discriminant Analysis (LDA) has been a popular method for feature extracting and face recognition. As a supervised method, it requires manually labeled samples for training...
Bin Fan, Zhen Lei, Stan Z. Li
IJON
2010
181views more  IJON 2010»
14 years 10 months ago
Active learning with extremely sparse labeled examples
An active learner usually assumes there are some labeled data available based on which a moderate classifier is learned and then examines unlabeled data to manually label the mos...
Shiliang Sun, David R. Hardoon
ICDM
2008
IEEE
107views Data Mining» more  ICDM 2008»
15 years 6 months ago
Graph-Based Iterative Hybrid Feature Selection
When the number of labeled examples is limited, traditional supervised feature selection techniques often fail due to sample selection bias or unrepresentative sample problem. To ...
ErHeng Zhong, Sihong Xie, Wei Fan, Jiangtao Ren, J...