Sciweavers

385 search results - page 33 / 77
» Probabilistic ranking over relations
Sort
View
WWW
2010
ACM
14 years 2 months ago
Visualizing differences in web search algorithms using the expected weighted hoeffding distance
We introduce a new dissimilarity function for ranked lists, the expected weighted Hoeffding distance, that has several advantages over current dissimilarity measures for ranked s...
Mingxuan Sun, Guy Lebanon, Kevyn Collins-Thompson
PVLDB
2010
112views more  PVLDB 2010»
13 years 6 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...
EDBT
2010
ACM
177views Database» more  EDBT 2010»
14 years 2 months ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu
PKDD
2004
Springer
205views Data Mining» more  PKDD 2004»
14 years 1 months ago
Breaking Through the Syntax Barrier: Searching with Entities and Relations
The next wave in search technology will be driven by the identification, extraction, and exploitation of real-world entities represented in unstructured textual sources. Search sy...
Soumen Chakrabarti
AMR
2006
Springer
96views Multimedia» more  AMR 2006»
13 years 11 months ago
Learning to Retrieve Images from Text Queries with a Discriminative Model
This work presents a discriminative model for the retrieval of pictures from text queries. The core idea of this approach is to minimize a loss directly related to the retrieval pe...
David Grangier, Florent Monay, Samy Bengio