Rule Pruning Research Articles

Discovery of fault-introducing tool groups with a numerical association rule mining method in a printed circuit board production line

Large-scale manufacturers aim to reduce the number of faulty products by finding tools or process factors that cause product faults through tool monitoring. The causes of faulty electronic components such as semiconductor chips and printed circuit boards (PCBs) include abnormalities in single tools and abnormalities caused by interactions between the tools of a specific process and a related process. Here, the tools exhibiting an interaction effect are called the fault-introducing tool group. This study presents a numerical association rule mining method for discovering the fault-introducing tool groups based on a genetic algorithm. A novel fitness function and rule pruning process are developed to identify the fault-introducing tool groups. The effectiveness of the method is verified using simulations and a case study of actual PCB production lines. The proposed method can discover fault-introducing tool groups better than machine learning algorithms. Additionally, the method can accurately identify fault-introducing tool groups in various manufacturing environments, such as those with highly skewed yield distributions or variations in yield distributions over time. In an actual PCB production line, the groups identified by the proposed method produced up to 36.5% more faulty chips than those identified by the comparison models.

A Novel Incremental Framework for Building Classifier Using Constraint Class Association Rules

Associative classification (AC) performs much better than other traditional classifiers. It generates a huge number of class association rules (CARs). Since users are interested in the subset of rules, constraints are introduced in the generation of CARs. Real-world databases are record-based in which data is continuously added which demands incremental mining. Hence, constraint class association rules (CCAR) is mined from incremental data. To limit the number of rules and to remove the duplicate rules, redundant rule pruning and duplicate rule pruning techniques are applied. To improve the accuracy of the classifier, the rule selection using principality metric has been applied and the classifier is constructed with rules possessing high principality. Then, classifier is evaluated using single rule and multiple rule prediction methods and the accuracy of the proposed classifier are measured. Experimental results show that the accuracy of the proposed classifier is relatively higher when compared to other algorithms.

Unified Modeling for Multiple-Energy Coupling Device of Industrial Integrated Energy System

Data-driven unified modeling for multiple energy-coupling device (MECD) with considering the changing of operation modes (OMs) triggered by seasonal variation or the alteration of production rhythm is a challenging task. To overcome this, in this article, an unified modeling framework by using four-order tensor-based generalized interval type-2 fuzzy neural network is proposed, which considers the multiple operation property of MECD generated in the production process. The unified modelling of MECDs lie in the aspects of input and output of multiple energy media, OMs, working mode, which are related to analyze the structure difference of various type, specification, the changing of OMs triggered by demand response, and the alteration of season affected on working mode. Moreover, a model-guided rule pruning and recalling strategy was presented for avoiding the catastrophic forgetting of fuzzy rules in the process of modeling. A series of real-world data collected from a steel industrial park are selected for verifying the effectiveness of the proposed method; the established unified model has a widespread applicability and its prediction result outperforms state-of-the-art approaches in aspect of flexibility and accuracy.

Diagnosis of heart disease using oversampling methods and decision tree classifier in cardiology

Heart disease is one of the most prevalent and critical diseases that endangers the lives of human beings. In addition to clinical diagnosis, machine learning and deep learning-based approaches are vital in the diagnosis of heart disease. This paper proposes a balanced and optimized machine-learning algorithm for heart disease detection. This technique combines oversampling techniques, attribute pruning, CART decision tree classifier, and rule pruning through hyper-parameter tuning to identify the presence of heart disease. It further identifies the key attributes that contribute to the occurrence of heart malfunctioning. Experimental results show that SMOTE sampled dataset exhibits effective performance when implemented using a balanced and optimized machine learning algorithm, with an improvement of 11%, 75%, 62%, and 71% in accuracy, precision, recall, and f1 scores when compared with the dataset that was not subjected to sampling. The algorithm works effectively when the imbalance ratio is high for a dataset. The algorithm can be used to predict the presence of heart disease even in highly imbalanced datasets and identify critical features in the malfunctioning of the heart.

Robust Rule Learning for Reliable and Interpretable Insight into Expertise Transfer Opportunities

