Sciweavers

586 search results - page 83 / 118
» Ranking queries on uncertain data
Sort
View
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
14 years 2 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
KES
2004
Springer
14 years 1 months ago
Multidimensional Visualization and Navigation in Search Results
Abstract. Search engines traditionally index unstructured text and return ranked lists of documents that match a given query. As search engines functionally move in the direction o...
Will Archer Arentz, Aleksander Øhrn
WSDM
2009
ACM
117views Data Mining» more  WSDM 2009»
14 years 2 months ago
Query by document
We are experiencing an unprecedented increase of content contributed by users in forums such as blogs, social networking sites and microblogging services. Such abundance of conten...
Yin Yang, Nilesh Bansal, Wisam Dakka, Panagiotis G...
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
13 years 11 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
PAKDD
2010
ACM
167views Data Mining» more  PAKDD 2010»
13 years 11 months ago
Resource-Bounded Information Extraction: Acquiring Missing Feature Values on Demand
We present a general framework for the task of extracting specific information “on demand” from a large corpus such as the Web under resource-constraints. Given a database wit...
Pallika Kanani, Andrew McCallum, Shaohan Hu