|
Title
|
|
|
|
Axiomatization of frequent sets
| |
|
Author
|
|
|
|
| |
|
Abstract
|
|
|
|
| In data mining association rules are very popular. Most of the algorithms in the literature for finding association rules start by searching for frequent itemsets. The itemset mining algorithms typically interleave brute force counting of frequencies with a meta-phase for pruning parts of the search space. The knowledge acquired in the counting phases can be represented by frequent set expressions. A frequent set expression is a pair containing an itemset and a frequency indicating that the frequency of that itemset is greater than or equal to the given frequency. A system of frequent sets is a collection of such expressions. We give an axiomatization for these systems. This axiomatization characterizes complete systems. A system is complete when it explicitly contains all information that it logically implies. Every system of frequent sets has a unique completion. The completion of a system actually represents the knowledge that maximally can be derived in the meta-phase. |
| |
|
Language
|
|
|
|
English
| |
|
Source (journal)
|
|
|
|
Lecture notes in computer science. - Berlin, 1973, currens
| |
|
Publication
|
|
|
|
Berlin
:
Springer-verlag berlin
,
2001
| |
|
ISSN
|
|
|
|
0302-9743
[print]
1611-3349
[online]
| |
|
Volume/pages
|
|
|
|
1973
(2001)
, p. 204-218
| |
|
ISI
|
|
|
|
000171312300014
| |
|