Database Support for Data Mining Applications: Discovering Knowledge with Inductive QueriesRosa Meo, Pier L. Lanzi, Mika Klemettinen Springer, 2004 M07 28 - 332 pages Data mining from traditional relational databases as well as from non-traditional ones such as semi-structured data, Web data, and scientific databases housing biological, linguistic, and sensor data has recently become a popular way of discovering hidden knowledge. This book on database support for data mining is developed to approaches exploiting the available database technology, declarative data mining, intelligent querying, and associated issues, such as optimization, indexing, query processing, languages, and constraints. Attention is also paid to the solution of data preprocessing problems, such as data cleaning, discretization, and sampling. The 16 reviewed full papers presented were carefully selected from various workshops and conferences to provide complete and competent coverage of the core issues. Some papers were developed within an EC funded project on discovering knowledge with inductive queries. |
From inside the book
Results 1-5 of 84
... mining, [10] is a comparative evaluation of three proposals (MSQL [43], DMQL [38], and MINE RULE [59]) in the light of the IDBs' requirements. In this paper, we focus on mining ... set Th(r,L,q) = {φ ∈L| q(r, φ) is true}. The predicate q ...
... set of primitives that might be supported by such languages. Furthermore, a language like MINE RULE enables to use various kinds of constraints on the desired rules (i.e., the relevant constraints on the itemsets are not explicit) and ...
... set is important. – Closed sets [65,12], δ-free sets [15,16], and disjoint-free sets [25] are condensed representations that have been designed as ε-adequate representations w.r.t. frequency queries, i.e., representations from which the ...
... mine the closed sets or even the disjoint-free sets, i.e., when the computation is intractable given the user-defined frequency threshold. Indeed, algorithms like Close [65] or Pascal [5] or H/Vlin-Ex [25] use special kinds of logical ...
... MINE RULE) in the logical inductive database theory [29]. Pattern views intensionally specify a set of patterns using an inductive query in MINE RULE. This is similar in spirit to a traditional relation view in a traditional database ...
Contents
1 | |
24 | |
Declarative Data Mining Using SQL3 | 52 |
Towards a Logic Query Language for Data Mining | 76 |
A Data Mining Query Language for Knowledge Discovery in | 95 |
Towards Query Evaluation in Inductive Databases Using Version Spaces | 117 |
The GUHA Method Data Preprocessing and Mining | 135 |
Constraint Based Mining of First Order Sequences in SeqLog | 154 |
Frequent Itemset Discovery with SQL Using Universal Quantification | 194 |
Deducing Bounds on the Support of Itemsets | 214 |
ModelIndependent Bounding of the Supports of Boolean Formulae | 234 |
Condensed Representations for Sets of Mining Queries | 250 |
Arnaud Giacometti Dominique Laurent Cheikh Talibouya Diop | 270 |
Evgueni N Smirnov Ida G SprinkhuizenKuyper H Japp van den Herik | 289 |
Kimmo Hätönen Mika Klemettinen | 304 |
Artur Bykowski Thomas Daurel Nicolas Méger Christophe Rigotti | 324 |