Incorporating occupancy into frequent pattern mining for high quality pattern recommendation

ACM International Conference Proceeding Series

Volumn , Issue , 2012, Pages 75-84

  Tang, Linpeng ^a,c   Zhang, Lei ^b,c   Luo, Ping ^c   Wang, Min ^c  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^c HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

constraint based mining; DOFIA; frequent and dominant pattern; frequent pattern mining

Indexed keywords

CONSTRAINT-BASED MINING; DOFIA; FREQUENT AND DOMINANT PATTERN; FREQUENT ITEMSET MINING; FREQUENT PATTERN MINING; HIGH QUALITY; HIGHER FREQUENCIES; INTERESTINGNESS; ITEMSET; REAL-WORLD APPLICATION; SEARCH PROCESS; SYNTHETIC DATASETS; TRANSACTION DATABASE; UPPER BOUND; WEIGHTED SUM;

ALGORITHMS; KNOWLEDGE MANAGEMENT; WEBSITES;

DATA MINING;

EID: 84871051408     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2396761.2396775     Document Type: Conference Paper

References (18)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of the ACM SIGMOD, 1993.
2. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Advances in knowledge discovery and data mining. chapter Fast discovery of association rules, pages 307-328. American Association for Artificial Intelligence, Menlo Park, CA, USA, 1996.
3. R. Agrawal and R. Srikant. Mining sequential patterns. In Proceedings of the 11th ICDE, 1995.
4. F. Bonchi, F. Giannotti, A. Mazzanti, and D. Pedreschi. Exante: Anticipated data reduction in constrained pattern mining. Knowledge Discovery in Databases: PKDD 2003, 2003.
5. F. Bonchi and C. Lucchese. On closed constrained frequent pattern mining. In Data Mining, 2004. ICDM'04. Fourth IEEE International Conference on, pages 35-42. IEEE, 2004.
6. D. Burdick, M. Calimlim, and J. Gehrke. Mafia: A maximal frequent itemset algorithm for transactional databases. In Proceedings of the 17th ICDE, 2001.
7. L. Cerf, J. Besson, C. Robardet, and J.-F. Boulicaut. Closed patterns meet n-ary relations. ACM Trans. Knowl. Discov. Data, 3(1):3:1-3:36, Mar. 2009.
8. K. Gade, J. Wang, and G. Karypis. Efficient closed pattern mining in the presence of tough block constraints. In Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 138-147. ACM, 2004.
9. K. Gouda and M. Zaki. Genmax: An efficient algorithm for mining maximal frequent itemsets. Data Mining and Knowledge Discovery, 2005.
10. J. Han, H. Cheng, D. Xin, and X. Yan. Frequent pattern mining: current status and future directions. Data Mining and Knowledge Discovery, 2007.
11. J. Han, P. Jian, and Y. Yin. Mining frequent patterns without candidate generation. In Proceedings of ACM SIGMOD, 2000.
12. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In Proceedings of the 7th International Conference on Database Theory, 1999.
13. J. Pei, J. Han, and L. Lakshmanan. Mining frequent itemsets with convertible constraints. In Proceedings of the 17th ICDE, 2001.
14. A. Soulet and B. Crémilleux. Mining constraint-based patterns using automatic relaxation. Intell. Data Anal., 13(1):109-133, Jan. 2009.
15. J. Vreeken, M. van Leeuwen, and A. Siebes. Krimp: mining itemsets that compress. Data Mining and Knowledge Discovery, pages 1-46, 2011.
16. C. Wang and S. Parthasarathy. Learning approximate mrfs from large transactional data. Statistical Network Analysis: Models, Issues, and New Directions, pages 182-185, 2007.
17. J. Wang, J. Han, Y. Lu, and P. Tzvetkov. Tfp: An efficient algorithm for mining top-k frequent closed itemsets. Knowledge and Data Engineering, IEEE Transactions on, 2005.
18. T. Washio and H. Motoda. State of the art of graph-based data mining. ACM SIGKDD Explorations Newsletter, 2003.