48 search results - page 3 / 10 » A Tree-based Approach for Efficiently Mining Approximate Fre... |
ICDM
2002
IEEE
13 years 10 months ago
2002
IEEE
Mining of frequent itemsets is a fundamental data mining task. Past research has proposed many efficient algorithms for the purpose. Recent work also highlighted the importance of...
JIIS
2007
13 years 4 months ago
2007
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...
KDD
2008
ACM
14 years 5 months ago
2008
ACM
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...
PAKDD
2010
ACM
13 years 7 months ago
2010
ACM
Mining frequent itemsets from transactional datasets is a well known problem with good algorithmic solutions. In the case of uncertain data, however, several new techniques have be...
KDD
2009
ACM
13 years 11 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...