Sciweavers

327 search results - page 27 / 66
» A Spectral Approach to Learning Structural Variations in Gra...
Sort
View
CVPR
2010
IEEE
14 years 4 months ago
Unified Graph Matching in Euclidean Spaces
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...
Julian McAuley, Teofilo de Campos, Tiberio Caetano
ICCV
2005
IEEE
14 years 9 months ago
An Ensemble Prior of Image Structure for Cross-Modal Inference
In cross-modal inference, we estimate complete fields from noisy and missing observations of one sensory modality using structure found in another sensory modality. This inference...
S. Ravela, Antonio B. Torralba, William T. Freeman
PKDD
2009
Springer
175views Data Mining» more  PKDD 2009»
14 years 2 months ago
Latent Dirichlet Bayesian Co-Clustering
Co-clustering has emerged as an important technique for mining contingency data matrices. However, almost all existing coclustering algorithms are hard partitioning, assigning each...
Pu Wang, Carlotta Domeniconi, Kathryn B. Laskey
ICML
2004
IEEE
14 years 8 months ago
Semi-supervised learning using randomized mincuts
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
Avrim Blum, John D. Lafferty, Mugizi Robert Rweban...
COLT
2004
Springer
14 years 27 days ago
Regularization and Semi-supervised Learning on Large Graphs
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
Mikhail Belkin, Irina Matveeva, Partha Niyogi