Sciweavers

114 search results - page 2 / 23
» Mining Association Rules of Simple Conjunctive Queries
Sort
View
CORR
2004
Springer
115views Education» more  CORR 2004»
13 years 5 months ago
An Algorithm for Quasi-Associative and Quasi-Markovian Rules of Combination in Information Fusion
: In this paper one proposes a simple algorithm of combining the fusion rules, those rules which first use the conjunctive rule and then the transfer of conflicting mass to the non...
Florentin Smarandache, Jean Dezert
ADVIS
2004
Springer
13 years 10 months ago
Incremental Association Rule Mining Using Materialized Data Mining Views
Data mining is an interactive and iterative process. Users issue series of similar queries until they receive satisfying results, yet currently available data mining systems do not...
Mikolaj Morzy, Tadeusz Morzy, Zbyszko Króli...
DAWAK
2010
Springer
13 years 6 months ago
Discovery and Application of Functional Dependencies in Conjunctive Query Mining
Abstract. We present an algorithm for mining frequent queries in arbitrary relational databases, over which functional dependencies are assumed. Building upon previous results, we ...
Bart Goethals, Dominique Laurent, Wim Le Page
DBPL
2001
Springer
118views Database» more  DBPL 2001»
13 years 9 months ago
On Monotone Data Mining Languages
Abstract. We present a simple Data Mining Logic (DML) that can express common data mining tasks, like “Find Boolean association rules” or “Find inclusion dependencies.” At ...
Toon Calders, Jef Wijsen
PAKDD
2004
ACM
94views Data Mining» more  PAKDD 2004»
13 years 10 months ago
Towards Optimizing Conjunctive Inductive Queries
Inductive queries are queries to an inductive database that generate a set of patterns in a data mining context. Inductive querying poses new challenges to database and data mining...
Johannes Fischer, Luc De Raedt