Journal of Information Science · 2005 · 65 citations · 25 references
ComputingComputer ScienceInformation TechnologyData AnalyticsData ManagementData MiningFrequent Pattern MiningStreaming AlgorithmsData Stream MiningFrequent Itemset MiningIncremental Frequent Pattern MiningSliding Window AlgorithmsSliding Window AnalysisStream MiningStreaming Data Mining
Knowledge embedded in a data stream is likely to be changed as time goes by. Identifying the recent change of the knowledge quickly can provide valuable information for the analysis of the data stream. However, most mining algorithms over a data stream are not able to extract the recent change of knowledge in a data stream adaptively. This is because the obsolete information of old data elements which may be no longer useful or possibly invalid at present is regarded as being as important as that of recent data elements. This paper proposes a sliding window method that finds recently frequent itemsets over a transactional online data stream adaptively. The size of a sliding window defines the desired life-time of information in a newly generated transaction. Consequently, only recently generated transactions in the range of the window are considered to find the recently frequent itemsets of a data stream.
25
Fast algorithms for mining association rules
Rakesh Agrawal, Ramakrishnan Srikant · 1998 · 10.8K citations
Mining high-speed data streams
Pedro Domingos, Geoff Hulten · 2000 · 2.2K citations · Full text
Dynamic itemset counting and implication rules for market basket data
Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman et al. · 1997 · 2K citations
Mining time-changing data streams
Geoff Hulten, Laurie Spencer, Pedro Domingos · 2001 · 1.8K citations