Associative Classification Algorithm Research Articles

Evaluation of Academic Self-Efficiency, Community Feeling, and Academic Achievement of Students in the Process of the Covid-19 Pandemic by Data Mining Techniques

Thanks to the advancement of technology, vast amounts of data are being generated in various fields on a daily basis. The research on identifying hidden patterns and extracting useful information from big data has become increasingly important. In the field of education, the availability of large datasets has allowed for the emergence of data mining techniques as an alternative to traditional statistical methods. Unlike traditional statistical methods, data mining can uncover hidden relationships between variables, thus avoiding the loss of valuable information and enabling the utilization of essential data in education. By unlocking valuable insights and predicting important relationships, educational data mining (EDM) has the potential to enhance and improve the quality of education. This study aims to demonstrate the predictive power of EDM through a sample application and draw attention to its implications. The dataset used in this study consists of survey responses collected from university students. The variables in the dataset include academic self-efficacy, sense of community, academic achievement averages, and various demographic variables of distance education students. Descriptive modeling was employed to identify latent patterns between variables, while a predictive model was utilized to estimate variables. In order to achieve this, both association rule mining and classification algorithms were employed. The findings of this study indicate that EDM can effectively identify relationships between variables and make accurate predictions.

Retracted: Nursing Diagnosis of Urology Operating Room Based on New Association Classification Algorithm

Retracted: Nursing Diagnosis of Urology Operating Room Based on New Association Classification Algorithm

Multi-Label Classification Based on Associations

Associative classification (AC) has been shown to outperform other methods of single-label classification for over 20 years. In order to create rules that are both more precise and simpler to grasp, AC combines the rules of mining associations with the task of classification. However, the current state of knowledge and the views of various specialists indicate that the issue of multi-label classification (MLC) cannot be solved by any AC method. Since this is the case, adapting or using an AC algorithm to manage multi-label datasets is one of the most pressing issues. To solve the MLC issue, this research proposes modifying the classification based on associations (msCBA) method by extending its capabilities to consider more than one class label in the consequent of its rules and modifying its rules order procedure to fit the nature of the multi-label dataset. The proposed algorithm outperforms several other MLC algorithms from various learning techniques across a variety of performance measuresand using six datasets with different domains. The main findings of this research are the significance of utilizing the local dependencies among labels compared to global dependencies, and the important rule of AC in solving the problem of MLC.

An Intelligent Technique to Predict the Autism Spectrum Disorder Using Big Data Platform

Autism or autism spectrum disorder (ASD) is considered a psychiatric disorder. It is a condition that puts constraints on the use of linguistic, cognitive, communicative, and social skills and abilities. Recently, many data mining techniques have been developed to help autism patients by discovering the main features of the condition and the correlation between them. In this paper, we employ the association classification (AC) technique as a data mining approach to predict whether or not an individual has an autism. The Intelligent Classification Based on Association rules (ICBA) algorithm is proposed for finding the correlations between the features to decide whether an individual has autism in its early stage, especially in childhood. The ICBA algorithm incorporates the chi-square method to select the best feature to make the decision, in addition to proposing new techniques in all phases and increasing number of folds to 2size of data/10. The proposed algorithm is compared against four well-known AC algorithms in terms of accuracy to evaluate their behavior in the prediction task using big data platform. The results show a better performance for the ICBA algorithm in most experiments. Moreover, all of the considered algorithms had an increased level of accuracy when the chi-square method was used.

Handling Class Imbalance and Class Overlap in Machine Learning Applications for Undeclared Work Prediction

Undeclared work is a composite socioeconomic matter severely affecting the welfare of workers, legitimate companies, and the state by issuing unfair competition in the labour market and causing considerable state revenue losses by tax evasion. Labour inspectorates are tasked to deal effectively with this issue but usually lack adequate resources and proper tools, yet they own large volumes of past inspection data that, if aptly processed through innovative machine learning techniques, may produce understandable insights into the extent and prevailing patterns of undeclared work and efficient tools to address it. Such datasets are typically imbalanced regarding undeclared work, and contain overlapping inspection discoveries, two issues that impede the learning process. This research points to the problems of class imbalance and class overlap in this domain and applies combinations of data engineering techniques to address them using a dataset of 16.7 K actual labour inspections. Three associative classification algorithms are employed, and multiple classifiers are built and assessed for their predictability and interpretability. The study indicates the overall benefits for the inspection authorities when integrating machine learning methods in targeting undeclared work and proves considerable prediction performance improvement when following data engineering approaches to address the class imbalance and class overlap issues.

