Sciweavers

114 search results - page 12 / 23
» Mining Association Rules of Simple Conjunctive Queries
Sort
View
ICCS
2004
Springer
14 years 23 days ago
Iceberg Query Lattices for Datalog
In this paper we study two orthogonal extensions of the classical data mining problem of mining association rules, and show how they naturally interact. The first is the extension...
Gerd Stumme
KR
2004
Springer
14 years 22 days ago
Improving the Forward Chaining Algorithm for Conceptual Graphs Rules
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
Jean-François Baget
CIKM
2006
Springer
13 years 11 months ago
Multi-evidence, multi-criteria, lazy associative document classification
We present a novel approach for classifying documents that combines different pieces of evidence (e.g., textual features of documents, links, and citations) transparently, through...
Adriano Veloso, Wagner Meira Jr., Marco Cristo, Ma...
KDD
1995
ACM
99views Data Mining» more  KDD 1995»
13 years 11 months ago
Active Data Mining
We introduce an active data mining paradigm that combines the recent work in data mining with the rich literature on active database systems. In this paradigm, data is continuousl...
Rakesh Agrawal, Giuseppe Psaila
DAWAK
2003
Springer
14 years 18 days ago
Computing SQL Queries with Boolean Aggregates
We introduce a new method for optimization of SQL queries with nested subqueries. The method is based on the idea of Boolean aggregates, aggregates that compute the conjunction or ...
Antonio Badia