Efficient mining of frequent patterns from uncertain data

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2007, Pages 489-494

  Leung, Carson Kai Sang ^a   Carmichael, Christopher L ^a   Hao, Boyu ^a  

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

Existential probability; Frequent itemsets; Mining algorithm; Prefix tree structure; Uncertain data

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; DATA MINING; DECISION SUPPORT SYSTEMS; INFORMATION MANAGEMENT; KETONES; MINING; SEARCH ENGINES;

EXISTENTIAL PROBABILITY; FREQUENT ITEMSETS; FREQUENT PATTERNS; INTERNATIONAL CONFERENCES; MINING ALGORITHM; MINING ALGORITHMS; PREFIX-TREE STRUCTURE; TRANSACTION DATABASES; UNCERTAIN DATA;

TREES (MATHEMATICS);

EID: 44649171424     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDMW.2007.84     Document Type: Conference Paper

References (24)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. SIGMOD 1993, pp. 207-216.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. VLDB 1994, pp. 487-499.
3. R.J. Bayardo. Efficiently mining long patterns from databases. In Proc. SIGMOD 1998, pp. 85-93.
4. F. Bonchi and C. Lucchese. On closed constrained frequent pattern mining. In Proc. ICDM 2004, pp. 35-42.
5. S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: generalizing association rules to correlations. In Proc. SIGMOD 1997, pp. 265-276.
6. C. Bucila, J. Gehrke, et al. DualMiner: a dual-pruning algorithm for itemsets with constraints. In Proc. KDD 2002, pp. 42-51.
7. W. Cheung and O.R. Zaïane. Incremental mining of frequent patterns without candidate generation or support constraint. In Proc. IDEAS 2003, pp. 111-116.
8. C.-K. Chui, B. Kao, and E. Hung. Mining frequent itemsets from uncertain data. In Proc. PAKDD 2007, pp. 47-58.
9. X. Dai, M.L. Yiu, et al. Probabilistic spatial queries on existentially uncertain data. In Proc. SSTD 2005, pp. 400-417.
10. M.M. Gaber, A.B. Zaslavsky, and S. Krishnaswamy. Mining data streams: a review. SIGMOD Record, 34(2), pp. 18-26, June 2005.
11. C. Giannella, J. Han, 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.
12. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. SIGMOD 2000, pp. 1-12.
13. L.V.S. Lakshmanan, C.K.-S. Leung, and R.T. Ng. Efficient dynamic mining of constrained frequent sets. ACM TODS, 28(4), pp. 337-389, Dec. 2003.
14. C.K.-S. Leung and Q.I. Khan. DSTree: a tree structure for the mining of frequent sets from data streams. In Proc. ICDM 2006, pp. 928-933.
15. C.K.-S. Leung, Q.I. Khan, and T. Hoque. CanTree: a tree structure for efficient incremental mining of frequent patterns. In Proc. ICDM 2005, pp. 274-281.
16. C.K.-S. Leung, L.V.S. Lakshmanan, and R.T. Ng. Exploiting succinct constraints using FP-trees. SIGKDD Explorations, 4(1), pp. 40-49, June 2002.
17. C.K.-S. Leung, R.T. Ng, and H. Mannila. OSSM: a segmentation approach to optimize frequency counting. In Proc. ICDE 2002, pp. 583-592.
18. R.T. Ng, L.V.S. Lakshmanan, et al. Exploratory mining and pruning optimizations of constrained associations Rules. In Proc. SIGMOD 1998, pp. 13-24.
19. J.S. Park, M.-S. Chen, and P.S. Yu. Using a hash-based method with transaction trimming for mining association rules. IEEE TKDE, 9(5), pp. 813-825, Sept./Oct. 1997.
20. J. Pei, J. Han, and L.V.S. Lakshmanan. Mining frequent itemsets with convertible constraints. In Proc. ICDE 2001, pp. 433-442.
21. J. Pei, J. Han, and R. Mao. CLOSET: an efficient algorithm for mining frequent closed itemsets. In Proc. DMKD 2000, pp. 21-30.
22. S. Sarawagi, S. Thomas, and R. Agrawal. Integrating association rule mining with relational database systems: alternatives and implications. In Proc. SIGMOD 1998, pp. 343-354.
23. D. Tsur, J.D. Ullman, et al. Query flocks: a generalization of association-rule mining. In Proc. SIGMOD 1998, pp. 1-12.
24. R.C.-W. Wong and A.W.-C. Fu. Mining top-K frequent itemsets from data streams. Data Mining and Knowledge Discovery, 13(2), pp. 193-217, Sept. 2006.