An Integrated Classification and Association Rule Technique for Early-Stage Diabetes Risk Prediction.

The number of diabetic patients is increasing yearly worldwide, requiring the need for a quick intervention to help these people. Mortality rates are higher for diabetic patients with other serious health complications. Thus, early prediction for such diseases positively impacts healthcare quality and can prevent serious health complications later. This paper constructs an efficient prediction system for predicting diabetes in its early stage. The proposed system starts with a Local Outlier Factor (LOF)-based outlier detection technique to detect outlier data. A Balanced Bagging Classifier (BBC) technique is used to balance data distribution. Finally, integration between association rules and classification algorithms is used to develop a prediction model based on real data. Four classification algorithms were utilized in addition to an a priori algorithm that discovered relationships between various factors. The named algorithms are Artificial Neural Network (ANN), Decision Trees (DT), Support Vector Machines (SVM), and K Nearest Neighbor (KNN) for data classification. Results revealed that KNN provided the highest accuracy of 97.36% compared to the other applied algorithms. An a priori algorithm extracted association rules based on the Lift matrix. Four association rules from 12 attributes with the highest correlation and information gain scores relative to the class attribute were produced.

Interpretable failure risk assessment for continuous production processes based on association rule mining

Continuous production processes are often highly complex and involve machine failures as well as unscheduled process downtimes. Failures result in the production of waste and in high opportunity costs, but their causes are not always apparent to machine operators. As a result, identifying failure root causes and avoiding risky process states is of high interest for producers. This work presents an approach for a data-driven failure risk assessment that is validated on real-world process data of a nonwovens production line. In this approach, association rule mining is adapted to continuous processes for producing highly interpretable results in the form of association rules that represent the main causes for failures. The methodology includes data preparation, modelling of production states and the evaluation of root causes using an associative classification algorithm. The result of this paper is a method for an interpretable risk assessment in continuous production processes. By using the method in live production, causes of failures can be detected and interpreted. The universal structure of the developed method supports applications in many other continuous production processes.

Packer classification based on association rule mining

Detecting packer programs is a key step in the defense against malicious programs and plays a key role in cyber security defenses. One challenge with packer classification is that many features have been used and their individual significance is unknown. An effective approach for building classifiers without requiring prior knowledge of feature significance is to use associative classification (AC) algorithms, which combine association rules and classification. This work considers many different AC algorithms for the challenge of packer detection. Novel variations of many of these algorithms are also developed to address challenges related to having many features of varying types. The effectiveness of the classifiers produced by these algorithms is evaluated, including over time as packers and malware evolve.

Nursing Diagnosis of Urology Operating Room Based on New Association Classification Algorithm.

Due to the rapid development of medical engineering, massive amounts of data are recorded and preserved by various medical instruments. Therefore, finding relationships among data and summarizing clinical manifestations are of great significance to the diagnosis, treatment, and medical research of various diseases. The key to studying the nursing diagnosis support system, particularly in the urological operating room, is to select an effective classification algorithm, which is suitable for the characteristics of urological diseases. Initially, we have analyzed characteristics of urological diseases through medical data mining. Secondly, based on the traditional data mining classification method and urological disease diagnosis research, we have introduced the urological disease experimental source dataset and analyzed characteristics of the disease. Furthermore, classification algorithm and steps were introduced such as decision tree (including ID3, C4.5), Bayesian classification, BP neural network, and association rule classification algorithms. These algorithms are used to make relevant comparative experiments on the urological disease dataset. Finally, based on the diagnosis of urological diseases, a new association classification algorithm (ACCF), which is based on frequent closed item sets, is proposed along with suitable explanation. In order to verify the operational capabilities, the proposed algorithms are implemented in C++ and compared with the classification effect of traditional association classification algorithms and data mining methods. Both theoretical analysis and experiment results show that the proposed algorithm has resolved various deficiencies of the existing data mining algorithms and equally improved the accuracy of urological disease classification and prediction.

