Generalizing the notion of support

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

Volumn , Issue , 2004, Pages 689-694

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

^a UNIVERSITY OF MINNESOTA   (United States)

^b Michigan State University   (United States)

Author keywords

Association analysis; Hyperclique; Support

Indexed keywords

BOOLEAN FUNCTIONS; DATA REDUCTION; ERROR ANALYSIS; MATRIX ALGEBRA; SET THEORY; THEOREM PROVING; VECTORS;

ASSOCIATION ANALYSIS; ERROR-TOLERANT ITEMSETS (ETI); HYPERCLIQUE; PATTERN EVALUATION FUNCTIONS;

DATA MINING;

EID: 12244305832     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1014052.1014141     Document Type: Conference Paper

References (14)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB 94, pages 487-499, 1994.
2. R. Agrawal and R. Srikant. Mining sequential patterns. In ICDE 95, pages 3-14, 1995.
3. P. Bollmann-Sdorra, A. Hafez, and V. V. Raghavan. A theoretical framework for association mining based on the boolean retrieval model. In DaWaK 2001, Munich, Germany, pages 21-30, 2001.
4. J. W. Demmel. Applied Numerical Linear Algebra. SIAM, January 1997.
5. E.-H. Han, G. Karypis, and V. Kumar. Tr# 97-068: Min-apriori: An algorithm for finding association rules in data with continuous attributes. Technical report, Department of Computer Science, University of Minnesota, Minneapolis, MN, 1997.
6. J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, 2000.
7. J. Hipp, U. Güntzer, and G. Nakhaeizadeh. Algorithms for association rule mining - a general survey and comparison. SIGKDD Explorations, 2(1):58-64, July 2000.
8. E. R. Omiecinski. Alternative interest measures for mining associations in databases. IEEE TKDE, 15(1):57-69, January/February 2003.
9. J. Pei and J. Han. Can we push more constraints into frequent pattern mining? In KDD 2000, pages 350-354, 2000.
10. R. Srikant, Q. Vu, and R. Agrawal. Mining association rules with item constraints. In KDD 97, pages 67-73, 1997.
11. M. Steinbach, P.-N. Tan, H. Xiong, and V. Kumar. Tr# 2004-114:: Extending the notion of support. Technical report, Army High Performance Computing Research Center, April 2004.
12. H. Xiong, P. Tan, and V. Kumar. Mining strong affinity association patterns in data sets with skewed support distribution. In ICDM 2003, pages 387-394, 2003.
13. C. Yang, U. M. Fayyad, and P. S. Bradley. Efficient discovery of error-tolerant frequent itemsets in high dimensions. In KDD 2001, pages 194-203, 2001.
14. M. J. Zaki and M. Ogihara. Theoretical foundations of association rules. In DMKD 98, pages 7:1-7:8, 1998.