124 search results - page 1 / 25 » Quantitative evaluation of approximate frequent pattern mini... |
KDD
2008
ACM
14 years 11 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...
ICDE
2007
IEEE
15 years 6 days ago
2007
IEEE
Extensive research for frequent-pattern mining in the past decade has brought forth a number of pattern mining algorithms that are both effective and efficient. However, the exist...
IDA
2007
Springer
13 years 10 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...
ICDM
2008
IEEE
14 years 5 months ago
2008
IEEE
In this paper we consider the problem of discovering frequent temporal patterns in a database of temporal sequences, where a temporal sequence is a set of items with associated da...
ICDM
2009
IEEE
13 years 8 months ago
2009
IEEE
In this paper, we focus on a single graph whose vertices contain a set of quantitative attributes. Several networks can be naturally represented in this complex graph. An example i...