Research on Detection and Diagnosis Technology of Subarachnoid Hemorrhage Based on New Association Classification Algorithm

Subarachnoid hemorrhage (SAH) is one of the most common cerebrovascular emergencies, which can lead to serious consequences. Spontaneous subarachnoid hemorrhage accounts for about 15% of acute cerebrovascular accidents. Among them, spontaneous subarachnoid hemorrhage caused by rupture of an intracranial aneurysm or vascular malformation is more common, accounting for about 85%. Therefore, it is very important to detect the early symptoms of subarachnoid hemorrhage through reasonable means and to carry out appropriate clinical intervention and treatment. With the development of imaging technology, computed tomography angiography (CTA) is widely used in clinical practice. However, the accuracy of manual recognition of CT images is not very high, and the efficiency is low. The emergence of data mining technology is gradually solving this problem. In this paper, we introduce and summarize the development of data mining, domestic and foreign research progress, the application status of data mining in the medical field, and the main technologies and methods of data mining. We study the application of association rule extraction technology in data mining in the medical field. The Apriori algorithm for finding frequent item sets in association rule extraction and its series of improved algorithms are studied and finally combined the characteristics of medical CT images, an image mining method of association rules based on the gray-level cooccurrence matrix is proposed. Based on the FP-growth algorithm, the NCFP-growth algorithm based on association rules is proposed and compared with the mining effect of several other algorithms. The proposed algorithm achieves a classification accuracy of above 90%, which is higher than the Apriori algorithm and its improved variations.

Addressing the issue of undeclared work – Part I: Applying associative classification per the CRISP-DM methodology

Addressing undeclared work is a high priority in the labor field for government policymakers since it adversely affects all involved parties and results in significant losses in tax and social security contribution revenues. In the last years, the wide use of ICT in labor inspectorates and the considerable progress in data exchange have resulted in numerous databases dispersed in various units, yet these are not effectively used to increase their functions productivity. This study presents a detailed analysis of a data mining project per the CRISP-DM methodology aiming to assist the labor inspectorates in dealing with undeclared work and other labor law violations. It uses real past inspections data merged with companies characteristics and their employment details and examines the application of two Associative Classification algorithms, the CBA and CBA2, in combination with two types of datasets, a binary and a four-class. The produced models are assessed per the data mining goals and per the initial business objectives, and the research concludes proposing an innovative inspections recommendation tool proved to offer two major benefits: a mechanism for planning targeted inspections of improved efficiency and a knowledge repository for enhancing the inspectors understanding of those features linked with labor law violations.

A combinatorial optimization approach for multi-label associative classification

Mining associations between variables corresponding to multiple class labels (or outcomes) is prevalent in various applied domains, such as medical diagnosis, text mining, e-commence, and social behavior analysis. While most associative classification algorithms have been developed to discover association rules of binary variables for single-label classification problem, there are limited methods designed for the problem, called multi-label classification, that accounts for multi-labels. In this study, we consider the multi-label classification problem as a multi-class classification problem and formulate it as a 0–1 integer optimization model. We then leverage combinatorial optimization and association rule techniques to solve this hard problem. More specifically, we propose a ranking metric for selecting and aggregating stronger rules to form an optimal multi-label classifier. The computational results for multiple real applications show that our algorithm is able to identify significant association rules between key variables and multiple labels, and in turn achieves a competitive classification performance compared to state-of-the-art machine learning methods such as logistic regression, decision trees, and random forest. Moreover, we design a user-interface tool interfaced with the developed algorithm and demonstrate a medical diagnosis problem to predict multiple high-risk subgroups during emergency care in practice.

Embedded electronic medical record text data mining using neural network association classification algorithm

