Many critical applications, like intrusion detection or stock market analysis, require a nearly immediate result based on a continuous and infinite stream of data. In most cases finding an exact solution is not compatible with limited availability of resources and real time constraints, but an approximation of the exact result is enough for most purposes. This paper introduces a new algorithm for approximate mining of frequent itemsets from streams of transactions using a limited amount of memory. The proposed algorithm is based on the computation of frequent itemsets in recent data and an effective method for inferring the global support of previously infrequent itemsets. Both upper and lower bounds on the support of each pattern found are returned along with the interpolated support. An extensive experimental evaluation shows that APstream, the proposed algorithm, yields a good approximation of the exact global result considering both the set of patterns found and their supports.
|Data di pubblicazione:||2007|
|Titolo:||Approximate Mining of Frequent Patterns on Streams|
|Rivista:||INTELLIGENT DATA ANALYSIS|
|Appare nelle tipologie:||2.1 Articolo su rivista |
File in questo prodotto:
|5.pdf||Documento in Post-print||Accesso chiuso-personale||Riservato|