Sciweavers

116 search results - page 2 / 24
» On Computing Condensed Frequent Pattern Bases
Sort
View
DIS
2004
Springer
13 years 9 months ago
An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases
: The class of closed patterns is a well known condensed representations of frequent patterns, and have recently attracted considerable interest. In this paper, we propose an effic...
Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Ari...
KDID
2004
134views Database» more  KDID 2004»
13 years 7 months ago
Theoretical Bounds on the Size of Condensed Representations
Abstract. Recent studies demonstrate the usefulness of condensed representations as a semantic compression technique for the frequent itemsets. Especially in inductive databases, c...
Nele Dexters, Toon Calders
DATAMINE
2008
89views more  DATAMINE 2008»
13 years 5 months ago
Mining conjunctive sequential patterns
Abstract. In this paper we aim at extending the non-derivable condensed representation in frequent itemset mining to sequential pattern mining. We start by showing a negative examp...
Chedy Raïssi, Toon Calders, Pascal Poncelet
IEAAIE
2009
Springer
14 years 3 days ago
An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
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...
Show-Jane Yen, Yue-Shi Lee, Cheng-Wei Wu, Chin-Lin...
SAC
2004
ACM
13 years 11 months ago
SQL based frequent pattern mining without candidate generation
Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist