2100 search results - page 23 / 420 » Learning to rank on graphs |
148
Voted
WAW
2010
Springer
14 years 11 months ago
2010
Springer
We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the per...
115
Voted
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
This paper presents an approach to automatically optimize the retrieval quality of ranking functions. Taking a Swarm Intelligence perspective, we present a novel method, SwarmRank...
119
click to vote
WSDM
2009
ACM
15 years 8 months ago
2009
ACM
In this paper, we attempt to improve the effectiveness and the efficiency of query-dependent link-based ranking algorithms such as HITS, MAX and SALSA. All these ranking algorith...
132
Voted
AINA
2004
IEEE
15 years 5 months ago
2004
IEEE
Efficient computing the PageRank scores for a large web graph is actually one of the hot issues in Web-IR community. Recent researches propose to accelerate the computation, both ...
119
Voted
WAW
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...