Sciweavers

403 search results - page 16 / 81
» Frequent pattern mining with uncertain data
Sort
View
65
Voted
PAKDD
2005
ACM
100views Data Mining» more  PAKDD 2005»
15 years 4 months ago
Pushing Tougher Constraints in Frequent Pattern Mining
In this paper we extend the state-of-art of the constraints that can be pushed in a frequent pattern computation. We introduce a new class of tough constraints, namely Loose Anti-m...
Francesco Bonchi, Claudio Lucchese
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
15 years 11 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
15 years 4 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...
JISE
2008
108views more  JISE 2008»
14 years 11 months ago
Efficient Discovery of Frequent Continuities by Projected Window List Technology
Mining frequent patterns in databases is a fundamental and essential problem in data mining research. A continuity is a kind of causal relationship which describes a definite temp...
Kuo-Yu Huang, Chia-Hui Chang, Kuo-Zui Lin
104
Voted
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
15 years 11 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà