Sciweavers

696 search results - page 42 / 140
» Maximum Margin Ranking Algorithms for Information Retrieval
Sort
View
SIGIR
2005
ACM
14 years 1 months ago
Exploiting the hierarchical structure for link analysis
Link analysis algorithms have been extensively used in Web information retrieval. However, current link analysis algorithms generally work on a flat link graph, ignoring the hiera...
Gui-Rong Xue, Qiang Yang, Hua-Jun Zeng, Yong Yu, Z...
CIKM
2004
Springer
14 years 1 months ago
Node ranking in labeled directed graphs
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...
Krishna Prasad Chitrapura, Srinivas R. Kashyap
CIKM
2008
Springer
13 years 9 months ago
Efficient and effective link analysis with precomputed salsa maps
SALSA is a link-based ranking algorithm that takes the result set of a query as input, extends the set to include additional neighboring documents in the web graph, and performs a...
Marc Najork, Nick Craswell
ECIR
2011
Springer
12 years 11 months ago
Introducing the User-over-Ranking Hypothesis
The User-over-Ranking hypothesis states that rather the user herself than a web search engine’s ranking algorithm can help to improve retrieval performance. The means are longer ...
Benno Stein, Matthias Hagen
SMC
2010
IEEE
124views Control Systems» more  SMC 2010»
13 years 6 months ago
SoftFacts: A top-k retrieval engine for ontology mediated access to relational databases
—We outline SoftFacts, an ontology mediated top-k information retrieval system over relational databases. An ontology layer is used to define (in terms of a OWL-QL like Semantic...
Umberto Straccia