ICTACT Journal on Soft Computing

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Enhanced Algorithms for Mining Optimized Positive and Negative Association Rule from Cancer Dataset


Affiliations
1 Department of Computer Science Engineering, Noorul Islam University, India
2 Department of Computer Applications, Hindustan College of Arts and Science, India
     

   Subscribe/Renew Journal


The most important research aspect nowadays is the data. Association rule mining is vital mining used in data which mines many eventual informations and associations from enormous databases. Recently researchers focus many research challenges to association rule mining. The first challenge is the generation of the frequent and infrequent itemsets from a large dataset more accurately. Secondly how effectively the positive and negative association rule can be mined from both the frequent and infrequent itemsets with high confidence, good quality, and high comprehensibility with reduced time. Predominantly in existing algorithms the infrequent itemsets is not taken into account or rejected. In recent times it is said that useful information are hidden in this itemsets in the case of medical field. The third challenge are to generate is optimised positive and negative association rule. Several existing algorithms have been implemented in order to assure these challenges but many such algorithms produces data losses, lack of efficiency and accuracy which also results in redundant rules. The major issue in using this analytic optimizing method are specifying the activist initialization limit was the quality of the association rule relays on. The proposed work has three methods which mine an optimized PAR and NAR. The first method is the Apriori_AMLMS (Accurate multi-level minimum support) this algorithm derives the frequent and the infrequent itemsets very accurately based on the user-defined threshold minimum support value. The next method is the GPNAR (Generating Positive and Negative Association Rule) algorithm to mine the PAR and NAR from frequent itemsets and PAR and NAR from infrequent itemsets. The third method are to obtain an optimized PAR and NAR using the decidedly efficient swarm intelligence algorithm called the Advance ABC (Artificial Bee Colony) algorithm which proves that an efficient optimized Positive and negative rule can be mined. The Advance ABC is a Meta heuristic technique stimulated through the natural food foraging behaviour of the honey bee creature. The experimental analysis shows that the proposed algorithm can mine exceedingly high confidence non redundant positive and negative association rule with less time.

Keywords

Data Mining, Association Rule Mining, Apriori Algorithm, Accurate Multi Level and Multi Support, Advance ABC Algorithm, GPNAR.
Subscription Login to verify subscription
User
Notifications
Font Size

  • Nikky Suryawanshi Rai, Susheel Jain and Anurag Jain, “Mining Interesting Positive and Negative Association Rule Based on Improved Genetic Algorithm”, International Journal of Advanced Computer Science and Applications, Vol. 5, No. 1, pp. 160-165, 2014.

  • Azadeh Soltani and M.R. Akbarzadeh, “Confabulation-Inspired Association Rule Mining for Rare and Frequent Itemsets”, IEEE Transactions on Neural Networks and Learning Systems, Vol. 25, No. 11, pp. 2053-2064, 2014.

  • Li-Min Tsai, Shu-Jing Lin and Don-Lin Yang, “Effective Mining of Generalized Negative Association Rules”, Proceedings of IEEE Conference on Granular Computing, pp. 113-117, 2010.

  • Christian Hidber, “Online Association rule mining”, Proceedings of International Conference on Management of Data, pp. 145-156, 1999.

  • Li Min Tsai, Shu Jing Lin and Don Lin Yang, “Effective Mining of Generalized Negative Association Rules”, Proceedings of International Conference on Granular Computing, pp. 163-167, 2010.

  • Xiangjun Dong, Zhendong Niu, Donghua Zhu, Zhiyun Zheng and Qiuting Jia, “Mining Interesting Infrequent and Frequent Itemset based on MLMs Model”, International Conference on Advanced Data Mining and Applications, pp. 444-451, 2008.

  • Xiangjun Dong, “Ming Interesting Infrequent and Frequent Itemset Based on Minimum Correlation Strength”, Springer, 2011.

  • K. Mythili and K. Yasodha, “A Pattern Taxonomy Model with New Pattern Discovery Model for Text Mining”, International Journal of Science and Applied Information Technology, Vol. 1, No. 3, pp. 115-119, 2012.

  • Charushila Kadu, Praveen Bhanodia and Pritesh Jain, “Hybrid Approach to Improve Pattern Discovery in Text Mining”, International Journal of Advanced Research in Computer and Communication Engineering, Vol. 2, No. 6, pp. 2477-2481, 2013.

  • Zhen Hai, Kuiyu Chang, Jung-Jae Kim and Christopher C. Yang, “Identifying Features in Opinion Mining via Intrinsic and Extrinsic Domain Relevance”, IEEE Transactions on Knowledge and Data Engineering, Vol. 6, No. 6, pp. 623-634, 2012.

  • Spyros I. Zoumpoulis, Michail Vlachos, Nikolaos M. Freris and Claudio Lucchese, “Right-Protected Data Publishing with Provable Distance-based Mining”, IEEE Transactions on Knowledge and Data Engineering, Vol. 21, No. 19, pp. 2014-2028, 2012.

  • K. Aas and L. Eikvil, “Text Categorisation: A Survey”, Technical Report, Norwegian Computing Center, 1999.

  • R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules in Large Databases”, Proceedings of 20th International Conference on Very Large Data Bases, 1994, pp. 478-499, 1994.

  • Dipti S. Charjan and Mukesh A. Pund, “Pattern Discovery For Text Mining using Pattern Taxonomy”, International Journal of Engineering Trends and Technology, Vol. 4, No. 10, pp. 22-26, 2013.

  • J. Han and K.C.C. Chang, “Data Mining for Web Intelligence”, Computer, Vol. 35, No. 11, pp. 64-70, 2002.

  • J. Han, J. Pei and Y. Yin, “Mining Frequent Patterns without Candidate Generation”, Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 1-12, 2000.

  • Rupesh Dewang and Jitendra Agarwal, “A New Methods for Generating All Positive and Negative Association Rules”, International Journal on Computer Science and Engineering, Vol. 3, No. 4, pp. 1649-1657, 2011.

  • I. Berin Jeba Jingle and J. Jeya A. Celin, “Markov Model in Discovering Knowledge in Text Mining”, Journal of Theoretical and Applied Information Technology, Vol. 70, No. 3, pp. 459-463, 2014.

  • I. Berin Jeba Jingle and J. Jeya A. Celin, “Discovering Useful Patterns in Text Mining using AMLMS-GA Algorithm”, International Journal of Applied Engineering Research, Vol. 10, No.18, pp. 39763-39767, 2015.

  • Idheba Mohamad Ali O. Swesi, Azuraliza Abu Bakar and Anis Suhailis Abdul Kadir, “Mining Positive and Negative Association Rules from Interesting Frequent and Infrequent Itemsets”, Proceedings of IEEE Conference Publication, pp. 650-655, 2012.

  • Xiangjun Dong, Zhendong Niu, Xuelin Shi, Xiaodan Zhang and Donghua Zhu, “Mining Both Positive and Negative Association Rules from Frequent and Infrequent Itemsets”, International Conference on Advanced Data Mining and Applications, pp. 122-133, 2007.

  • X. Xing, Yao Chen and Yan-En Wang, “Study on Mining Theories of Association Rules and its Application”, Proceedings of International Conference on Information Technology and Ocean Engineering, pp. 343-347, [23] I. Berin Jeba Jingle and J. Jeya A. Celin, “Mining Optimized Positive and Negative Association Rule using Advance ABC Algorithm”, Journal of Theoretical and Applied Information Technology, Vol. 95, No. 24, pp. 6846-6855, 2017.


