169 search results - page 1 / 34 » Mining Frequent Itemsets using Patricia Tries |
FIMI
2003
13 years 6 months ago
2003
We present a depth-first algorithm, PatriciaMine, that discovers all frequent itemsets in a dataset, for a given support threshold. The algorithm is main-memory based and employs...
ICDM
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper, we present the foundations for mining frequent tri-concepts, which extend the notion of closed itemsets to three-dimensional data to allow for mining folksonomies. ...
DMIN
2006
13 years 6 months ago
2006
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
DIS
2006
Springer
13 years 8 months ago
2006
Springer
The purpose of this paper is two-fold: First, we give efficient algorithms for answering itemset support queries for collections of itemsets from various representations of the fre...
KDD
2012
ACM
11 years 7 months ago
2012
ACM
In recent years, mining frequent itemsets over uncertain data has attracted much attention in the data mining community. Unlike the corresponding problem in deterministic data, th...