912 search results - page 30 / 183 » Inductive Databases as Ranking |
101
Voted
CIKM
2004
Springer
15 years 6 months ago
2004
Springer
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...
136
Voted
AUSAI
2010
Springer
14 years 11 months ago
2010
Springer
Database normalization is a central part of database design in which we re-organise the data stored so as to progressively ensure that as few anomalies occur as possible upon inser...
118
Voted
DATAMINE
1999
15 years 12 days ago
1999
Abstract. One of the de ning challenges for the KDD research community is to enable inductive learning algorithms to mine very large databases. This paper summarizes, categorizes, ...
95
Voted
PODS
2008
ACM
16 years 26 days ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
106
click to vote
SIGMOD
2011
ACM
14 years 3 months ago
2011
ACM
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...