Sciweavers

2100 search results - page 140 / 420
» Learning to rank on graphs
Sort
View
COLT
2004
Springer
15 years 12 months 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
ILP
1997
Springer
15 years 10 months ago
A Logical Framework for Graph Theoretical Decision Tree Learning
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
Peter Geibel, Fritz Wysotzki
ICML
2003
IEEE
16 years 7 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...
ICDM
2010
IEEE
122views Data Mining» more  ICDM 2010»
15 years 4 months ago
Learning Preferences with Millions of Parameters by Enforcing Sparsity
We study the retrieval task that ranks a set of objects for a given query in the pairwise preference learning framework. Recently researchers found out that raw features (e.g. word...
Xi Chen, Bing Bai, Yanjun Qi, Qihang Lin, Jaime G....
CVPR
2011
IEEE
14 years 10 months ago
Multi-label Learning with Incomplete Class Assignments
We consider a special type of multi-label learning where class assignments of training examples are incomplete. As an example, an instance whose true class assignment is (c1, c2, ...
Serhat Bucak, Rong Jin, Anil Jain