Intensive care in hospitals is distributed to different units that care for patient populations reflecting specific comorbidities, treatments, and outcomes. Unit expertise can be shared to potentially improve the quality of methods and outcomes for patients across units. We propose an algorithmic rule pruning approach for use in building short lists of human-interpretable rules that reliably identify patient beneficiaries of expertise transfers in the form of machine learning risk models. Our experimental results, obtained with two intensive care monitoring datasets, demonstrate the potential utility of the proposed method in practice.

Enriched intuitionistic fuzzy rule pruning using butterfly optimization for rule pruning in intrusion detection

The process of detecting and reacting to hostile activities against the computer and network resources is known as intrusion detection. Rather of relying just on expertise and experience, a systematic and automated IDS creation process is required. This drives researchers to look into data mining-based intrusion detection frameworks. Though there are many algorithms are developed for detection intrusion, the issue of inconsistency in rule-based classification model is controlling the volume of data and removing irrelevant rules are the major problems focused in this work to improve the process of IDS. This paper proposed a framework which handles the hesitancy in classifying the unknown traffic pattern data packets by designing evolutionary algorithm optimized intuitionistic fuzzy inference system. The Intuitionistic fuzzy inference system represents each instances of KDD cup 99 dataset with the degree of membership and non-membership. With these two degrees, the hesitancy degree is computed to overcome the issue of inconsistency and uncertainty in analysing the unknown pattern of abnormal packets. In conventional Intuitionistic fuzzy System (IFS), the rules generated by the inference engine is applied for classification directly without determine the validation of it.

Rule-Based Classification Based on Ant Colony Optimization: A Comprehensive Review

The Ant Colony Optimization (ACO) algorithms have been well-studied by the Operations Research community for solving combinatorial optimization problems. A handful of researchers in the Data Science community have successfully implemented various ACO methodologies for rule-based classification. This family of ACO algorithms is referred to as AntMiner algorithms. Due to the flexibility of the framework, and the availability of alternative strategies at the modular level, a systematic review on the AntMiner algorithms can benefit the broader community of researchers and practitioners interested in highly interpretable classification techniques. In this paper, we provided a comprehensive review of each module of the AntMiner algorithms. Our motivation is to provide insight into the current practices and future research scope in the context of the rule-based classification. Our discussions address ACO methodologies, rule construction strategies, candidate selection metrics, rule quality evaluation functions, rule pruning strategies, methods to address continuous attributes, parameter selection, and experimental settings. This review also reports a summary of real-life implementations of the rule-based classifiers in diverse domains including medical, genetics, portfolio analysis, geographic information system (GIS), human-machine interaction (HMI), autonomous driving, ICT, quality, and reliability engineering. These implementations demonstrate the potential application domains that can be benefitted from the methodological contributions to the rule-based classification technique.

Application of Class Based Association Rule Pruning to Generate Optimal Association Rules in Healthcare

The association rule mining approach produces uninteresting association rules. When the set of association rules become large, it becomes less interesting to the user. In order to pick interesting association rules among peak volumes of found association rules, it is critical to aid the decision-maker with an efficient post-processing phase. Theymotivate the need for association analysis performance. Practically it is an overhead to analyze the large set of association rules. In this work, association rule pruning technique called Class Based Association Rule Pruning (CBARP). This pruning techniques is proposed to prune the weak association rules of the healthcare system. The results are compared with Semantic Tree Based Association Rule Mining (STAR) technique and it demonstrate that the CBARP method outperforms other methods for the given support values.

Determining context of association rules by using machine learning

ABSTRACT Association rule mining is typically used to uncover the enthralling interdependencies between the set of variables and reveals the hidden pattern within the dataset. The associations are identified based on co-occurring variables with high frequencies. These associations can be positive (A→B) or negative (A→⌐B). The number of these association rules in larger databases are considerably higher which restricted the extraction of valuable insights from the dataset. Some rule pruning strategies are used to reduce the number of rules that can sometimes miss an important, or include an unimportant rule into the final rule set because of not considering the context of the rule. Context-based positive and negative association rule mining (CBPNARM) for the first time included context variable in the algorithms of association rule mining for selection/ de-selection of such rules. In CBPNARM, the selection of context variable and its range of values are done by the user/expert of the system which demands unwanted user interaction and may add some bias to the results. This paper proposes a method to automate the selection of context variable and selection of its value range. The context variable is chosen by using the diversity index and chi-square test, and the range of values for the context variable is set by using box plot analysis. The proposed method on top of it added conditional-probability increment ratio (CPIR) for further pruning uninteresting rules. Experiments show the system can select the context variable automatically and set the right range for the selected context variable. The performance of the proposed method is compared with CBPNARM and other state of the art methods.

