Support envelopes: A technique for exploring the structure of association patterns

KDD-2004 - Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2004, Pages 296-305

  Steinbach, Michael ^a   Tan, Pang Ning ^b   Kumar, Vipin ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

^b Michigan State University   (United States)

Author keywords

Association analysis; Error tolerant itemsets; Formal concept analysis; Support envelope

Indexed keywords

ASSOCIATION ANALYSIS; ERROR TOLERANT ITEMSETS; FORMAL CONCEPT ANALYSIS; SUPPORT ENVELOPE;

ALGORITHMS; COMPUTATIONAL METHODS; DATA HANDLING; DATA MINING; FAULT TOLERANT COMPUTER SYSTEMS; INFORMATION RETRIEVAL;

PATTERN RECOGNITION;

EID: 12244289922     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Jean-Francois Boulicaut and Artur Bykowski. Frequent closures as a concise representation for binary data mining. In PAKDD 2000, pages 62-73, 2000.
2. J.F. Boulicaut, A. Bykowski, and C. Rigotti. Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery Journal (DMKD), 7(1):5-22, 2003.
3. Laurentiu Cristofor and Dan A. Simovici. Generating an informative cover for association rules. In ICDM 2002, 9-12 December 2002, Maebashi City, Japan, pages 597-600. IEEE Computer Society, 2002.
4. B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 2nd edition, 2002.
5. B. Ganter and R. Wille. Formal Concept Analysis -Mathematical Foundations, Springer, May 1999.
6. Bart Goethals and Mohammed J. Zaki. Frequent Itemset Mining Implementations Repository (FIMI). This site contains a wide-variety of algorithms for mining frequent, closed, and maximal itemsets, http://fimi.cs.helsinki.fi/.
7. Dimitrios Gunopulos, Heikki Mannila, Roni Khardon, and Hannu Toivonen. Data mining, hypergraph transversals, and machine learning. In Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, pages 209-216. ACM Press, 1997.
8. Jiawei Han and Micheline Kamber. Data Mining: Concepts and Techniques, Morgan Kaufmann Publishers, 2000.
9. Jochen Hipp, Ulrich Güntzer, and Gholamreza Nakhaeizadeh. Algorithms for association rule mining - a general survey and comparison. SIGKDD Explorations, 2(1):58-64, July 2000.
10. Heikki Mannila and Hannu Toivonen. Multiple uses of frequent sets and condensed representations. In Knowledge Discovery and Data Mining, pages 189-194, 1996.
11. Heikki Mannila and Hannu Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3):241-258, 1997.
12. Nicolas Pasquier, Yves Bastide, Rafik Taouil, and Lotfi Lakhal. Closed set based discovery of small covers for association rules. In Proc. 15emes Journees Bases de Donnees Avancees, BDA, pages 361-381, 1999.
13. Nicolas Pasquier, Yves Bastide, Rafik Taouil, and Lotfi Lakhal. Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1):25-46, 1999.
14. V. Pudi and J. Haritsa. Generalized closed itemsets: A technique for improving the conciseness of rule covers. In Proc, of 19th IEEE Intl. Conf. on Data Engineering, Bangalore, India, March 2003, pages 714-716. IEEE Computer Society, 2003.
15. Ganesh Ramesh, William A. Maniatty, and Mohammed J. Zaki. Feasible itemset distributions in data mining: theory and application. In Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 284-295. ACM Press, 2003.
16. Michael Steinbach. Preliminary implementation of support envelope algorithms. http://www.cs.umn.edu/steinbac/se/se.html.
17. Michael Steinbach Pang-Ning Tan and Vipin Kumar. Tr# 2004-115: Support envelopes: A technique for exploring the structure of association patterns. Technical report, Army High Performance Computing Research Center, April 2004.
18. H. Xiong, P. Tan, and V. Kumar. Mining strong affinity association patterns in data sets with skewed support distribution. In Proc. of the 3rd IEEE International Conf. on Data Mining, pages 387-394, 2003.
19. Cheng Yang, Usama M. Fayyad, and Paul S. Bradley. Efficient discovery of error-tolerant frequent itemsets in high dimensions. In KDD '01, pages 194-203. ACM Press, 2001.
20. Mohammed Javeed Zaki and Mitsunori Ogihara. Theoretical foundations of association rules. In DMKD 98, pages 7:1-7:8, June 1998.
21. Mohammed J. Zaki and Ching-Jui Hsiao. Charm: An efficient algorithm for closed itemset mining. In SDM 2002, 2002.
22. Text retrieval conference 5, http://trec.nist.gov/.