Sciweavers

912 search results - page 30 / 183
» Inductive Databases as Ranking
Sort
View
CIKM
2004
Springer
14 years 3 months ago
Node ranking in labeled directed graphs
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 ...
Krishna Prasad Chitrapura, Srinivas R. Kashyap
AUSAI
2010
Springer
13 years 9 months ago
Database Normalization as a By-product of Minimum Message Length Inference
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...
David L. Dowe, Nayyar Abbas Zaidi
DATAMINE
1999
108views more  DATAMINE 1999»
13 years 9 months ago
A Survey of Methods for Scaling Up Inductive Algorithms
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, ...
Foster J. Provost, Venkateswarlu Kolluri
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 10 months ago
Evaluating rank joins with optimal cost
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...
Karl Schnaitter, Neoklis Polyzotis
33
Voted
SIGMOD
2011
ACM
219views Database» more  SIGMOD 2011»
13 years 23 days ago
Context-sensitive ranking for document retrieval
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...
Liang Jeff Chen, Yannis Papakonstantinou