Open Access Open Access  Restricted Access Subscription or Fee Access

Pattern Discovery: Inference Analysis Approach

Praveen Kumar Ullengala, Srikanth Jatla, Shaik Shah Nawaz

Abstract


Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter leads to not only a more compact yet complete result set but also better efficiency. However, most of the previously developed closed pattern mining algorithms work under the candidate maintenance-and test paradigm, which is inherently costly in terms of runtime and space usage when the support threshold is low or the patterns, become long. In this paper, we propose, a new pattern mining algorithm by appending back scan pruning technique to the coherent rule algorithm which will discover domain knowledge report using coherent rules, where coherent rules would be discovered based on the properties of propositional logic, so it does not require background knowledge to generate rules. Coherent rule algorithm generates both frequent and infrequent rules. The aim of this paper is to generate only frequent rules. This new approach of back scan pruning technique prunes all the infrequent rules which results in fast retrieval of the rules, saves memory space and process time. This paper proposes the use of both upward and downward closure property for the extraction of frequent item sets which reduces the total number of scans required for the generation of coherent rules.

Keywords


Associations Rule, Propositional Logic, Implication, Candidate Sets, Frequent Item Set, Pruning.

Full Text:

PDF

References


Agrawal R., Imielinski T. And Swami A. (1993) “Mining Association Rules between Sets of Items in large Databases” SIGMOD Record, vol.22, pp.207-216.

Alex TzeHiangSim, Maria Indrawn, SamarZutshi and BalaSrinivasan (2010) “Logic Based Pattern Discovery” IEEE Transactions on Knowledge and Data Engineering, VOL. 22, NO. 6, pp .798-811.

Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules. In Proc. 20th Int. Conf. Very Large Data Bases,VLDB, J. B. Bocca, M. Jarke, and C. Zaniolo,Eds. Morgan Kaufmann, 487-499.Bing Liu, Minqing Hu, and Wynne Hsu (2000) “Multi-Level Organization and Summarization of the Discovered Rules” Proc. ACM SIGKDD, Aug 20-23.

B. Liu, W. Hsu, and Y. Ma, “Mining Association Rules with Multiple Minimum Supports,” Proc. ACM SIGKDD, pp. 337-341, 1999.

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.

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.

G.I. Webb and S. Zhang, “k-Optimal Rule Discovery,” Data Mining and Knowledge Discovery, vol. 10, no. 1, pp. 39-79, 2005.

Cohen, Edith, et al. Finding Interesting Associations without Support Pruning. IEEE Computer Society, 2000. pp. 489-500.

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.

T. Scheffer, “Finding Association Rules That Trade Support Optimally against Confidence,” Intelligent Data Analysis, vol. 9,pp. 381-395, 2005.

Laszlo Szathmary, Amedeo Napoli and PetkoValtchev (2007) “Towards Rare Itemset Mining” Proc. of the 19th IEEE ICTAI, Vol. 1,pp. 305-312.

Koh Y.S., Rountree N. And O’Keefe R.A (2006) “Finding Non-Coincidental Sporadic Rules Using Apriori-Inverse” Int’l J. Data Warehousing and Mining, vol. 2, pp. 38-54.

H. Mannila, “Database Methods for Data Mining,” Proc. Fourth Int’l Conf. Knowledge Discovery and Data Mining (Tutorial), 1998.

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.

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.

S. Brin, R. Motwani, and C. Silverstein, “Beyond Market Baskets: Generalizing Association Rules to Correlations,” Proc. 1997 ACM SIGMOD, pp. 265-276, 1997.

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.

T. Scheffer, “Finding Association Rules That Trade Support Optimally against Confidence,” Intelligent Data Analysis, vol. 9, pp. 381-395, 2005.

J. Li and Y. Zhang, “Direct Interesting Rule Generation,” Proc.Third IEEE Int’l Conf. Data Mining, pp. 155-162, 2003.

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

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.

A.M. Liebetrau, Measures of Association. Sage Publications, 1983.

G. Piatetsky-Shapiro, “Discovery, Analysis, and Presentation of Strong Rules,” Knowledge Discovery in Databases, pp. 229-248, AAAI/MIT Press, 1991.

Vaibhav Kant Singh, Vijay Shah, Yogendra Kumar Jain, Anupam Shukla, A.S. Thoke, Vinay Kumar Singh, Chhaya Dule, Vivek Parganiha,” Proposing an Efficient Method for Frequent Pattern Mining”, World Academy of Science, Engineering and Technology 48 2008.

AILab. Zoo dataset. [Online] January 2007. http://magix.fri.uni-lj.si/orange/doc/datasets /zoo.htm


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.