TOPSIL-Miner: An efficient algorithm for mining top-K significant itemsets over data streams

Knowledge and Information Systems

Volumn 23, Issue 2, 2010, Pages 225-242

  Yang, Bei ^a,b   Huang, Houkuan ^b  

^a ZHENGZHOU UNIVERSITY   (China)

^b BEIJING JIAOTONG UNIVERSITY   (China)

Author keywords

Data stream; Dynamic approximate algorithm; Landmark window; Pruning; Top K significant itemset

Indexed keywords

DATA STREAMS; DATA STRUCTURES; MINERS; TREES (MATHEMATICS);

APPROXIMATE ALGORITHMS; DATA MINING AND KNOWLEDGE DISCOVERY; FREQUENT ITEMSET MINING; ITEMSET; MINIMUM SUPPORT THRESHOLDS; OPTIMAL STRATEGIES; PRUNING; SUPPORT THRESHOLD;

DATA MINING;

EID: 77952095901     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-009-0211-5     Document Type: Article

References (24)

1. Agrawal R, SriKant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th international conference on very large databases, pp 487-499.
2. Babcock B, Babu S, Datar M et al (2002) Models and issues in data streams. In: Proceedings of the 21st ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems, pp 1-16.
3. Babcock B, Olston C (2003) Distributed top-K monitoring. In: Proceedings of the 2003 ACM SIGMOD international conference on management of data, pp 28-39.
4. Chang JH, Lee WS (2004) A sliding window method for finding recently frequent itemsets over online data streams. J Inform Sci Eng 20(2): 753-762.
5. Chang JH, Lee WS (2006) Finding recently frequent itemsets adaptively over online transactional data streams. Inform Syst 31(8): 849-869.
6. Cheung YL, Fu AWC (2004) Mining frequent itemsets without support threshold: with and without item constraints. IEEE Trans Knowl Data Eng 16(9): 1052-1069.
7. Chi Y, Wang H, Yu PS, Muntz RR (2006) Catch the moment: maintaining closed frequent itemsets over a data stream sliding window. Knowl Inform Syst 10(3): 265-294.
8. Dang XH, Ng WK, Ong KL (2008) Online mining of frequent sets in data streams with error guarantee. Knowl Inform Syst 16: 245-258.
9. Fu AWC, Kwong RWW, Tang J (2000) Mining N-most interesting itemsets. In: Proceedings of the international symposium on methodologies for intelligent systems, pp 59-67.
10. Gibbons PB, Matias Y (1999) Synopsis data structures for massive data sets. In: Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms, pp 909-910.
11. Golab L, Dehaan D, Demaine E (2003) Identifying frequent items in sliding windows over on-line packet streams. In: Proceedings of ACM SIGCOMM internet measurement conference, pp 173-178.
12. Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proceedings of ACM SIGMOD international conference on management of data, pp 1-12.
13. Ilyas IF, Beskales G, Soliman MA (2008) A survey of top-k query processing techniques in relational database systems. ACM Comput Surv 40(4): 1-58 (Article 11).
14. Jia LF, Wang Z, Lu N et al (2007) RFIMiner: a regression-based algorithm for recently frequent patterns in multiple time granularity data streams. Appl Math Comput. 185(2): 769-783.
15. Jiang N, Gruenwald L (2006) CFI-Stream: mining closed frequent itemsets in data streams. In: Proceedings of the international conference on knowledge discovery and data mining, pp 592-597.
16. Leung CKS, Khan QI, Li Z et al (2007) CanTree: a canonical-order tree for incremental frequent-pattern mining. Knowl Inform Syst. 11(3): 287-311.
17. Li HF, Shan MK, Lee SY (2008) DSM-FI: an efficient algorithm for mining frequent itemsets in data streams. Knowl Inform Syst. 17(1): 79-97.
18. Lin C, Chiu D, Wu Y et al (2005) Mining frequent itemsets from data streams with a time-sensitive sliding window. In: Proceedings of the 5th international conference on data mining, pp 68-79.
19. Liu X, Xu H, Dong Y (2006) Mining frequent closed catterns from a sliding window over data streams. J Comput Res Dev 43(10): 1738-1743 (in Chinese).
20. Metwally A, Agrawal D, Abbadi AE (2005) Efficient computation of frequent and top-k elements in data streams. In: Proceedings of the 10th international conference on databases theory, pp 398-412.
21. Tzvetkov P, Yan X, Han J (2005) Tsp: Mining top-k closed sequential patterns. Knowl Inform Syst. 7(4): 438-457.
22. Wang J, Han J, Lu Y et al (2005) TFP: an efficient algorithm for mining top-K frequent closed itemsets. IEEE Trans Knowl Data Eng. 17(5): 652-664.
23. Wong RCW, FU AWC (2006) Mining top-K frequent itemsets from data streams. Data Mining Knowl Discov. 13(2): 193-217.
24. Zhu Y, Dennis S (2002) StatStream: statistical monitoring of thousands of data streams in real time. In: Proceedings of the international conference on very large data bases, pp 358-369.