ENHANCED ALGORITHMS FOR MINING OPTIMIZED POSITIVE AND NEGATIVE ASSOCIATION RULE FROM CANCER DATASET
Journal Title: ICTACT Journal on Soft Computing - Year 2018, Vol 8, Issue 2
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.
Authors and Affiliations
Berin Jeba Jingle I, Jeya ACelin J
Keywords
Related Articles
- EP ID EP532386
- DOI 10.21917/ijsc.2018.0221
- Views 59
- Downloads 0
AN ENSEMBLE APPROACH FOR SENTIMENT CLASSIFICATION: VOTING FOR CLASSES AND AGAINST THEM
Sentiment denotes a person's opinion or feeling towards a subject that they are discussing about in that conversation. This has been one of the most researched and industrially promising fields in natural language proces...
OPTIMUM PARAMETERS SELECTION USING BACTERIAL FORAGING OPTIMIZATION FOR WEIGHTED EXTREME LEARNING MACHINE
Extreme Learning Machine (ELM) is a Single Layer Feed Forward Network (SLFN) model with extremely learning capacity and good generalization capabilities. Generally, the performance of ELM for classification task highly b...
AN IMPLEMENTATION OF EIS-SVM CLASSIFIER USING RESEARCH ARTICLES FOR TEXT CLASSIFICATION
Automatic text classification is a prominent research topic in text mining. The text pre-processing is a major role in text classifier. The efficiency of pre-processing techniques is increasing the performance of text cl...
INTERPRETATION OF ECG USING MODIFIED INTUITIONISTIC FUZZY C-MEANS CLUSTERING FOR ARRHYTHMIA DATA
An electrocardiogram (ECG) is defined as a measure of variation in the electrical activity of the heart and is broadly used in detection and classification of heart-related diseases. The abnormalities present in the hear...
AN APPROACH FOR AUTO-GENERATING SOLUTION TO USER-GENERATED MEDICAL CONTENT USING DEEP LEARNING TECHNIQUES
One of many things humans are obsessive about is health. Presently, when faced with a health-related issue one goes to the web first, to find closure to his/her problem. The community Question Answering (cQA) forum allow...