Open Access Open Access  Restricted Access Subscription or Fee Access

Mining Highly Qualitative Multidimensional Association Rules

E. Ramaraj, N. Venkatesan

Abstract


The tremendous growth in data has generated the need for new techniques that can intelligently transform the massive data into useful information and knowledge. Data Mining is such a technique that extracts non-trivial, implicit, previously unknown and potentially useful information from the data in databases. Association Rule Mining is one of the most important and well researched techniques of data mining. It aims to extract interesting correlations, frequent patterns, associations of casual structures among sets of items in the transaction databases or other data repositories. Association rules are widely used in market databases, spatial databases, biological databases, medical databases and crime databases. This paper focuses a new algorithm to mine both positive and negative rules from the real time surveyed medical database. Association rules are defined as implication of the form A B where A and B are frequent itemsets in a transaction database. This new algorithm extends this definition to include association rules of forms A  ^B, ^A  B and ^A  ^B, which indicate negative associations between itemsets is called negative rules. Negative rules are generated from infrequent itemsets using multi dimensional data model.

Keywords


Data Mining, Association Rules, Infrequent Itemsets Negative Rules.

Full Text:

PDF

References


Chris Cornelis, Peng Yan, Xing Zhang, Guoqing Chen Mining Posititive and Negative Rules from Large databases IEEE conference 2006.

Xiaohui Yuan, Bill P. Buckles, Xhaoshan Yuan, Jian Zhang Mining Negative Association Rules

Mario Luiza antonic, Osmar R. Zaiane Mining Positive and Negative Association Rules – an approach for confine rules

M.L. Antonie and O.R. Za¨ıane, ”Mining Positive and Negative Association Rules: an Approach for Confined Rules”, Proc. Intl. Conf. on Principles and Practice of Knowledge Discovery in Databases, 2004, pp 27–38.

A. Savasere, E. Omiecinski and S. Navathe, ”Mining for Strong Negative Associations in a Large Database of Customer Transactions”, Proc. Intl. Conf. on Data Engineering, 1998, pp 494–502.

D.R. Thiruvady and G.I. Webb, ”Mining Negative Association Rules Using GRD”, Proc. Pacific-Asia Conf. on Advances in Knowledge Discovery and Data Mining, 2004, pp 161–165.

X. Wu, C. Zhang and S. Zhang, ”Efficient Mining of Both Positive and Negative Association Rules”, ACM Trans. on Information Systems, vol. 22(3), 2004, pp 381–405.

P. Yan, G. Chen, C. Cornelis, M. De Cock and E.E. Kerre, ”Mining Positive and Negative Fuzzy Association Rules”, LNCS 3213, 2004, pp 270–276.

X. Yuan, B.P. Buckles, Z. Yuan and J. Zhang, ”Mining Negative Association Rules”, Proc. Seventh Intl. Symposium on Computers and Communication, Italy, 2002, pp 623–629.

Zhi-Choa Li, Pi-Lian He, Ming Lei, “A High Efficient AprioriTID Algorithm for mining Association rule”, Proceedings of 4th International Conference on machine learning and cybernetics,18-21 AUG 2005.

G. Grahne, and J. Zhu, ”Efficiently using prefix-trees in mining frequent itemsets,” FIMI ’03, Frequent Itemset Mining Implementations, Proceedings of the ICDM 2003

R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A.I. Verkamo. Fast discovery of association rules. Advances in Knowledge Discovery and Data Mining, pages 307–328. MIT Press, 1996.

R. Agrawal and R. Srikant. Fast algorithms for mining association rules. Proceedings 20th International Conference on Very Large Data Bases, pages 487–499.

C. Borgelt and R. Kruse. Induction of association rules: Apriori implementation. In W. H¨ardle and B. R¨onz, editors, Proceedings of the 15th Conference on Computational Statistics, pages 395–400,

Christian Borgelt Efficient implementation of Apriori and Eclat FIMI i04

Tan, P., Kumar, V., Srivastava, J.: Selecting the right interestingness measure for association patterns. In: Proc. of SIGKDD. (2002) 32–41

Lars Schmidt, Thieme Algorithmic features of Eclat – 2004

Bart Goethals Survey on Frequent Patten Mining 2004

Mingju Song and Sanguthevar Rajasekaran A transaction mapping for frequent itemsets mining IEEE transactions on Knowledge and Data Engineering 18(4):472-480, April 2006.

Ke Su, Fengsdhan Bai Mining weighted Association Rules IEEE transactions on KDE 489-5=495, April 2008

Data Mining – Concepts and Techniques, Jiawei Han, Micheline Kamber

Wemnin Li, Jiawei Han, Jian Pei, CMAR: Accurate and Efficient classification base on Multiple class Association Rules

Rajeev Rastogi, Kyuseok Shim Mining Optimized Association Rules with categorical and numerical attributes IEEE trans on KDE vol 14 No.1 Jan/Feb ’02.

P. Shenoy, J. R. Haritsa, S. Sudarshan, G. Bhalotia, M. Bawa, and D. Shah, ”Turbo-charging vertical mining of large databases,” Procedings of ACM SIGMOD Intnational Conference on Management of Data, ACM Press, Dallas, Texas, pp. 22-23, May 2000,

D. Burdick, M. Calimlim, and J. Gehrke, ”MAFIA: a maximal frequent itemset algorithm for transactional databases,” Proceedings of International Conference on Data Engineering, Heidelberg, Germany, pp. 443-452, April 2001,

M.J. Zaki, and K. Gouda, ”Fast vertical mining using diffsets,” Proceedings of the Nineth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, D.C., ACM Press, New York, pp. 326-335, 2003.

Abdul Jabbar KhanP1P, Abdur-Rahim KhanPP, Abdul Haleem Shah and Sanaullah Khan Prevalence of hypertension in diabetic patients in lady reading hospital peshawar (n.w.f.p.) Pakistan


Refbacks

  • There are currently no refbacks.


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