Sciweavers

1088 search results - page 61 / 218
» Probabilistic query expansion using query logs
Sort
View
AAAI
2007
14 years 18 days ago
Mining Web Query Hierarchies from Clickthrough Data
In this paper, we propose to mine query hierarchies from clickthrough data, which is within the larger area of automatic acquisition of knowledge from the Web. When a user submits...
Dou Shen, Min Qin, Weizhu Chen, Qiang Yang, Zheng ...
ICDE
2008
IEEE
135views Database» more  ICDE 2008»
14 years 11 months ago
Online Filtering, Smoothing and Probabilistic Modeling of Streaming data
In this paper, we address the problem of extending a relational database system to facilitate efficient real-time application of dynamic probabilistic models to streaming data. he ...
Bhargav Kanagal, Amol Deshpande
CCCG
2008
13 years 11 months ago
Smallest enclosing circle centered on a query line segment
Given a set of n points P = {p1, p2, . . . , pn} in the plane, we show how to preprocess P such that for any query line segment L we can report in O(log n) time the smallest enclo...
Prosenjit Bose, Stefan Langerman, Sasanka Roy
DEXAW
1999
IEEE
168views Database» more  DEXAW 1999»
14 years 2 months ago
Using the Distance Distribution for Approximate Similarity Queries in High-Dimensional Metric Spaces
We investigate the problem of approximate similarity (nearest neighbor) search in high-dimensional metric spaces, and describe how the distance distribution of the query object ca...
Paolo Ciaccia, Marco Patella
PVLDB
2010
112views more  PVLDB 2010»
13 years 8 months ago
Querying Probabilistic Information Extraction
Recently, there has been increasing interest in extending relational query processing to include data obtained from unstructured sources. A common approach is to use stand-alone I...
Daisy Zhe Wang, Michael J. Franklin, Minos N. Garo...