2100 search results - page 73 / 420 » Learning to rank on graphs |
BMCBI
2008
14 years 10 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...
101
click to vote
MP
2006
14 years 9 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]...
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
Kernel learning plays an important role in many machine learning tasks. However, algorithms for learning a kernel matrix often scale poorly, with running times that are cubic in t...
112
click to vote
WIDM
2005
ACM
15 years 3 months ago
2005
ACM
Markov models have been widely used for modelling users' navigational behaviour in the Web graph, using the transitional probabilities between web pages, as recorded in the w...
BPM
2009
Springer
15 years 4 months ago
2009
Springer
We investigate the problem of ranking all process models in a repository according to their similarity with respect to a given process model. We focus specifically on the applicat...