Statistical strategies for pruning all the uninteresting association rules ?

Frontiers in Artificial Intelligence and Applications

Volumn 110, Issue , 2004, Pages 430-434

  Casas Garriga, Gemma ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DISTRIBUTION FUNCTIONS;

CONDITION; DISTRIBUTION-FUNCTIONS; INTENSITY OF IMPLICATION; INTERESTINGNESS; MULTISTEPS; PEARSON COEFFICIENT; PROPERTY; RULE ANALYSIS; SIMPLE MODIFICATIONS; STATISTICAL STRATEGIES;

ASSOCIATION RULES;

EID: 85017405682     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (13)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining Association Rules Between Sets of Items in Large Databases. Proc. Int'l Conf. on Management of Data, 207-216. 1993.
2. Y. Bastide, N. Pasquier, R. Taouil, G. Stumme and L. Lakhal. Mining Minimal Non-Redundant Association Rules using Frequent Closed Itemsets. First Int'l Conf. on Computational Logic, 972-986. 2000.
3. R. Bayardo Jr, and R. Agrawal. Mining the Most Interesting Rules. Proc. Int'l Conf. on Knowledge Discovery and Data Mining, 145-154. 1999.
4. F. Berzal, I. Blanco, D. Sanchez and María-Amparo Vila Measuring the Accuracy and Interest of Association Rules: A new Framework. Journal Intelligent Data Analysis, Vol 6, pages 221-235. 2002.
5. S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules to correlations. Proc. Int'l Conf. on the Management of Data, 265-276. 1997.
6. S. Brin, R. Motwani, J. Ullman, and S. Tsur. Dynamic Itemset Counting and Implication Rules for Market Basket Data. Proc. Int'l Conf. on Management of Data, Volume 6:2, 255 - 264. 1997.
7. L. Cristofor, and D. Simovici. Genearating an Informative Cover for Association Rules. Int'l Conf. on Data Mining, p.597. 2002.
8. I. Fortes, J.L. Balćazar, and R. Morales. Bounding Negative Information in Frequent Sets Algorithms. Int'l Conference on Discovery Science, 50-58, 2001.
9. R. Hilderman, and H. Hamilton. Evaluation of interestingness measures for ranking discovered knowledge. Proc. Pacific-Asia Conf. on Knowledge Discovery and Data Mining, 247 - 259. 2001.
10. B. Liu, W. Hsu, and Y. Ma. Pruning and Summarizing the Discovered Associations. Proc. Int'l Conf. on Knowledge Discovery and Data Mining, 125-134. 1999.
11. G. Piatetsky-Shapiro. Discovery, analysis and presentation of strong rules. Int'l Conf. on Knowledge Discovery in Databases, 229-248. 1991.
12. A. Silberschatz, and A. Tuzhilin. On Subjective Measures of Interestingness in Knowledge Discovery. Proc. Int'l Conf. Knowledge Discovery in Databases, 275-281. 1995.
13. P. Tan, and V. Kumar. Interestingness Measures for Association Patterns: A Perspective. KDDWorkshop on Postprocessing in Machine Learning and Data Mining. 2000.