Modeling KDD Processes within the Inductive Database Framework
Lecture notes in computer sciencePublished 1 January 1999
Jean‐François Boulicaut, Mika Klemettinen, Heikki Mannila
Citations53
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This work formalizes this concept and shows how it can be used throughout the whole process of data mining due to the closure property of the framework, and shows that simple query languages can be defined using normal database terminology.
Abstract
One of the most challenging problems in data manipulation in the future is to be able to efficiently handle very large databases but also multiple induced properties or generalizations in that data. Popular examples of useful properties are association rules, and inclusion and functional dependencies. Our view of a possible approach for this task is to specify and query inductive databases, which are databases that in addition to data also contain intensionally defined generalizations about the data. We formalize this concept and show how it can be used throughout the whole process of data mining due to the closure property of the framework. We show that simple query languages can be defined using normal database terminology. We demonstrate the use of this framework to model typical data mining processes. It is then possible to perform various tasks on these descriptions like, e.g., optimizing the selection of interesting properties or comparing two processes.
Keywords
Computer Science
Mining association rules between sets of items in large databases
14,720 Citations1993Rakesh Agrawal, Tomasz Imieliński +1 more
An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
Dynamic itemset counting and implication rules for market basket data
1,954 Citations1997Sergey Brin, Rajeev Motwani +2 more
A new algorithm for finding large itemsets which uses fewer passes over the data than classic algorithms, and yet uses fewer candidate itemsets than methods based on sampling and a new way of generating “implication rules” which are normalized based on both the antecedent and the consequent.
Mining association rules with item constraints
769 Citations1997Ramakrishnan Srikant, Quoc Vu +1 more
This work considers the problem of integrating constraints that are Boolean expressions over the presence or absence of items into the association discovery algorithm and presents three integrated algorithms for mining association rules with item constraints and discusses their tradeoffs.
Exploratory mining and pruning optimizations of constrained associations rules
713 Citations1998Raymond T. Ng, Laks V. S. Lakshmanan +2 more
An architecture that opens up the black-box, and supports constraint-based, human-centered exploratory mining of associations, and introduces and analyzes two properties of constraints that are critical to pruning: anti-monotonicity and succinctness.
Communications of the ACMA database perspective on knowledge discovery
470 Citations1996Tomasz Imieliński, Heikki Mannila
The concept of data mining as a querying process and the first steps toward efficient development of knowledge discovery applications are discussed.
IEEE Transactions on Knowledge and Data EngineeringAn information theoretic approach to rule induction from databases
357 Citations1992Padhraic Smyth, R.M. Goodman
An algorithm for the induction of rules from examples is introduced, which is novel in the sense that it not only learns rules for a given concept, but it simultaneously learns rules relating multiple concepts.
A New SQL-like Operator for Mining Association Rules
295 Citations1996Rosa Meo, Giuseppe Psaila +1 more
This work proposes a unifying model that enables a uniform description of the problem of discovering association rules, and provides SQL-like operator, named MINE RULE, which is capable of expressing all the problems presented so far in the literature concerning the mining of association rules.
Lecture notes in computer scienceMining association rules in multiple relations
188 Citations1997Luc De Raedt, Luc De Raedt
The system Warmr is presented, which extends Apriori to mine association rules in multiple relations, and is applied to the natural language processing task of mining part-of-speech tagging rules in a large corpus of English.
Lecture notes in computer scienceMethods and problems in data mining
180 Citations1997Heikki Mannila
This work considers some methods used in data mining, concentrating on levelwise search for all frequently occurring patterns, and shows how this technique can be used in various applications.
Query flocks
159 Citations1998Dick Tsur, Jeffrey D. Ullman +5 more
The general idea, called “query flocks,” is a generate-and-test model for data-mining problems and is shown how the idea can be used either in a general-purpose mining system or in a next generation of conventional query optimizers.
ACM Transactions on Database SystemsOptimization techniques for queries with expensive methods
131 Citations1998Joseph M. Hellerstein
A query cost framework that incorporates both selectivity and cost estimates for selections is carefully defined, and an algorithm called Predicate Migration is developed, and it is proved that it produces optimal plans for queries with expensive methods.
Journal of Network and Systems ManagementRule Discovery in Telecommunication Alarm Data
83 Citations1999Mika Klemettinen, Heikki Mannila +1 more
A novel partial solution to the task of knowledge acquisition for correlation systems is described and a method and a tool for the discovery of recurrent patterns ofalarms in databases, which can be used in the construction of real-time alarm correlation systems are presented.
Knowledge Discovery and Data MiningDataMine : application programming interface and query language for database mining
70 Citations1996Tomasz Imieliński, Aashu Virmani +1 more
The goal of the DataMine and the work is to make the next step in the development of DBMS and provide much needed support for the rule discovery applications.
Lecture notes in computer scienceQuerying inductive databases: A case study on the MINE RULE operator
36 Citations1998Jean‐François Boulicaut, Mika Klemettinen +1 more
A comprehensive framework in which all these steps of knowledge discovery in databases can be carried out by means of queries over an inductive database, and considers the research on the MINE RULE operator by Meo, Psaila and Ceri.
Information Technology and ManagementA KDD framework to support database audit
6 Citations2000Jean‐François Boulicaut
This paper considers the DREAM relational database reverse engineering method and DREAM heuristics are revisited within this new setting and formalization enables us to identify an important subtask to support database audit as well as a generic algorithm.