Block interaction: A generative summarization scheme for frequent patterns

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2010, Pages 55-64

  Jin, Ruoming ^a   Xiang, Yang ^b   Hong, Hui ^a   Huang, Kun ^b  

^a KENT STATE UNIVERSITY   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

Block interaction; Frequent itemsets; Generative model; Pattern summarization; Set cover with pairs

Indexed keywords

BLOCK INTERACTION; FREQUENT ITEMSETS; GENERATIVE MODEL; PATTERN SUMMARIZATION; SET COVER;

ALGORITHMS; DATA MINING; MATHEMATICAL OPERATORS; TECHNICAL PRESENTATIONS;

TREES (MATHEMATICS);

EID: 77956253371     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1816112.1816120     Document Type: Conference Paper

References (32)

1. Foto Afrati, Aristides Gionis, and Heikki Mannila. Approximating a collection of frequent sets. In KDD, pages 12-19, 2004.
2. Rakesh Agrawal, Tomasz Imielinski, and Arun Swami. Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD Conference, pages 207-216, May 1993.
3. Rakesh Agrawal and Ramakrishnan Srikant. Fast algorithms for mining association rules in large databases. In Proceedings of the 20th International Conference on Very Large Data Bases, pages 487-499, 1994.
4. Rakesh Agrawal and Ramakrishnan Srikant. Mining sequential patterns. In Proceedings of the Eleventh International Conference on Data Engineering, pages 3-14, 1995.
5. Jean-François Boulicaut, Artur Bykowski, and Christophe Rigotti. Free-sets: A condensed representation of boolean data for the approximation of frequency queries. Data Min. Knowl. Discov., 7(1):5-22, 2003.
6. Douglas Burdick, Manuel Calimlim, Jason Flannick, Johannes Gehrke, and Tomi Yiu. Mafia: A maximal frequent itemset algorithm. IEEE Trans. Knowl. Data Eng., 17(11):1490-1504, 2005.
7. Artur Bykowski and Christophe Rigotti. Dbc: a condensed representation of frequent patterns for efficient mining. Inf. Syst., 28(8):949-977, 2003.
8. T. Calders, C. Rigotti, and J-F. Boulicaut. A survey on condensed representations for frequent sets. In J-F. Boulicaut, L. de Raedt, and H. Mannila, editors, Constraint-Based Mining, volume 3848 of LNCS. Springer, 2006.
9. Toon Calders and Bart Goethals. Non-derivable itemset mining. Data Min. Knowl. Discov., 14(1):171-206, 2007.
10. Uriel Feige. A threshold of In n for approximating set cover. J. ACM, 45(4):634-652, 1998.
11. Floris Geerts, Bart Goethals, and Taneli Mielikäinen. Tiling databases. In Discovery Science, pages 278-289, 2004.
12. Aristides Gionis, Heikki Mannila, and Jouni K. Seppänen. Geometric and combinatorial tiles in 0-1 data. In PKDD, pages 173-184, 2004.
13. Jiawei Han, Hong Cheng, Dong Xin, and Xifeng Yan. Frequent pattern mining: current status and future directions. Data Min. Knowl. Discov., 15(1):55-86, 2007.
14. Jiawei Han, Jianyong Wang, Ying Lu, and Petre Tzvetkov. Mining top-k frequent closed patterns without minimum support. In ICDM, pages 211-218, 2002.
15. Refael Hassin and Danny Segev. Proceedings of the 25th annual conference on foundations of software technology and theoretical computer science (fsttcs). In FSTTCS, pages 164-176, 2005.
16. Ruoming Jin, Muad Abu-Ata, Yang Xiang, and Ning Ruan. Effective and efficient itemset pattern summarization: regression-based approaches. In KDD, pages 399-407, 2008.
17. Ruoming Jin, Yang Xiang, and Hui Hong. Block interaction: A generative summation scheme for frequent patterns. Technical Report TR-KSU-CS-2010-02, Computer Science, Kent State University, May 2010.
18. Ruoming Jin, Yang Xiang, and Lin Liu. Cartesian contour: a concise representation for a collection of frequent sets. In KDD, pages 417-426, 2009.
19. Roberto J. Bayardo Jr. Efficiently mining long patterns from databases. In SIGMOD Conference, pages 85-93, 1998.
20. Juho Muhonen and Hannu Toivonen. Closed non-derivable itemsets. In PKDD, pages 601-608, 2006.
21. Nicolas Pasquier, Yves Bastide, Rafik Taouil, and Lotfi Lakhal. Discovering frequent closed itemsets for association rules. In ICDT, pages 398-416, 1999.
22. Ardian Kristanto Poernomo and Vivekanand Gopalkrishnan. Cp-summary: a concise representation for browsing frequent itemsets. In KDD, pages 687-696, 2009.
23. Marc J. van de Vijver, Yudong D. He, Laura J. van 't Veer, Hongyue Dai, Augustinus A.M. Hart, Dorien W. Voskuil, George J. Schreiber, Johannes L. Peterse, Chris Roberts, Matthew J. Marton, Mark Parrish, Douwe Atsma, Anke Witteveen, Annuska Glas, Leonie Delahaye, Tony van der Velde, Harry Bartelink, Sjoerd Rodenhuis, Emiel T. Rutgers, Stephen H. Friend, and René Bernards. A gene-expression signature as a predictor of survival in breast cancer. The New England Journal of Medicine, 347(25):1999-2009, 2002.
24. Laura J. van 't Veer, Hongyue Dai, Marc J. van de Vijver, Yudong D. He, Augustinus A. M. Hart, Mao Mao, Hans L. Peterse, Karin van der Kooy, Matthew J. Marton, Anke T. Witteveen, George J. Schreiber, Ron M. Kerkhoven, Chris Roberts, Peter S. Linsley, Renĺȩ Bernards, and Stephen H. Friend. Gene expression profiling predicts clinical outcome of breast cancer. Nature, 415(6871):530-536, 2002.
25. Chao Wang and Srinivasan Parthasarathy. Summarizing itemset patterns using probabilistic models. In KDD, pages 730-735, 2006.
26. Takashi Washio and Hiroshi Motoda. State of the art of graph-based data mining. SIGKDD Explor. Newsl., 5(1):59-68, 2003.
27. Yang Xiang, Ruoming Jin, David Fuhry, and Feodor F. Dragan. Succinct summarization of transactional databases: an overlapped hyperrectangle scheme. In KDD, pages 758-766, 2008.
28. Dong Xin, Hong Cheng, Xifeng Yan, and Jiawei Han. Extracting redundancy-aware top-k patterns. In KDD, 2006.
29. Dong Xin, Jiawei Han, Xifeng Yan, and Hong Cheng. Mining compressed frequent-pattern sets. In VLDB, 2005.
30. Xifeng Yan, Hong Cheng, Jiawei Han, and Dong Xin. Summarizing itemset patterns: a profile-based approach. In KDD, 2005.
31. M. T. Yang, R. Kasturi, and A. Sivasubramaniam. An Automatic Scheduler for Real-Time Vision Applications. In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), 2001.
32. Mohammed J. Zaki. Efficiently mining frequent trees in a forest. In Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 71-80, 2002.