DISCOVERING CLOSED ITEMS BASED ON LOGIC PATTERN
Keywords:
Association Rules, Bi-Implication, Closed And Dependent Items, Minimum Confidence, Propositional LogicAbstract
In Data Mining, to discover closed item’s relation among the items, association rule can be used. I propose a method to find closed and dependent items using propositional logic property Biimplication. Generating association rules, finding confidence of rules and apply propositional logic with consideration of minimum confidence we can find closed items, thereby we can consider those items as closed and dependable items one on each other.
References
. Prasadh.K and Sutherr.T: Logic based pattern detection based on multi-level propositional process: International journal of computer science & engineering technology (IJCSET), Vol.3 No.12 Dec 2012.
. K.Srinivas, G.Raghavenddra Rao and A.Govardhan: Mining Association Rules from large datasets towards diseases prediction: International Conference on information and computer Networks(ICICN 2012)IPCSIT vol27,2012.
. CH.Sandeep Kumar, K.Srinivas, PeddiKishor, T.Bhaskar: An alternative approach to mine Association rules,:2011 IEEE
. Alex Tze Hiang Sim, aria Indrawan, Samar Zutshi and Bala Srinivasan:Logic-Based Pattern Discovery:IEEE Transactions on knowledge and data engineering, VOL.22,No.6,june 2010.
. LUO Junwei and Zhang Bo: Research on mining positive and negative association rules: International conference on computer and communication technologies in agriculture engineering 2010.
. S.L. Hershberger, D.G. Fisher, Measures of Association (Encyclopedia of Statistics in Behavioral Science), JohnWiley & Sons, 2005.
. Chia-Wen Liao, Yeng-Horng Perng, Tsung-Lung Chiang Discovery unapparent association rules based on Extracted probability, Journal Decision Support Systems Volume 47 Issue 4, November, 2009
. Yun Sing Koh1 Russel Pears Rare Association Rule Mining via Transaction Clustering Seventh Australasian Data Mining Conference (AusDM 2008), Glenelg, Australia.
. Jiawei, H., Jian, P., Yiwen, Y., Runying, and M.: Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 53–87 (2004).
. R. Agarwal, C. Aggarwal, and V. V. V. Prasad. A tree projection algorithm for generation of frequent item sets. In Journal of Parallel and Distributed Computing (Special Issue on High Performance Data Mining), 2000.
