Exploring Associative Classification Technique Using Weighted Utility Association Rules for Predictive Analytics

Author(s):  
Mamta Punjabi ◽  
Vineet Kushwaha ◽  
Rashmi Ranjan
2011 ◽  
Vol 135-136 ◽  
pp. 106-110
Author(s):  
Shou Juan Zhang ◽  
Quan Zhou

A novel classification algorithm based on class association rules is proposed in this paper. Firstly, the algorithm mines frequent items and rules only in one phase. Then, the algorithm ranks rules that pass the support and confidence thresholds using a global sorting method according to a series of parameters, including confidence, support, antecedent cardinality, class distribution frequency, item row order and rule antecedent length. Classifier building is based on rule items that do not overlap in the training phase and rule items that each training instance is covered by only a single rule. Experimental results on the 8 datasets from UCI ML Repository show that the proposed algorithm is highly competitive when compared with the C4.5,CBA,CMAR and CPAR algorithms in terms of classification accuracy and efficiency. This algorithm can offer an available associative classification technique for data mining.


2012 ◽  
Vol 24 (06) ◽  
pp. 513-524
Author(s):  
Mohsen Alavash Shooshtari ◽  
Keivan Maghooli ◽  
Kambiz Badie

One of the main objectives of data mining as a promising multidisciplinary field in computer science is to provide a classification model to be used for decision support purposes. In the medical imaging domain, mammograms classification is a difficult diagnostic task which calls for development of automated classification systems. Associative classification, as a special case of association rules mining, has been adopted in classification problems for years. In this paper, an associative classification framework based on parallel mining of image blocks is proposed to be used for mammograms discrimination. Indeed, association rules mining is applied to a commonly used mammography image database to classify digital mammograms into three categories, namely normal, benign and malign. In order to do so, first images are preprocessed and then features are extracted from non-overlapping image blocks and discretized for rule discovery. Association rules are then discovered through parallel mining of transactional databases which correspond to the image blocks, and finally are used within a unique decision-making scheme to predict the class of unknown samples. Finally, experiments are conducted to assess the effectiveness of the proposed framework. Results show that the proposed framework proved successful in terms of accuracy, precision, and recall, and suggest that the framework could be used as the core of any future associative classifier to support mammograms discrimination.


2019 ◽  
Vol 8 (2S11) ◽  
pp. 3448-3453

Classification is a data mining technique that categorizes the items in a database to target classes. The aim of classification is to accurately find the target class for each instance of the data. Associative classification is a classification method that uses Class Association Rules for classification. Associative classification is found to be often more accurate than some traditional classification methods. The major disadvantage of associative classification is the generation of redundant and weak class association rules. Weak class association rules results in increase in size and decrease in accuracy of the classifier. This paper proposes an efficient approach to build a compact and accurate classifier by using interestingness measures for pruning rules. Interestingness measures play a vital role in reducing the size and increasing the accuracy of classifier by pruning redundant or weak rules. Rules which are strong are retained and these rules are further used to build the classifier. The source of the data used in this paper is University of California Irvine Machine Learning Repository. The approach proposed in this paper is effective and the results show that the approach can produce a highly compact and accurate classifier


Author(s):  
Vasiliy S. Kireev ◽  
Anna I. Guseva ◽  
Pyotr V. Bochkaryov ◽  
Igor A. Kuznetsov ◽  
Stanislav A. Filippov

2011 ◽  
Vol 20 (5) ◽  
pp. 20-28 ◽  
Author(s):  
Prachitee B. Shekhawat ◽  
Sheetal S. Dhande

2021 ◽  
Vol 20 (01) ◽  
pp. 2150010
Author(s):  
Parashu Ram Pal ◽  
Pankaj Pathak ◽  
Shkurte Luma-Osmani

Associations rule mining along with classification rule mining are both significant techniques of mining of knowledge in the area of knowledge discovery in massive databases stored in different geographic locations of the world. Based on such combination of these two, class association rules for mining or associative classification methods have been generated, which, in far too many cases, showed higher prediction accuracy than platitudinous conventional classifiers. Motivated by the study, in this paper, we proposed a new approach, namely IHAC (Incorporating Heuristics for efficient rule generation & rule selection in Associative Classification). First, it utilises the database to decrease the search space and then explicitly explores the potent class association rules from the optimised database. This also blends rule generation and classifier building to speed up the overall classifier construction cycle. Experimental findings showed that IHAC performs better than any further associative classification methods.


Author(s):  
Manish Tiwari ◽  
Tripti Arjariya

The phishing attack is one of the very common attacks deployed using the social engineering techniques. The attack tries to capture the victim’s personal and sensitive information to trick and can results in terms of financial and social reputation loss. In this presented work the main focus is to investigate the phishing techniques and their detection approaches. In this context first a review on recently contributed URL based phishing attack detection and prevision techniques is prepared. Further based on the suitable techniques a new data mining based model is proposed for implementation. The proposed model first take training on phish tank database URLs and then identify the similar pattern based URLs in two classes legitimate and phishing. First the dataset is preprocessed and the features are computed. The computed features are then transformed in terms of transactional database and association rules are prepared. To generate the association rules the apriori algorithm and FP-Tree algorithm is employed. Based on conducted experiments, the performance the FP-Tree based classification technique much efficient and accurate as compared to apriori algorithm, because the apriori algorithm is much time expensive then the FP-Tree. Finally the future extension of the work is also suggested.


Sign in / Sign up

Export Citation Format

Share Document