Efficient mining of frequent itemsets from data streams

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

Volumn 5071 LNCS, Issue , 2008, Pages 2-14

  Leung, Carson Kai Sang ^a   Brajczuk, Dale A ^a  

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

Data mining; Frequent itemset mining; Frequent patterns; Limited memory space; Tree structure

Indexed keywords

BOOLEAN FUNCTIONS; DATA MINING; DATABASE SYSTEMS; DECISION SUPPORT SYSTEMS; DIGITAL SIGNAL PROCESSING; INFORMATION MANAGEMENT; KNOWLEDGE BASED SYSTEMS; MINING; NETWORK PROTOCOLS; RIVERS; SENSOR NETWORKS; WIRELESS SENSOR NETWORKS;

CLICK STREAMS; COMPACT TREES; DATA STREAMS; EFFICIENT; FREQUENT ITEMSET MINING; FREQUENT ITEMSETS; FREQUENT PATTERNS; ITEMSETS; LIMITED MEMORIES; LIMITED MEMORY SPACE; MEMORY SPACES; MINING FREQUENT ITEMSETS; MINING TECHNIQUES; NOVEL ALGORITHMS; STREAM MININGS; TECHNOLOGY ADVANCES; TREE STRUCTURE; TREE STRUCTURES;

TREES (MATHEMATICS);

EID: 54249160024     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70504-8_2     Document Type: Conference Paper

References (23)

1. Agrawal, R., et al.: Mining association rules between sets of items in large databases. In: Proc. ACM SIGMOD, pp. 207-216 (2003)
2. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. VLDB, pp. 487-499 (1994)
3. Bashir, S., Baig, A.R.: Max-FTP: mining maximal fault-tolerant frequent patterns from databases. In: Cooper, R., Kennedy, J. (eds.) BNCOD 2007. LNCS, vol. 4587, pp. 235-246. Springer, Heidelberg (2007)
4. Bucila, C., et al.: DualMiner: a dual-pruning algorithm for itemsets with constraints. In: Proc. ACM KDD, pp. 42-51 (2002)
5. Chi, Y., et al.: Moment: maintaining closed frequent itemsets over a stream sliding window. In: Proc. IEEE ICDM, pp. 59-66 (2004)
6. El-Hajj, M., Zaïane, O.R.: COFI-tree mining: a new approach to pattern growth with reduced candidacy generation. In: Proc. FIMI (2003)
7. El-Hajj, M., Zaïane, O.R.: Non-recursive generation of frequent k-itemsets from frequent pattern tree representations. In: Kambayashi, Y., Mohania, M., WöB, W. (eds.) DaWaK 2003. LNCS, vol. 2737, pp. 371-380. Springer, Heidelberg (2003)
8. Gaber, M.M., et al.: Mining data streams: a review. ACM SIGMOD Record 34(2), 18-26 (2005)
9. Giannella, C., et al.: Mining frequent patterns in data streams at multiple time granularities. In: Data Mining: Next Generation Challenges and Future Directions, ch. 6. AAAI/MIT Press (2004)
10. Guo, Y., et al.: A FP-tree based method for inverse frequent set mining. In: Bell, D.A., Hong, J. (eds.) BNCOD 2006. LNCS, vol. 4042, pp. 152-163. Springer, Heidelberg (2006)
11. Han, J., et al.: Mining frequent patterns without candidate generation. In: Proc. ACM SIGMOD, pp. 1-12 (2000)
12. Jin, R., Agrawal, G.: An algorithm for in-core frequent itemset mining on streaming data. In: Proc. IEEE ICDM, pp. 210-217 (2005)
13. Lakshmanan, L.V.S., Leung, C.K.-S., Ng, R.T.: Efficient dynamic mining of constrained frequent sets. ACM TODS 28(4), 337-389 (2003)
14. Leung, C.K.-S., et al.: A tree-based approach for frequent pattern mining from uncertain data. In: Washio, T., et al. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 653-661 (2008)
15. Leung, C.K.-S., et al.: CanTree: a canonical-order tree for incremental frequent-pattem mining. KAIS 11(3), 287-311 (2007)
16. Leung, C.K.-S., et al.: Exploiting succinct constraints using FP-trees. ACM SIGKDD Explorations 4(1), 40-49 (2002)
17. Leung, C.K.-S., et al.: FIsViz: a frequent itemset visualizer. In: Washio, T., et al. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 644-652. Springer, Heidelberg (2008)
18. Leung, C.K.-S., Khan, Q.I.: DSTree: a tree structure for the mining of frequent sets from data streams. In: Proc. IEEE ICDM, pp. 928-932 (2006)
19. Leung, C.K.-S., Khan, Q.I.: Efficient mining of constrained frequent patterns from streams. In: Proc. IDEAS, pp. 61-68 (2006)
20. Ng, R.T., et al.: Exploratory mining and pruning optimizations of constrained associations rules. In: Proc. ACM SIGMOD, pp. 13-24 (1998)
21. Pei, J., et al.: Mining frequent itemsets with convertible constraints. In: Proc. IEEE ICDE, pp. 433-442 (2001)
22. Yu, J.X., et al.: False positive or false negative: mining frequent itemsets from high speed transactional data streams. In: Proc. VLDB, pp. 204-215 (2004)
23. Zaki, M.J., Hsiao, C.-J.: CHARM: an efficient algorithm for closed itemset mining. In: Proc. SDM, pp. 457-473 (2002)