Sciweavers

2033 search results - page 20 / 407
» Ranking on Data Manifolds
Sort
View
ISBI
2008
IEEE
14 years 1 months ago
On the non-uniform complexity of brain connectivity
A stratification and manifold learning approach for analyzing High Angular Resolution Diffusion Imaging (HARDI) data is introduced in this paper. HARDI data provides highdimensio...
Gloria Haro, Christophe Lenglet, Guillermo Sapiro,...
ICPR
2006
IEEE
14 years 8 months ago
Graph-based transformation manifolds for invariant pattern recognition with kernel methods
We present here an approach for applying the technique of modeling data transformation manifolds for invariant learning with kernel methods. The approach is based on building a ke...
Alexei Pozdnoukhov, Samy Bengio
PAMI
2008
139views more  PAMI 2008»
13 years 7 months ago
A Fast Algorithm for Learning a Ranking Function from Large-Scale Data Sets
We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approxim...
Vikas C. Raykar, Ramani Duraiswami, Balaji Krishna...
MM
2009
ACM
187views Multimedia» more  MM 2009»
14 years 5 days ago
Convex experimental design using manifold structure for image retrieval
Content Based Image Retrieval (CBIR) has become one of the most active research areas in computer science. Relevance feedback is often used in CBIR systems to bridge the semantic ...
Lijun Zhang, Chun Chen, Wei Chen, Jiajun Bu, Deng ...
ICML
2006
IEEE
14 years 8 months ago
Ranking on graph data
In ranking, one is given examples of order relationships among objects, and the goal is to learn from these examples a real-valued ranking function that induces a ranking or order...
Shivani Agarwal