Sciweavers

912 search results - page 13 / 183
» Inductive Databases as Ranking
Sort
View
KDID
2003
119views Database» more  KDID 2003»
13 years 9 months ago
Generalized Version Space Trees
We introduce generalized version space trees, a novel data structure that serves as a condensed representation in inductive databases for graph mining. Generalized version space tr...
Ulrich Rückert, Stefan Kramer
WEBDB
2007
Springer
162views Database» more  WEBDB 2007»
14 years 1 months ago
Term Ranking for Clustering Web Search Results
Clustering web search engine results for ambiguous keyword searches poses unique challenges. First, we show that one cannot readily import the frequency based feature ranking to c...
Fatih Gelgi, Hasan Davulcu, Srinivas Vadrevu
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
14 years 9 months ago
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
Graham Cormode, Feifei Li, Ke Yi
ICDE
2008
IEEE
106views Database» more  ICDE 2008»
14 years 2 months ago
Weighted Boolean conditions for ranking
— Current database systems are tailored to efficiently evaluate Boolean expressions which are typically used as selection conditions to restrict the result set. We propose to ad...
Matthias Beck, Burkhard Freitag
SWAP
2008
13 years 9 months ago
A Note on the Evaluation of Inductive Concept Classification Procedures
Abstract. The limitations of deductive logic-based approaches at deriving operational knowledge from ontologies may be overcome by inductive (instancebased) methods, which are usua...
Claudia d'Amato, Nicola Fanizzi, Floriana Esposito