28 search results - page 1 / 6 » Efficient Incremental Mining of Top-K Frequent Closed Itemse... |
DIS
2007
Springer
13 years 8 months ago
2007
Springer
In this work we study the mining of top-K frequent closed itemsets, a recently proposed variant of the classical problem of mining frequent closed itemsets where the support thresh...
JCIT
2010
12 years 11 months ago
2010
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
IEAAIE
2009
Springer
13 years 11 months ago
2009
Springer
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
KDD
2006
ACM
14 years 4 months ago
2006
ACM
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
JIIS
2008
13 years 4 months ago
2008
In this paper, we study the incremental update of Frequent Closed Itemsets (FCIs) over a sliding window in a high-speed data stream. We propose the notion of semi-FCIs, which is to...