627 search results - page 108 / 126 » Efficient Top-k Query Evaluation on Probabilistic Data |
100
click to vote
WSDM
2012
ACM
13 years 5 months ago
2012
ACM
This paper presents a novel opinion mining research problem, which is called Contrastive Opinion Modeling (COM). Given any query topic and a set of text collections from multiple ...
88
Voted
SDM
2008
SIAM
14 years 11 months ago
2008
SIAM
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
The paper proposes identifying relevant information sources from the history of combined searching and browsing behavior of many Web users. While it has been previously shown that...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Automatically segmenting unstructured text strings into structured records is necessary for importing the information contained in legacy sources and text collections into a data ...
205
click to vote
VLDB
2002
ACM
15 years 9 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...