Sciweavers

1217 search results - page 31 / 244
» On compressing frequent patterns
Sort
View
126
Voted
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
15 years 9 months ago
Discovering Frequent Arrangements of Temporal Intervals
In this paper we study a new problem in temporal pattern mining: discovering frequent arrangements of temporal intervals. We assume that the database consists of sequences of even...
Panagiotis Papapetrou, George Kollios, Stan Sclaro...
172
Voted
JIIS
2007
150views more  JIIS 2007»
15 years 3 months ago
Towards a new approach for mining frequent itemsets on data stream
Mining frequent patterns on streaming data is a new challenging problem for the data mining community since data arrives sequentially in the form of continuous rapid streams. In t...
Chedy Raïssi, Pascal Poncelet, Maguelonne Tei...
121
Voted
ICDM
2005
IEEE
157views Data Mining» more  ICDM 2005»
15 years 9 months ago
Blocking Anonymity Threats Raised by Frequent Itemset Mining
In this paper we study when the disclosure of data mining results represents, per se, a threat to the anonymity of the individuals recorded in the analyzed database. The novelty o...
Maurizio Atzori, Francesco Bonchi, Fosca Giannotti...
140
Voted
VLDB
2000
ACM
130views Database» more  VLDB 2000»
15 years 7 months ago
Mining Frequent Itemsets Using Support Constraints
Interesting patterns often occur at varied levels of support. The classic association mining based on a uniform minimum support, such as Apriori, either misses interesting pattern...
Ke Wang, Yu He, Jiawei Han
114
Voted
FIMI
2003
120views Data Mining» more  FIMI 2003»
15 years 5 months ago
MAFIA: A Performance Study of Mining Maximal Frequent Itemsets
We present a performance study of the MAFIA algorithm for mining maximal frequent itemsets from a transactional database. In a thorough experimental analysis, we isolate the effec...
Douglas Burdick, Manuel Calimlim, Jason Flannick, ...