Discovering association patterns based on mutual information

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2734, Issue , 2003, Pages 369-378

  Sy, Bon K ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL METHODS; ERROR ANALYSIS; INFORMATION ANALYSIS; PATTERN RECOGNITION; PROBABILITY; STUDENTS; ASSOCIATION RULES; DATA MINING; LEARNING SYSTEMS;

DATA PATTERNS; DISCOVERING ASSOCIATION PATTERNS; ERROR RATE; PATTERN DISCOVERY; ASSOCIATION PATTERNS; ASSOCIATION RULES DISCOVERY; INTERESTINGNESS; MUTUAL INFORMATIONS; PROBABILISTIC INFERENCE; SUPPORT AND CONFIDENCE;

DATA MINING; PATTERN RECOGNITION;

EID: 8344257313     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-45065-3_32     Document Type: Conference Paper

References (16)

1. Genesereth M., Nilsson N.: Logical Foundations of Artificial Intelligence. Morgan Kaufmann (1987)
2. Freedman, D.: From association to causation: Some remarks on the history of statistics. Statistical Science 14 Vol. 3 (1999) 243-258
3. Cover T.M., Thomas J.A.: Elements of Information Theory. New York: John Wiley & Sons (1991)
4. Rish I., Hellerstein J., Jayram T.: An Analysis of Data Characteristics that affect Naive Bayes Performance. Tec. Rep. RC21993, IBM Watson Research Center (2001)
5. Barber B., Hamilton H.J.: Extracting Share Frequent Itemsets with Infrequent Subsets. Data Mining and Knowledge Discovery. (2003) 7(2): 153-168
6. Yang J., Wang W., Yu P.S., Han J.: Mining Long Sequential Patterns in a Noisy Environment. ACM SIGMOD June 4-6, Madison, Wisconsin (2002) 406-417
7. Kullback S.: Information Theory and Statistics. John Wiley & Sons Inc (1959)
8. Basharin G.: Theory of Probability and its Applications. Vol. 4 (1959) 333-336
9. Silverstein C., Brin S., Motwani R.: Beyond Market Baskets: Generalizing Association Rules to Dependence Rules. Data Mining and Knowledge Discovery. (1998) 2(1):39-68
10. Agrawal R., Imielinski T., Swami A.: Mining Association Rules between Sets of Items in large Databases. Proc. ACM SIGMOD Conf. Washington DC, May (1993)
11. Agrawal R., Srikant R.: Fast Algorithms for Mining Association Rules. VLDDBB (1994) 487-499
12. Toivonen H.: Sampling Large Databases for Association Rules. Proc. 22nd VLDB (1996) 134-145
13. Sy B.K.: Probability Model Selection Using Information-Theoretic Optimization Criterion. J. of Statistical Computing & Simulation, Gordan & Breach. V69-3 (2001)
14. Hoeffding W.: Probability Inequalities for sums of bounded Random Variables. Journal of the American Statistical Associations. Vol. 58 (1963) 13-30
15. Zaki M.: SPADE: an efficient algorithm for Mining Frequent Sequences. Machine Learning Journal, Vol. 42-1/2 (2001) 31-60
16. http://davis.wpi.edu/~xmdv/datasets.html