Abstract Views: 226

PDF Views: 4




  • Enhanced Algorithms for Mining Optimized Positive and Negative Association Rule from Cancer Dataset

Abstract Views: 226  |  PDF Views: 4

Authors

I. Berin Jeba Jingle
Department of Computer Science Engineering, Noorul Islam University, India
A. Celin
Department of Computer Applications, Hindustan College of Arts and Science, India

Abstract


The most important research aspect nowadays is the data. Association rule mining is vital mining used in data which mines many eventual informations and associations from enormous databases. Recently researchers focus many research challenges to association rule mining. The first challenge is the generation of the frequent and infrequent itemsets from a large dataset more accurately. Secondly how effectively the positive and negative association rule can be mined from both the frequent and infrequent itemsets with high confidence, good quality, and high comprehensibility with reduced time. Predominantly in existing algorithms the infrequent itemsets is not taken into account or rejected. In recent times it is said that useful information are hidden in this itemsets in the case of medical field. The third challenge are to generate is optimised positive and negative association rule. Several existing algorithms have been implemented in order to assure these challenges but many such algorithms produces data losses, lack of efficiency and accuracy which also results in redundant rules. The major issue in using this analytic optimizing method are specifying the activist initialization limit was the quality of the association rule relays on. The proposed work has three methods which mine an optimized PAR and NAR. The first method is the Apriori_AMLMS (Accurate multi-level minimum support) this algorithm derives the frequent and the infrequent itemsets very accurately based on the user-defined threshold minimum support value. The next method is the GPNAR (Generating Positive and Negative Association Rule) algorithm to mine the PAR and NAR from frequent itemsets and PAR and NAR from infrequent itemsets. The third method are to obtain an optimized PAR and NAR using the decidedly efficient swarm intelligence algorithm called the Advance ABC (Artificial Bee Colony) algorithm which proves that an efficient optimized Positive and negative rule can be mined. The Advance ABC is a Meta heuristic technique stimulated through the natural food foraging behaviour of the honey bee creature. The experimental analysis shows that the proposed algorithm can mine exceedingly high confidence non redundant positive and negative association rule with less time.

Keywords


Data Mining, Association Rule Mining, Apriori Algorithm, Accurate Multi Level and Multi Support, Advance ABC Algorithm, GPNAR.

References