912 search results - page 35 / 183 » Inductive Databases as Ranking |
SIGMOD
2007
ACM
14 years 10 months ago
2007
ACM
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...
ICDE
2008
IEEE
14 years 4 months ago
2008
IEEE
— This paper introduces a novel keyword searching paradigm in Relational Databases (DBs), where the result of a search is a ranked set of Object Summaries (OSs). An OS summarizes...
SDM
2010
SIAM
13 years 11 months ago
2010
SIAM
Many sorts of structured data are commonly stored in a multi-relational format of interrelated tables. Under this relational model, exploratory data analysis can be done by using ...
DEXAW
2010
IEEE
13 years 11 months ago
2010
IEEE
In many cases keywords from a restricted set of possible keywords have to be assigned to texts. A common way to find the best keywords is to rank terms occurring in the text accord...
CORR
2000
Springer
13 years 9 months ago
2000
Springer
When comparing inductive logic programming (ILP) and attribute-value learning techniques, there is a trade-off between expressive power and efficiency. Inductive logic programming ...