ARC-SL: Association rule-based classification with soft labels

As one of the most promising classification schemes, association classification (AC) effectively integrates classification with association rule discovery, but it requires precisely labelled data which is usually expensive or hard to obtain in practice. This paper extends the AC to solve the classification of data with soft labels represented as belief functions defined over the set of classes. To characterize the imprecision of labels, a more general rule, called imprecise classification association rule (ICAR), is first introduced so that the consequent is more flexible, being any subset of the class set. Meanwhile, measures of support and confidence are proposed for ICAR by taking into account the belief functions encoded in soft labels. With the new rule structure, an association rule-based soft labelled classification method, called ARC-SL, is then developed to build a more accurate classification model containing three phases: entropy-based adaptive partition for deriving fuzzy regions of continuous attributes, Apriori-based rule mining for generating a set of ICARs with variable support and confidence thresholds, and rule pruning for discarding redundant or poor rules. Finally, a belief reasoning procedure is presented to classify each input instance through combining the activated rules in the framework of belief functions. Experiments on benchmark datasets and an application to facial expression recognition demonstrate the effectiveness of the proposed method.

PERFORMANCE ANALYSIS OF ANOMALOUS DETECTION SCEHMES BASED ON MODIFIED SUPPORT VECTOR MACHINE AND ENHANCED RELEVANCE VECTOR MACHINE

Anomalous transactions are common activity happening on the financial oriented transaction. Detecting those anomalous transactions from the financial transaction patterns is the most complex task which is focused in this work. In the existing work it is achieved by introducing the method namely Fuzzy Exception and Fuzzy Anomalous Rule (FEFAR). The accuracy of this existing work FEFAR found to be lesser which is resolved in the proposed research work. There are two research works has been proposed those are namely Rule Pruning based Anomalous Rule Detection Strategy (RPARD) and Lasso Regression based Improved Anomalous Detection Scheme (LR-IADS). Both of these methods attempt to find the anomalous transaction from the given input database by finding the anomalous rules. Each method differ in its methodologies, thus the accuracy of the methods would differ. The main goal of this analysis work is to compare the performance of existing and proposed methodologies based on simulation outcome. This research work aims to highlight the performance variation between the proposed and existing techniques and the best method that can offer accurate anomalous transaction detection. The analysis of the research work is carried out on matlab environment over four databases namely soil, bank, german statlog and auto mpg based on which performance outcome has been given.

Genetic-based Pruning Technique for Ant-Miner Classification Algorithm

Ant colony optimization (ACO) is a well-known algorithm from swarm intelligence that plays an essential role in obtaining rich solutions to complex problems with wide search space. ACO is successfully applied to different application problems involving rules-based classification through an ant-miner classifier. However, in the ant-miner classifier, rule-pruning suffers from the problem of nesting effect origins from the method of greedy Sequential Backward Selection (SBS) in term selection, thereby depriving the opportunity of obtaining a good pruned rule by adding/removing the terms during the pruning process. This paper presents an extension to the Ant-Miner, namely the genetic algorithm Ant-Miner (GA-Ant Miner), which incorporates the use of GA as a key aspect in the design and implementation of a new rule pruning technique. This pruning technique consists of three fundamental procedures: an initial population Ant-Miner, crossover to prune the rule, and mutation to diversify the pruned classification rule. The GA-Ant Miner performance is tested and compared with the most related ant-mining classifiers, including the original Ant-Miner, ACO/ PSO2, TACO-Miner, CAnt-Miner, and Ant-Miner with a hybrid pruner, across various public available UCI datasets. These datasets are varied in terms of instance number, feature size, class number, and the application domains. Overall, the performance results indicate that the GA-Ant Miner classifier outperforms the other five classifiers in the classification accuracy and model size. Furthermore, the experimental results using statistical test prove that GA-Ant Miner is the best classifier when considering the multi objectives (i.e., accuracy and model size ranks).

A transparent rule-based expert system using neural network

