169 search results - page 10 / 34 » Mining Frequent Itemsets using Patricia Tries |
IDA
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
KDD
2008
ACM
14 years 7 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...
KAIS
2008
13 years 7 months ago
2008
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
CIDM
2007
IEEE
14 years 1 months ago
2007
IEEE
— The extension approach of frequent itemset mining can be applied to discover the relations among documents. Several schemes, i.e., n-gram, stemming, stopword removal and term w...
HIPC
2003
Springer
14 years 18 days ago
2003
Springer
Traditional methods for data mining typically make the assumption that data is centralized and static. This assumption is no longer tenable. Such methods waste computational and I/...