Sciweavers

912 search results - page 86 / 183
» Inductive Databases as Ranking
Sort
View
ICML
2005
IEEE
14 years 12 months ago
Learning the structure of Markov logic networks
Markov logic networks (MLNs) combine logic and probability by attaching weights to first-order clauses, and viewing these as templates for features of Markov networks. In this pap...
Stanley Kok, Pedro Domingos
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 11 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
VLDB
2004
ACM
120views Database» more  VLDB 2004»
14 years 4 months ago
Merging the Results of Approximate Match Operations
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
Sudipto Guha, Nick Koudas, Amit Marathe, Divesh Sr...
ICDE
2009
IEEE
131views Database» more  ICDE 2009»
15 years 27 days ago
Exploring a Few Good Tuples from Text Databases
Information extraction from text databases is a useful paradigm to populate relational tables and unlock the considerable value hidden in plain-text documents. However, information...
Alpa Jain, Divesh Srivastava
SIGMOD
2007
ACM
413views Database» more  SIGMOD 2007»
14 years 11 months ago
Effective keyword-based selection of relational databases
The wide popularity of free-and-easy keyword based searches over World Wide Web has fueled the demand for incorporating keyword-based search over structured databases. However, mo...
Bei Yu, Guoliang Li, Karen R. Sollins, Anthony K. ...