Classification is one of the foremost machine learning tasks in this modern era. Neural Network (NN) is one of the powerful classification techniques. NN can achieve high classification accuracy on highly imbalanced and complex datasets, but lacks in explanation of its reasoning process which limits its applicability in various domains which require transparent decision along with good accuracy. There are some techniques which extract rules from NN and make it transparent; however, attribute pruning, rule pruning and class overlap algorithms are not sufficiently effective. Therefore, this paper proposes a rule extraction algorithm, called Transparent Rule Extraction using Neural Network (TRENN) to convert NN into white box with greater emphasis on attribute pruning and rule pruning. The proposed TRENN is a pedagogical approach and an extension of one of the existing algorithms named Rule Extraction from Neural Network using Classified and Misclassified data (RxNCM). The proposed TRENN extends the RxNCM with sequential floating backward search for feature and rule selection to improve the comprehensibility of the generated rules. Besides, the proposed TRENN uses probabilistic approach for the treatment of class overlapping problem in the rule updating phase instead of reclassification used in RxNCM where the overlap may persist. Experiments are conducted with eight real datasets collected from the UCI repository. Performance of the TRENN is measured with Precision, Recall, FP-Rate, F-measure, and local and global comprehensibility. It is observed from the experimental results that TRENN performs better than Re-RX, RxNCM and RxREN.

An Automatic Attribute-Based Access Control Policy Extraction From Access Logs

With the rapid advances in computing and information technologies, traditional access control models have become inadequate in terms of capturing fine-grained, and expressive security requirements of newly emerging applications. An attribute-based access control (ABAC) model provides a more flexible approach to addressing the authorization needs of complex and dynamic systems. While organizations are interested in employing newer authorization models, migrating to such models pose as a significant challenge. Many large-scale businesses need to grant authorizations to their user populations that are potentially distributed across disparate and heterogeneous computing environments. Each of these computing environments may have its own access control model. The manual development of a single policy framework for an entire organization is tedious, costly, and error-prone. In this article, we present a methodology for automatically learning ABAC policy rules from access logs of a system to simplify the policy development process. The proposed approach employs an unsupervised learning-based algorithm for detecting patterns in access logs and extracting ABAC authorization rules from these patterns. In addition, we present two policy improvement algorithms, including rule pruning and policy refinement algorithms to generate a higher quality mined policy. Finally, we implement a prototype of the proposed approach to demonstrate its feasibility.

RDFRules: Making RDF rule mining easier and even more efficient

AMIE+ is a state-of-the-art algorithm for learning rules from RDF knowledge graphs (KGs). Based on association rule learning, AMIE+ constituted a breakthrough in terms of speed on large data compared to the previous generation of ILP-based systems. In this paper we present several algorithmic extensions to AMIE+, which make it faster, and the support for data pre-processing and model post-processing, which provides a more comprehensive coverage of the linked data mining process than does the original AMIE+ implementation. The main contributions are related to performance improvement: (1) the top-k approach, which addresses the problem of combinatorial explosion often resulting from a hand-set minimum support threshold, (2) a grammar that allows to define fine-grained patterns reducing the size of the search space, and (3) a faster projection binding reducing the number of repetitive calculations. Other enhancements include the possibility to mine across multiple graphs, the support for discretization of continuous values, and the selection of the most representative rules using proven rule pruning and clustering algorithms. Benchmarks show reductions in mining time of up to several orders of magnitude compared to AMIE+. An open-source implementation is available under the name RDFRules at https://github.com/propi/rdfrules.

A modified NEFCLASS classifier with enhanced accuracy-interpretability trade-off for datasets with skewed feature values

The accuracy-transparency trade-off is one of the most notable challenges when applying machine learning tools in the medical domain. Nefclass is a popular neuro-fuzzy classifier in medical diagnosis systems. Nefclass performs increasingly poorly as the data skewness increases. This paper presents a combined approach to improve the classification accuracy and interpretability of the Nefclass classifier, when feature values of the training and testing datasets exhibit positive skewness. The proposed model consists of two steps. Firstly, a modified Nefclass classifier embedded with a choice of two alternative discretization methods, MME and CAIM is implemented. Secondly, we devised a new rule pruning method based on the Habermans' adjusted residual to reduce the size of the resulting ruleset. This rule-pruning method improves the interpretability of Nefclass without significant accuracy deterioration. Moreover, a hybrid approach combining the two approaches provides a considerable improvement in classification accuracy and transparency of Nefclass on skewed data.

