Sciweavers

99 search results - page 11 / 20
» Fast query expansion using approximations of relevance model...
Sort
View
92
Voted
GPC
2010
Springer
15 years 1 months ago
A Focused Crawler with Ontology-Supported Website Models for Information Agents
This paper advocated the use of ontology-supported website models to provide a semantic level solution for an information agent so that it can provide fast, precise, and stable que...
Sheng-Yuan Yang
ECIR
2007
Springer
15 years 1 months ago
Enhancing Expert Search Through Query Modeling
An expert finding is a very common task among enterprise search activities, while its usual retrieval performance is far from the quality of the Web search. Query modeling helps t...
Pavel Serdyukov, Sergey Chernov, Wolfgang Nejdl
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
15 years 5 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
77
Voted
HT
2005
ACM
15 years 5 months ago
Queries as anchors: selection by association
This paper introduces a new method for linking the world view of the search engine user community with that of the search engine itself. This new method is based on collecting and...
Einat Amitay, Adam Darlow, David Konopnicki, Uri W...
95
Voted
PKDD
2010
Springer
183views Data Mining» more  PKDD 2010»
14 years 10 months ago
Fast Active Exploration for Link-Based Preference Learning Using Gaussian Processes
Abstract. In preference learning, the algorithm observes pairwise relative judgments (preference) between items as training data for learning an ordering of all items. This is an i...
Zhao Xu, Kristian Kersting, Thorsten Joachims