The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (2010 vol.22)
pp: 798-811
Alex Tze Hiang Sim , Universiti of Teknologi Malaysia
Maria Indrawan , Monash University, Melbourne
Samar Zutshi , Swinburne University, Lilydale
Bala Srinivasan , Monash University, Melbourne
ABSTRACT
In the data mining field, association rules are discovered having domain knowledge specified as a minimum support threshold. The accuracy in setting up this threshold directly influences the number and the quality of association rules discovered. Often, the number of association rules, even though large in number, misses some interesting rules and the rules' quality necessitates further analysis. As a result, decision making using these rules could lead to risky actions. We propose a framework to discover domain knowledge report as coherent rules. Coherent rules are discovered based on the properties of propositional logic, and therefore, requires no background knowledge to generate them. From the coherent rules discovered, association rules can be derived objectively and directly without knowing the level of minimum support threshold required. We provide analysis of the rules compare to those discovered via the a priori.
INDEX TERMS
Association rules, data mining, mining methods.
CITATION
Alex Tze Hiang Sim, Maria Indrawan, Samar Zutshi, Bala Srinivasan, "Logic-Based Pattern Discovery", IEEE Transactions on Knowledge & Data Engineering, vol.22, no. 6, pp. 798-811, June 2010, doi:10.1109/TKDE.2010.49
REFERENCES
[1] R. Agrawal, T. Imielinski, and A. Swami, "Mining Association Rules between Sets of Items in Large Databases," SIGMOD Record, vol. 22, pp. 207-216, 1993.
[2] C. Longbing, "Introduction to Domain Driven Data Mining," Data Mining for Business Applications, L. Cao, P.S. Yu, C. Zhang, and H. Zhang, eds., pp. 3-10, Springer, 2008.
[3] G.I. Webb and S. Zhang, "k-Optimal Rule Discovery," Data Mining and Knowledge Discovery, vol. 10, no. 1, pp. 39-79, 2005.
[4] E. Babbie, F. Halley, and J. Zaino, Adventures in Social Research, Data Analysis Using SPSS 11.0/11.5 for Windows. Pine Forge Press, 2003.
[5] C. Frankfort-Nachmias and A. Leon-Guerrero, Social Statistics for a Diverse Society. Pine Forge Press, 2006.
[6] J.F. Healey, E.R. Babbie, and J. Boli, Exploring Social Issues: Using SPSS for Windows 95, Versions 7.5, 8.0, or Higher. Pine Forge Press, 1999.
[7] B. Liu, W. Hsu, and Y. Ma, "Mining Association Rules with Multiple Minimum Supports," Proc. ACM SIGKDD, pp. 337-341, 1999.
[8] Y.-H. Hu, "An Efficient Algorithm for Discovering and Maintenance of Frequent Patterns with Multiple Minimum Supports," master's thesis, Dept. of Information Management, Nat'l Central Univ., 2003.
[9] Y.S. Koh, N. Rountree, and R.A. O'Keefe, "Finding Non-Coincidental Sporadic Rules Using Apriori-Inverse," Int'l J. Data Warehousing and Mining, vol. 2, pp. 38-54, 2006.
[10] H. Mannila, "Database Methods for Data Mining," Proc. Fourth Int'l Conf. Knowledge Discovery and Data Mining (Tutorial), 1998.
[11] Y.-H. Hu and Y.-L. Chen, "Mining Association Rules with Multiple Minimum Supports: A New Mining Algorithm and a Support Tuning Mechanism," Decision Support Systems, vol. 42, pp. 1-24, 2006.
[12] W.-Y. Lin, M.-C. Tseng, and J.-H. Su, "A Confidence-Lift Support Specification for Interesting Associations Mining," Proc. Sixth Pacific-Asia Conf. Advances in Knowledge Discovery and Data Mining (PAKDD), pp. 148-158, 2002.
[13] H. Yun, D. Ha, B. Hwang, and K.H. Ryu, "Mining Association Rules on Significant Rare Data Using Relative Support," J. Systems Software, vol. 67, pp. 181-191, 2003.
[14] S. Brin, R. Motwani, and C. Silverstein, "Beyond Market Baskets: Generalizing Association Rules to Correlations," Proc. 1997 ACM SIGMOD, pp. 265-276, 1997.
[15] G.I. Webb, "Association Rules," The Handbook of Data Mining, pp. 26-39. Mahwah, 2003.
[16] J. Han and M. Kamber, Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, 2006.
[17] S. Brin, R. Motwani, J.D. Ullman, and S. Tsur, "Dynamic Itemset Counting and Implication Rules for Market Basket Data," SIGMOD Record, vol. 26, pp. 255-264, 1997.
[18] T. Scheffer, "Finding Association Rules That Trade Support Optimally against Confidence," Intelligent Data Analysis, vol. 9, pp. 381-395, 2005.
[19] J. Li and Y. Zhang, "Direct Interesting Rule Generation," Proc. Third IEEE Int'l Conf. Data Mining, pp. 155-162, 2003.
[20] X. Wu, C. Zhang, and S. Zhang, "Efficient Mining of Both Positive and Negative Association Rules," ACM Trans. Information Systems, vol. 22, pp. 381-405, 2004.
[21] C.C. Aggarwal and P.S. Yu, "A New Framework for Itemset Generation," Proc. 17th ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems (PODS '98), pp. 18-24, 1998.
[22] J. Blanchard, F. Guillet, H. Briand, and R. Gras, "Assessing Rule Interestingness with a Probabilistic Measure of Deviation from Equilibrium," Proc. 11th Int'l Symp. Applied Stochastic Models and Data Analysis (ASMDA '05), pp. 191-200, 2005.
[23] M.-L. Antonie and O.R. Zaïane, "Mining Positive and Negative Association Rules: An Approach for Confined Rules," Proc. European Conf. Principles and Practice of Knowledge Discovery in Databases (PKDD '04), pp. 27-38, 2004.
[24] G. Piatetsky-Shapiro, "Discovery, Analysis, and Presentation of Strong Rules," Knowledge Discovery in Databases, pp. 229-248, AAAI/MIT Press, 1991.
[25] A.M. Liebetrau, Measures of Association. Sage Publications, 1983.
[26] Encyclopedia Britannica, "Analytic Proposition," http://www. britannica.com/ebarticle-9007348 , 2007.
[27] N. Rescher, Conditionals. MIT Press, 2007.
[28] Open University (Mathematics Foundation Course Team), Logic II: Proof, vol. 17. The Open Univ. Press, 1971.
[29] W.V.O. Quine, Mathematical Logic, second ed. Harper & Row Publishers, 1951.
[30] Encyclopedia Britannica, "Condition," http://www.britannica. com/ebarticle-9025123 , 2007.
[31] R. Forsyth, "Zoo Data Set," Orange, AI Lab, http://magix.fri.uni-lj. si/orange/doc/datasets zoo.htm, 1990.
[32] C. Borgelt, "A Priori—Association Rule Induction/Frequent Item Set Mining," http://www.borgelt.netapriori.html, 2008.
[33] S.-J. Yen and Y.-S. Lee, "Mining Interesting Association Rules: A Data Mining Language," Advances in Knowledge Discovery and Data Mining, pp. 172-176, Springer, 2002.
[34] A. Das, D.K. Bhattacharyya, and J.K. Kalita, "Horizontal versus Vertical Partitioning in Association Rule Mining: A Comparison," Proc. Sixth Int'l Conf. Computational Intelligence and Natural Computation (CINC), pp. 1617-1620, 2003.
[35] S. Chiu, W.-k. Liao, and A. Choudhary, "Design and Evaluation of Distributed Smart Disk Architecture for IO-Intensive Workloads," Proc. Int'l Conf. Computational Science (ICCS '03), pp. 230-241, 2003.
[36] IBM, "Quest Synthetic Data Generation Code," http://www. almaden.ibm.com/cs/projects/ iis/hdb/Projects/data_mining/datasetssyndata.html , 2010.
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool