|
Title
|
|
|
|
Non-derivable itemset mining
|
|
|
Author
|
|
|
|
|
|
|
Abstract
|
|
|
|
| All frequent itemset mining algorithms rely heavily on the monotonicity principle for pruning. This principle allows for excluding candidate itemsets from the expensive counting phase. In this paper, we present sound and complete deduction rules to derive bounds on the support of an itemset. Based on these deduction rules, we construct a condensed representation of all frequent itemsets, by removing those itemsets for which the support can be derived, resulting in the so called Non-Derivable Itemsets (NDI) representation. We also present connections between our proposal and recent other proposals for condensed representations of frequent itemsets. Experiments on real-life datasets show the effectiveness of the NDI representation, making the search for frequent non-derivable itemsets a useful and tractable alternative to mining all frequent itemsets. |
|
|
|
Language
|
|
|
|
English
|
|
|
Source (journal)
|
|
|
|
Data mining and knowledge discovery. - Boston, Mass., 1997, currens
|
|
|
Publication
|
|
|
|
Boston, Mass.
:
2007
|
|
|
ISSN
|
|
|
|
1384-5810
[print]
1573-756X
[online]
|
|
|
DOI
|
|
|
|
10.1007/S10618-006-0054-6
|
|
|
Volume/pages
|
|
|
|
14
:1
(2007)
, p. 171-206
|
|
|
ISI
|
|
|
|
000244483000006
|
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|
|
Full text (publisher's version - intranet only)
|
|
|
|
|
|