Remote sensing image classification based on adaptive ant colony algorithm

Aimed at solving the existing problems in most traditional classification algorithms applied in hyper-spectral classification, such as low speed, low accuracy, and difficult convergence, a hyper-spectral image classification based on an adaptive ant colony algorithm (ACA) is proposed in this paper. First of all, training samples are used to construct the paths selected by ants, and rule pruning is used to prune the paths irrelevant to classification and adaptively update paths. Then, the constructed paths are used to classify the hyper-spectral data. Finally, an accuracy evaluation of the classification is conducted. The hyper-spectral remote sensing data of Washington, D.C., was used to test the method. The method was also compared with principal component analysis (PCA), radial basis function (RBF) neural network, semi-supervised sparse discriminate embedding (SSDE), and adaptive sparse representation (ASP). Results show that the overall classification accuracy increases by about 7.6% using the adaptive ant colony algorithm compared with other algorithms, which improves the classification accuracy of hyper-spectral images efficiently.

Improved Dominance Soft Set Based Decision Rules with Pruning for Leukemia Image Classification

Acute lymphoblastic leukemia is a well-known type of pediatric cancer that affects the blood and bone marrow. If left untreated, it ends in fatal conditions due to its proliferation into the circulation system and other indispensable organs. All over the world, leukemia primarily attacks youngsters and grown-ups. The early diagnosis of leukemia is essential for the recovery of patients, particularly in the case of children. Computational tools for medical image analysis, therefore, have significant use and become the focus of research in medical image processing. The particle swarm optimization algorithm (PSO) is employed to segment the nucleus in the leukemia image. The texture, shape, and color features are extracted from the nucleus. In this article, an improved dominance soft set-based decision rules with pruning (IDSSDRP) algorithm is proposed to predict the blast and non-blast cells of leukemia. This approach proceeds with three distinct phases: (i) improved dominance soft set-based attribute reduction using AND operation in multi-soft set theory, (ii) generation of decision rules using dominance soft set, and (iii) rule pruning. The efficiency of the proposed system is compared with other benchmark classification algorithms. The research outcomes demonstrate that the derived rules efficiently classify cancer and non-cancer cells. Classification metrics are applied along with receiver operating characteristic (ROC) curve analysis to evaluate the efficiency of the proposed framework.

Classification of Pruning Methodologies for Model Development using Data Mining Techniques

Knowledge discovery process deals with two essential data mining techniques, association and classification. Classification produces a set of large number of associative classification rules for a given observation. Pruning removes unnecessary class association rules without losing classification accuracy. These processes are very significant but at the same time very challenging. The experimental results and limitations of existing class association rules mining techniques have shown that there is a requirement to consider more pruning parameters so that the size of classifier can be further optimized. Here through this paper we are presenting a survey various strategies for class association rule pruning and study their effects that enables us to extract efficient compact and high confidence class association rule set and we have also proposed a pruning methodology

Annealing strategy for an enhance rule pruning technique in ACO-Based rule classification

<span>Ant colony optimization (ACO) was successfully applied to data mining classification task through ant-mining algorithms. Exploration and exploitation are search strategies that guide the learning process of a classification model and generate a list of rules. Exploitation refers to the process of intensifying the search for neighbors in good regions, </span><span>whereas exploration aims towards new promising regions during a search process. </span><span>The existing balance between exploration and exploitation in the rule construction procedure is limited to the roulette wheel selection mechanism, which complicates rule generation. Thus, low-coverage complex rules with irrelevant terms will be generated. This work proposes an enhancement rule pruning procedure for the ACO algorithm that can be used in rule-based classification. This procedure, called the annealing strategy, is an improvement of ant-mining algorithms in the rule construction procedure. Presented as a pre-pruning technique, the annealing strategy deals first with irrelevant terms before creating a complete rule through an annealing schedule. The proposed improvement was tested through benchmarking experiments, and results were compared with those of four of the most related ant-mining algorithms, namely, Ant-Miner, CAnt-Miner, TACO-Miner, and Ant-Miner with hybrid pruner. </span><span>Results display that our proposed technique achieves better performance in terms of classification accuracy, model size, and </span><span>computational time. </span><span>The proposed annealing schedule can be used in other ACO variants for different applications to improve classification accuracy.</span>