Sciweavers

8 search results - page 1 / 2
» Weighted Proximity Best-Joins for Information Retrieval
Sort
View
ICDE
2009
IEEE
120views Database» more  ICDE 2009»
14 years 6 months ago
Weighted Proximity Best-Joins for Information Retrieval
We consider the problem of efficiently computing weighted proximity best-joins over multiple lists, with applications in information retrieval and extraction. We are given a multi-...
AnHai Doan, Haixun Wang, Hao He, Jun Yang 0001, Ri...
TREC
2007
13 years 6 months ago
Interactive Retrieval Using Weights
Using the same interactive IR component as for TREC 2006, this submission probed the ability of a user without requisite domain knowledge to interactively set appropriate weights....
Jonathan Schuman, Sabine Bergler
IPM
2010
131views more  IPM 2010»
13 years 3 months ago
Facet-based opinion retrieval from blogs
The paper presents methods of retrieving blog posts containing opinions about an entity expressed in the query. The methods use a lexicon of subjective words and phrases compiled ...
Olga Vechtomova
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
13 years 9 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
GIS
2007
ACM
14 years 6 months ago
Proximity queries in large traffic networks
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...