AbstractThe embedded electronic medical record (EMR) information is analysed through a neural network algorithm in the field of deep learning to mine the main sentence of EMR text. The pure convolutional neural network model (PCNN) based on pooled and non‐pooled analysis is constructed based on deep learning CNN to mine EMR text. An association classification algorithm based on neural network is proposed, which integrates classification rules into the neural network and realizes the rapid establishment of neural network structure and parameter setting. Character embedding is imported and combined with a sliding window. Then, CNN is adopted to classify the Chinese character tags of the neural network model. Finally, the model is applied to the word segmentation of the actual pregnant women's EMR text. The results show that the scores of the Biomedical Engineering Society and Bioelectronics in Peking University and Microsoft Reserved Partition datasets are between 0.9516 and 0.9684 and the performance is basically the same, which shows that the model has strong stability. The performance of the max‐pooling, n‐max pooling, and mean‐pooling are all between 0.8004 and 0.8634, but the above results are not as good as the model without pooling layer. For this new fast method to obtain neural network parameters, once the classification rules are given, the parameters in PCNN can be set quickly, and provide a practical basis for the development of deep learning in the medical field.

Reliable Distributed Fuzzy Discretizer for Associative Classification of Big Data

Data Mining is an essential task because the digital world creates huge data daily. Associative classification is one of the data mining task which is used to carry out classification of data, based on the demand of knowledge users. Most of the associative classification algorithms are not able to analyze the big data which are mostly continuous in nature. This leads to the interest of analyzing the existing discretization algorithms which converts continuous data into discrete values and the development of novel discretizer Reliable Distributed Fuzzy Discretizer for big data set. Many discretizers suffer the problem of over splitting the partitions. Our proposed method is implemented in distributed fuzzy environment and aims to avoid over splitting of partitions by introducing a novel stopping criteria. Proposed discretization method is compared with existing distributed fuzzy partitioning method and achieved good accuracy in the performance of associative classifiers.

Efficient Rule Generation for Associative Classification

Associative classification (AC) is a mining technique that integrates classification and association rule mining to perform classification on unseen data instances. AC is one of the effective classification techniques that applies the generated rules to perform classification. In particular, the number of frequent ruleitems generated by AC is inherently designated by the degree of certain minimum supports. A low minimum support can potentially generate a large set of ruleitems. This can be one of the major drawbacks of AC when some of the ruleitems are not used in the classification stage, and thus (to reduce the rule-mapping time), they are required to be removed from the set. This pruning process can be a computational burden and massively consumes memory resources. In this paper, a new AC algorithm is proposed to directly discover a compact number of efficient rules for classification without the pruning process. A vertical data representation technique is implemented to avoid redundant rule generation and to reduce time used in the mining process. The experimental results show that the proposed algorithm archives in terms of accuracy a number of generated ruleitems, classifier building time, and memory consumption, especially when compared to the well-known algorithms, Classification-based Association (CBA), Classification based on Multiple Association Rules (CMAR), and Fast Associative Classification Algorithm (FACA).

Classification of application reviews into software maintenance tasks using data mining techniques

Mobile application reviews are considered a rich source of information for software engineers to provide a general understanding of user requirements and technical feedback to avoid main programming issues. Previous researches have used traditional data mining techniques to classify user reviews into several software maintenance tasks. In this paper, we aim to use associative classification (AC) algorithms to investigate the performance of different classifiers to classify reviews into several software maintenance tasks. Also, we proposed a new AC approach for review mining (ACRM). Review classification needs preprocessing steps to apply natural language preprocessing and text analysis. Also, we studied the influence of two feature selection techniques (information gain and chi-square) on classifiers. Association rules give a better understanding of users’ intent since they discover the hidden patterns in words and features that are related to one of the maintenance tasks, and present it as class association rules (CARs). For testing the classifiers, we used two datasets that classify reviews into four different maintenance tasks. Results show that the highest accuracy was achieved by AC algorithms for both datasets. ACRM has the highest precision, recall, F-score, and accuracy. Feature selection helps improving the classifiers’ performance significantly.

Intelligent Association Classification Technique for Phishing Website Detection

