A New SQL-like Operator for Mining Association Rules
Rosa Meo, Giuseppe Psaila, Stefano Ceri · 1996
Data mining evolved as a collection of applicative problems and efficient solution algorithms relative to rather peculiar problems, all focused on the discovery of relevant information hidden in databases of huge dimensions. In particular, one of the most investigated topics is the discovery of association rules. This work proposes a unifying model that enables a uniform description of the problem of discovering association rules. The model 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. We demonstrate the expressive power of the new operator by means of several examples, some of which are classical, while some others are fully original and correspond to novel and unusual applications. We also present the operational semantics of the operator by means of an extended relational algebra. 1 Introduction Data Mining is a novel research area that develops tech- Pe...
Cited by 292 works.
Authors
References
- Mining association rules between sets of items in large databases
- Fast Algorithms for Mining Association Rules in Large Databases
- Mining sequential patterns
- An Interval Classifier for Database Mining Applications
- Efficient similarity search in sequence databases
- An effective hash-based algorithm for mining association rules
- Mining generalized association rules
- Principles of database and knowledge-base systems, Vol. I
- Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
- Discovery of Multiple-Level Association Rules from Large Databases