An efficient itemset mining approach for data streams

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6882 LNAI, Issue PART 2, 2011, Pages 515-523

  Baralis, Elena ^a   Cerquitelli, Tania ^a   Chiusano, Silvia ^a   Grand, Alberto ^a   Grimaudo, Luigi ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

data stream analysis; Itemset extraction; knowledge discovery

Indexed keywords

DATA ITEMS; DATA STREAM; DATA WINDOWS; ITEM SETS; ITEMSET; ITEMSET MINING; MAIN-MEMORY; MINIMUM SUPPORT THRESHOLDS; SYNTHETIC DATA; TRANSACTIONAL DATA; AGGREGATE DATUM; COMPACTLY STORED; NEW APPROACHES;

DATA COMMUNICATION SYSTEMS; DATA STRUCTURES; KNOWLEDGE BASED SYSTEMS; DATA MINING; EXTRACTION;

DATA MINING; DATA STREAMS;

EID: 80053156981     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23863-5_53     Document Type: Conference Paper

References (19)

1. Agrawal, N., Imielinski, T., Swami, A.: Database mining: A performance perspective. IEEE Trans. on Knowledge and data Engineering 5(6) (1993)
2. Aumann, Y., Feldman, R., Lipshtat, O.: Borders: An efficient algorithm for association generation in dynamic databases. JIIS 12 (1999)
3. Baralis, E., Cerquitelli, T., Chiusano, S.: Constrained itemset mining on a sequence of incoming data blocks. Int. J. Intell. Syst. 25, 389-410 (2010)
4. Baralis, E., Cerquitelli, T., Chiusano, S., Grand, A.: Array-tree: A persistent data structure to compactly store frequent itemsets. In: IEEE Conf. of Intelligent Systems, pp. 108-113 (2010)
5. Cheung, D.W.-L., Han, J., Ng, V., Wong, C.Y.: Maintenance of discovered association rules in large databases: An incremental updating technique. In: ICDE, pp. 106-114. IEEE Computer Society, Los Alamitos (1996)
6. Cheung, W., Zaiane, O.R.: Incremental mining of frequent patterns without candidate generation or support constraint. In: IDEAS, pp. 111-116 (July 2003)
7. Ganti, V., Gehrke, J., Ramakrishnan, R.: DEMON: Mining and monitoring evolving data. IEEE Trans. Knowl. Data Eng. 13(1), 50-63 (2001)
8. Ganti, V., Gehrke, J.E., Ramakrishnan, R.: Mining data streams under block evolution. SIGKDD Explorations 3(2) (January 2002)
9. Gouda, K., Zaki, M.J.: Efficiently mining maximal frequent itemsets. In: ICDM 2001: Proceedings of the 2001 IEEE International Conference on Data Mining, pp. 163-170. IEEE Computer Society, Washington, DC, USA (2001)
10. Grahne, G., Zhu, J.: Efficiently using prefix-trees in mining frequent itemsets. In: FIMI 2003 Workshop on Frequent Itemset Mining Implementations (November 2003)
11. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: In SIGMOD 2000, Dallas, TX (May 2000)
12. Li, K., Wang, Y.-y., Ellahi, M., Wang, H.-a.: Mining recent frequent itemsets in data streams. In: Proceedings of the 2008 Fifth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2008, vol. 04, pp. 353-358. IEEE Computer Society, Washington, DC, USA (2008)
13. Liu, H., Lin, S., Qiao, J., Yu, G., Lu, K.: An efficient frequent pattern mining algorithm for data stream. In: Proceedings of the 2008 International Conference on Intelligent Computation Technology and Automation, vol. 01, pp. 757-761. IEEE Computer Society, Washington, DC, USA (2008)
14. Pei, J., Han, J., Lakshmanan, L.V.S.: Pushing convertible constraints in frequent itemset mining. Data Min. Knowl. Discov. 8(3), 227-252 (2004)
15. F. repository, http://fimi.cs.helsinki.fi/
16. Uno, T., Kiyomi, M., Arimura, H.: LCM ver. 2: Efficient mining algorithms for frequent/closed/maximal itemsets. In: FIMI (2004)
17. Wang, J., Han, J., Pei, J.: Closet+: searching for the best strategies for mining frequent closed itemsets. In: KDD 2003: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 236-245. ACM, New York (2003)
18. Wang, Y., Li, K., Wang, H.: Maintaining only frequent itemsets to mine approximate frequent itemsets over online data streams. In: IEEE Symposium on Computational Intelligence and Data Mining, pp. 381-388 (2009)
19. Yang, C.-H., Yang, D.-L.: Imbt-a binary tree for efficient support counting of incremental data mining. In: CSE (1), pp. 324-329 (2009)