4972 search results - page 57 / 995 » Ranking on graph data |
105
click to vote
IDA
2005
Springer
15 years 5 months ago
2005
Springer
We consider the problem of learning a ranking function, that is a mapping from instances to rankings over a finite number of labels. Our learning method, referred to as ranking by...
102
click to vote
AI
2008
Springer
14 years 12 months ago
2008
Springer
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
SODA
2008
ACM
15 years 1 months ago
2008
ACM
In recent years there has been considerable interest in analyzing random graph models for the Web. We consider two such models - the Random Surfer model, introduced by Blum et al....
BMCBI
2008
14 years 12 months ago
2008
Background: Graph analysis algorithms such as PageRank and HITS have been successful in Web environments because they are able to extract important inter-document relationships fr...
113
click to vote
MP
2006
14 years 11 months ago
2006
Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]...