
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Edward R. Omiecinski, "Alternative Interest Measures for Mining Associations in Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 1, pp. 5769, January/February, 2003.  
BibTex  x  
@article{ 10.1109/TKDE.2003.1161582, author = {Edward R. Omiecinski}, title = {Alternative Interest Measures for Mining Associations in Databases}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {15}, number = {1}, issn = {10414347}, year = {2003}, pages = {5769}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2003.1161582}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Alternative Interest Measures for Mining Associations in Databases IS  1 SN  10414347 SP57 EP69 EPD  5769 A1  Edward R. Omiecinski, PY  2003 KW  Data mining KW  associations KW  interest measures KW  databases KW  performance. VL  15 JA  IEEE Transactions on Knowledge and Data Engineering ER   
Abstract—Data mining is defined as the process of discovering significant and potentially useful patterns in large volumes of data. Discovering associations between items in a large database is one such data mining activity. In finding associations, support is used as an indicator as to whether an association is interesting. In this paper, we discuss three alternative interest measures for associations: anyconfidence, allconfidence, and bond. We prove that the important downward closure property applies to both allconfidence and bond. We show that downward closure does not hold for anyconfidence. We also prove that, if associations have a minimum allconfidence or minimum bond, then those associations will have a given lower bound on their minimum support and the rules produced from those associations will have a given lower bound on their minimum confidence as well. However, associations that have that minimum support (and likewise their rules that have minimum confidence) may not satisfy the minimum allconfidence or minimum bond constraint. We describe the algorithms that efficiently find all associations with a minimum allconfidence or minimum bond and present some experimental results.
[1] C. Aggarwal and P. Yu, ”Online Generation of Association Rules,” Proc. Int'l Conf. Data Eng., Feb. 1998.
[2] R. Agrawal, C. Aggarwal, and V. Prasad, ”DepthFirst Generation of Large Itemsets for Association Rules,” Proc. 2000 ACM Knowledge Discovery and Data Mining Conf., pp. 108118, 2000.
[3] R. Agrawal, T. Imielinski, and A. Swami, “Mining Association Rules Between Sets of Items in Large Databases,” Proc. 1993 ACMSIGMOD Int'l Conf. Management of Data, pp. 207216, May 1993.
[4] R. Agrawal and J.C. Shafer, Parallel Mining of Association Rules: Design, Implementation, and Experience IEEE Trans. Knowledge and Data Eng., pp. 487499, Dec. 1996.
[5] R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules,” Proc. 1994 Int'l Conf. Very Large Data Bases, pp. 487499, Sept. 1994.
[6] R. Bayardo and R. Agrawal, "Mining the Most Interesting Rules," Proc. Fifth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, ACM Press, New York, 1999.
[7] S. Brin, R. Motwani, and C. Silverstein, “Beyond Market Basket: Generalizing Association Rules to Correlations,” Proc. 1997 ACMSIGMOD Int'l Conf. Management of Data, pp. 265276, May 1997.
[8] S. Brin, R. Motwani, J. Ullman, and S. Tsur, “Dynamic Itemset Counting and Implication Rules for Market Basket Data,” ACM SIGMOD Conf. Management of Data, May 1997.
[9] R. Cooley, P. Tan, and J. Srivastava, ”Discovery of Interesting Usage Patterns from Web Data,” Proc. WEBKDD Workshop., 1999.
[10] E.H. Han, G. Karypis, and V. Kumar, “Scalable Parallel Data Mining for Association Rules,” ACM SIGMOD Conf. Management of Data, May 1997.
[11] J. Han and Y. Fu, “Discovery of MultipleLevel Association Rules from Large Databases,” Proc. 1995 Int'l Conf. Very Large Data Bases, pp. 420431, Sept. 1995.
[12] J. Han, J. Pei, and Y. Yin, Mining Frequent Patterns without Candidate Generation Proc. ACM SIGMOD Conf. Management of Data (SIGMOD '00), pp. 112, 2000.
[13] C. Hidber, "Online Association Rule Mining," Proc. ACM SIGMOD Int'l Conf. Management of Data, ACM Press, New York, 1999, pp. 145156.
[14] M. Houtsma and A. Swami, "SetOriented Mining of Association Rules," Proc. Int'l Conf. Data Engineering,Taipei, Taiwan, Mar. 1995.
[15] L.V.S. Lakshmanan, R. Ng, J. Han, and A. Pang, “Optimization of Constrained Frequent Set Queries With 2Variable Constraints,” Proc. 1999 ACMSIGMOD Int'l Conf. Management of Data, pp. 157168, June 1999.
[16] B. Liu, W. Hsu, and Y. Ma, “Mining Association Rules with Multiple Minimum Supports,” Proc. Fifth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, pp. 125134, Sept. 1999.
[17] H. Mannila, H. Toivonen, and A.I. Verkamo, ”Efficient Algorithms for Discovering Association Rules,” Proc. Knowledge Discovery and Data Mining '94: AAAI Workshop Knowledge Discovery in Databases, pp. 181192, July 1994.
[18] Y. Morimoto, T. Fukuda, H. Matsuzawa, T. Tkuyama, and K. Yoda, ”Algorithms for Mining Associations Rules for Binary Segmentation of Huge Categorical Databases,” Proc. Very Large Databases Conf., pp. 380391, Sept. 1998.
[19] R. Ng, L.V.S. Lakshmanan, J. Han, and A. Pang, “Exploratory Mining and Pruning Optimizations of Constrained Associations Rules,” Proc. 1998 ACMSIGMOD Int'l Conf. Management of Data, pp. 1324, June 1998.
[20] J.S. Park, M.S. Chen, and P.S. Yu, “An Effective HashBased Algorithm for Mining Association Rules,” Proc. 1995 ACMSIGMOD Int'l Conf. Management of Data, pp. 175186, May 1995.
[21] J. Pei and J. Han, ”Can We Push More Constraints into Frequent Pattern Mining?” Proc. 2000 ACM Knowledge Discovery and Data Mining Conf., 2000.
[22] Knowledge Discovery in Databases, G. PiatetskyShapiro and W.J. Frawley, eds. MIT Press, 1991.
[23] S. Ramaswamy, S. Mahajan, and A. Silbershatz, “On the Discovery of Interesting Patterns in Association Rules,” Proc. 24th Int'l Conf. Very Large Databases, pp. 368–379, Aug. 1998.
[24] G. Salton and M. McGill, Introduction to Modern Information Retrieval, McGraw Hill, New York, 1983.
[25] A. Savasere, E. Omiecinski, and S. Navathe, “An Efficient Algorithm for Mining Association Rules in Large Databases,” Proc. 1995 Int'l Conf. Very Large Data Bases, pp. 432443, Sept. 1995.
[26] A. Savasere, E. Omiecinski, and S. Navathe, ”Mining for Strong Negative Associations in a Large Database of Customer Transactions,” Proc. IEEE Data Eng. Conf., Feb. 1998.
[27] R. Srikant and R. Agrawal, “Mining Generalized Association Rules,” Proc. 1995 Int'l Conf. Very Large Data Bases, pp. 407419, Sept. 1995.
[28] M. Zaki, Generating NonRedundant Association Rules Proc. Sixth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, pp. 3443, 2000.