2100 search results - page 198 / 420 » Learning to rank on graphs |
173
click to vote
EJC
2008
15 years 6 months ago
2008
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
157
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
160
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
We study the mining of interesting patterns in the presence of numerical attributes. Instead of the usual discretization methods, we propose the use of rank based measures to scor...
165
click to vote
ECIR
2009
Springer
16 years 3 months ago
2009
Springer
Many different ranking algorithms based on content and context have been used in web search engines to find pages based on a user query. Furthermore, to achieve better performance ...
158
click to vote
ICMCS
2008
IEEE
16 years 1 months ago
2008
IEEE
To exploit co-occurrence patterns among features and target semantics while keeping the simplicity of the keywordbased visual search, a novel reranking methods is proposed. The ap...