CONFIDENCE METRICS FOR ASSOCIATION RULE MINING

REFERENCES

• Agrawal , R. , T. Imielinski , and A. Swami . 1993 . Mining association rules between sets of items in large databases . In: Proceedings of ACM SIGMOD International Conference on Management of Data (SIGMOD'93) , pp. 207 – 216 . Washington , DC .
   Google Scholar
• Brin , S. , R. Motwani , and C. Silverstein . 1997 . Beyond market baskets: Generalizing association rules to correlations . In: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'97) , pp. 265 – 276 . Tucson , AZ .
   Google Scholar
• Brin , S. , R. Motwani , J. Ullman , and S. Tsur . 1997 . Dynamic itemset counting and implication rules for market basket data . In: Proceedings of ACM SIGMOD International Conference on Management of Data (SIGMOD'97) , pp. 255 – 264 . Tucson , Arizona .
   Google Scholar
• Dong , G. and J. Li . 1998 . Interestingness of discovered association rules in terms of neighborhood-based unexpectedness . In: Proceedings of Pacific Asia Conference on Knowledge Discovery in Databases , pp. 72 – 86 . Melbourne , Australia .
   Google Scholar
• Piatetsky-Shapiro , G. 1991 . Discovery, analysis, and presentation of strong rules . In: Knowledge Discovery in Databases , eds. G. Piatetsky-Shapiro and W. J. Frawley , pp. 229 – 248 . Menlo Park , CA : AAAI/MIT Press .
   Google Scholar
• Roddick , J. F. and S. Rice . 2001 . What's interesting about cricket? – On thresholds and anticipation in discovered rules . SIGKDD Explorations 31 : 1 – 5 .
   Google Scholar
• Silberschatz , A. and Tuzhilin , A. 1996 . What makes patterns interesting in knowledge discovery systems . IEEE Transactions on Knowledge and Data Engineering 8 ( 6 ): 970 – 974 .
   Web of Science ®Google Scholar
• Silverstein , C. , S. Brin , and R. Motwani . 1998 . Beyond market baskets: generalizing association rules to dependence rules . Data Mining and Knowledge Discovery 2 ( 1 ): 39 – 68 .
   Web of Science ®Google Scholar
• Tan , P. , V. Kumar , and J. Srivastava . 2002 . Selecting the right interestingness measure for association patterns . In: Proceedings of the 8th International Conference on Knowledge Discovery and Data Mining , pp. 32 – 41 . Edmonton , Alberta , Canada .
   Google Scholar
• Wang , K. , S. Tay , and B. Liu . 1998 . Interestingness-based interval merger for numeric association rules . KDD 121 – 128 .
   Google Scholar
• Wu , X. , C. Zhang , and S. Zhang . 2004 . Efficient mining of both positive and negative association rules . ACM Transactions on Information Systems 22 ( 3 ): 381 – 405 .
   Web of Science ®Google Scholar
• Yan , X. , C. Zhang , and S. Zhang . 2005 . Armga: identifying interesting association rules with genetic algorithms . Applied Artificial Intelligence 19 ( 7 ): 677 – 689 .
   Web of Science ®Google Scholar
• Yan , X. , S. Zhang , and C. Zhang . 2007 . On data structures for association rule discovery . Applied Artificial Intelligence 21 ( 2 ): 57 – 79 .
   Web of Science ®Google Scholar
• Zhang , C. and S. Zhang . 2002 . Association rules mining: models and algorithms . Lecture Notes in Computer Science , Springer-Verlag , Vol. 2307 .
   Google Scholar
• Zhang , S. , X. Wu , C. Zhang , and J. Lu . 2008 . Computing the minimum-support for mining frequent patterns . Knowledge and Information Systems 15 : 233 – 257 .
   Web of Science ®Google Scholar