Sciweavers

352 search results - page 5 / 71
» Non-derivable itemset mining
Sort
View
KAIS
2006
164views more  KAIS 2006»
13 years 7 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 7 months ago
Dense itemsets
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
Heikki Mannila, Jouni K. Seppänen
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
14 years 7 months ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald
FIMI
2004
279views Data Mining» more  FIMI 2004»
13 years 8 months ago
DCI Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets
One of the main problems raising up in the frequent closed itemsets mining problem is the duplicate detection. In this paper we propose a general technique for promptly detecting ...
Claudio Lucchese, Salvatore Orlando, Raffaele Pere...
SAC
2004
ACM
14 years 27 days ago
Mining dependence rules by finding largest itemset support quota
In the paper a new data mining algorithm for finding the most interesting dependence rules is described. Dependence rules are derived from the itemsets with support significantly ...
Alexandr A. Savinov