Sciweavers

65 search results - page 6 / 13
» Learning a Bi-Stochastic Data Similarity Matrix
Sort
View
CVPR
2008
IEEE
14 years 7 days ago
Fast kernel learning for spatial pyramid matching
Spatial pyramid matching (SPM) is a simple yet effective approach to compute similarity between images. Similarity kernels at different regions and scales are usually fused by som...
Junfeng He, Shih-Fu Chang, Lexing Xie
SDM
2011
SIAM
183views Data Mining» more  SDM 2011»
12 years 8 months ago
Nonparametric Bayesian Co-clustering Ensembles
A nonparametric Bayesian approach to co-clustering ensembles is presented. Similar to clustering ensembles, coclustering ensembles combine various base co-clustering results to ob...
Pu Wang, Kathryn B. Laskey, Carlotta Domeniconi, M...
ISBI
2011
IEEE
12 years 9 months ago
Sparse Riemannian manifold clustering for HARDI segmentation
We address the problem of segmenting high angular resolution diffusion images of the brain into cerebral regions corresponding to distinct white matter fiber bundles. We cast thi...
Hasan Ertan Çetingül, René Vida...
CORR
2012
Springer
183views Education» more  CORR 2012»
12 years 1 months ago
Learning Determinantal Point Processes
Determinantal point processes (DPPs), which arise in random matrix theory and quantum physics, are natural models for subset selection problems where diversity is preferred. Among...
Alex Kulesza, Ben Taskar
ICML
2003
IEEE
14 years 6 months ago
Learning Distance Functions using Equivalence Relations
We address the problem of learning distance metrics using side-information in the form of groups of "similar" points. We propose to use the RCA algorithm, which is a sim...
Aharon Bar-Hillel, Tomer Hertz, Noam Shental, Daph...