Cartesian contour: A concise representation for a collection of frequent sets

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

Volumn , Issue , 2009, Pages 417-425

  Jin, Ruoming ^a   Xiang, Yang ^a   Liu, Lin ^a  

^a KENT STATE UNIVERSITY   (United States)

Author keywords

Cartesian product; Concise pattern representation; Frequent itemsets; Set cover

Indexed keywords

BICLIQUE; CARTESIAN PRODUCT; CARTESIANS; CONCISE PATTERN REPRESENTATION; CONCISE REPRESENTATIONS; EXPERIMENTAL STUDIES; FREQUENT ITEMSET MINING; FREQUENT ITEMSETS; FREQUENT PATTERNS; FREQUENT SETS; HEURISTIC TECHNIQUES; ITEM SETS; NP-HARDNESS; SET COVER; SET COVER PROBLEM; THEORETICAL INVESTIGATIONS;

HEURISTIC METHODS;

EID: 70350657275     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1557019.1557069     Document Type: Conference Paper

References (19)

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. Christan Borgelt. Apriori implementation. http://fuzzy.cs.Uni-Magdeburg. de/ borgelt/Software. Version 4.08.
4. 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.
5. Toon Calders and Bart Goethals. Non-derivable itemset mining. Data Min. Knowl. Discov., 14(1):171-206, 2007.
6. V. Chvátal. A greedy heuristic for the set-covering problem. Math. Oper. Res, 4:233-235, 1979.
7. Jiawei Han and Micheline Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, 2000.
8. Jiawei Han, Jianyong Wang, Ying Lu, and Petre Tzvetkov. Mining top-k frequent closed patterns without minimum support. In ICDM, pages 211-218, 2002.
9. Dorit S. Hochbaum, editor. Approximation algorithms for NP-hard problems. PWS Publishing Co., Boston, MA, USA, 1997.
10. 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.
11. Roberto J. Bayardo Jr. Efficiently mining long patterns from databases. In SIGMOD Conference, pages 85-93, 1998.
12. Jinyan Li, Guimei Liu, Haiquan Li, and Limsoon Wong. Maximal biclique subgraphs and closed pattern pairs of the adjacency matrix: A one-to-one correspondence and mining algorithms. IEEE Trans. Knowl. Data Eng., 19(12):1625-1637, 2007.
13. Nicolas Pasquier, Yves Bastide, Rafik Taouil, and Lotfi Lakhal. Discovering frequent closed itemsets for association rules. In ICDT, pages 398-416, 1999.
14. Ralf Schenkel, Anja Theobald, and Gerhard Weikum. Hopi: An efficient connection index for complex xml document collections. In EDBT, pages 237-255, 2004.
15. Chao Wang and Srinivasan Parthasarathy. Summarizing itemset patterns using probabilistic models. In KDD, pages 730-735, 2006.
16. 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.
17. Dong Xin, Hong Cheng, Xifeng Yan, and Jiawei Han. Extracting redundancy-aware top-k patterns. In KDD, 2006.
18. Dong Xin, Jiawei Han, Xifeng Yan, and Hong Cheng. Mining compressed frequent-pattern sets. In VLDB, 2005.
19. Xifeng Yan, Hong Cheng, Jiawei Han, and Dong Xin. Summarizing itemset patterns: a profile-based approach. In KDD, 2005.