Many critical applications need more accuracy and speed in the decision making process. Data mining scholars developed set of artificial automated tools to enhance the entire decisions based on type of application. Phishing is one of the most critical application needs for high accuracy and speed in decision making when a malicious webpage impersonates as legitimate webpage to acquire secret information from the user. In this paper, we proposed a new Association Classification (AC) algorithm as an artificial automated tool to increase the accuracy level of the classification process that aims to discover any malicious webpage. An Intelligent Association Classification (IAC) algorithm developed in this article by employing the Harmonic Mean measure instead of the support and confidence measure to solve the estimation problem in these measures and discovering hidden pattern not generated by the existing AC algorithms. Our algorithm compared with four well-known AC algorithm in terms of accuracy, F1, Precision, Recall and execution time. The experiments and the visualization process show that the IAC algorithm outperformed the others in all cases and emphasize on the importance of the general and specific rules in the classification process

Software defect prediction based on correlation weighted class association rule mining

Software defect prediction based on supervised learning plays a crucial role in guiding software testing for resource allocation. In particular, it is worth noticing that using associative classification with high accuracy and comprehensibility can predict defects. But owing to the imbalance data distribution inherent, it is easy to generate a large number of non-defective class association rules, but the defective class association rules are easily ignored. Furthermore, classical associative classification algorithms mainly measure the interestingness of rules by the occurrence frequency, such as support and confidence, without considering the importance of features, resulting in combinations of the insignificant frequent itemset. This promotes the generation of weighted associative classification. However, the feature weighting based on domain knowledge is subjective and unsuitable for a high dimensional dataset. Hence, we present a novel software defect prediction model based on correlation weighted class association rule mining (CWCAR). It leverages a multi-weighted supports-based framework rather than the traditional support-confidence approach to handle class imbalance and utilizes the correlation-based heuristic approach to assign feature weight. Besides, we also optimize the ranking, pruning and prediction stages based on weighted support. Results show that CWCAR is significantly superior to state-of-the-art classifiers in terms of Balance, MCC, and Gmean.

Predicting Autism Spectrum Disorder using Machine Learning Technique

Autism Spectrum Disorder (ASD) is a psychiatric disorder that puts constraints on the ability to use of cognitive, linguistic, communicative, and social skills. Recently, many data mining techniques employed to serve this domain by determining the main features of the condition and the correlation between them. In this article, we investigate the Association Classification (AC) technique as a data mining technique in predicting whether an individual has autism or not. Accordingly, seven well-known algorithms are selected to conduct analysis and evaluation of the performance of the AC technique in term of identifying correlations between the features to help decide early on whether an individual has autism; this is particularly significant for children. The evaluation for the behavior and the performance in the prediction tasks for the AC algorithms was conducted for the common metrics of including Precision, Accuracy F-Measure as well as Recall. Finally, a comparative performance analysis among the algorithms was used as final result for the study. The results show better performance for the WCBA algorithm in most test scenarios with accuracy of 97 % although, the majority of algorithms exhibited excellent accuracy when applied in this domain.

A Novel Approach for Associative Classification Based on Information Entropy of Frequent Attribute Set

Associative Classification (AC) is envisioned as one of the most attractive classification approaches to facilitate managers for prediction and decision making in a highly accurate and easily interpretable way. The most of existing AC algorithms mainly focus on the two static metrics of association rules: support and confidence. However, in this paper, we identify a potential limitation of the confidence and further point out these AC algorithms merely consider the explicit expression of classification information and knowledge of Class Association Rules (CARs) and neglect the implicit expression of classification information and knowledge of CARs. And even the explicit expression of classification information and knowledge of CARs is equivalent, the implicit expression of classification information and knowledge of them may be different. Thus, these CARs will cause different influence on prediction or decision-making in terms of the interpretability and rationality of classification, and will result in predictive bias or decision-making bias in practice. In response to this drawback, we introduce the notion of information entropy and propose an innovative approach for associative classification based on information entropy of frequent attribute set, named EAC. Different from the existing schemes, the proposed EAC algorithm enjoys the following promising merits: (1) lower predictive bias or decision-making bias by levering the information entropy of frequent attribute set; (2) better interpretability and rationality by setting higher support threshold; (3) setting global optimum parameter dynamically through repeated trials with reducing the dimension of data sets. Experiments on 20 well-known benchmark data sets demonstrate that our EAC approach is highly competitive to other state-of-the-art AC algorithms in terms of predictive bias or decision-making bias, interpretability, and efficiency, which can be used to construct a new classifier efficiently and effectively in many realistic scenarios.