376 search results - page 20 / 76 » Efficient Indexing Structures for Mining Frequent Patterns |
JCST
2008
13 years 8 months ago
2008
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
KDD
2004
ACM
14 years 9 months ago
2004
ACM
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
DAWAK
2006
Springer
14 years 5 days ago
2006
Springer
Recently, the data stream, which is an unbounded sequence of data elements generated at a rapid rate, provides a dynamic environment for collecting data sources. It is likely that ...
KDD
2005
ACM
14 years 9 months ago
2005
ACM
Regardless of the frequent patterns to discover, either the full frequent patterns or the condensed ones, either closed or maximal, the strategy always includes the traversal of t...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...