Classification Rule Discovery Research Articles

Scalable Action Mining Hybrid Method for Enhanced User Emotions in Education and Business Domain

Education sector ,Business field,Medical domain and SocialMedia,huge amounts of data in a single day . Mining this data can provide a lot of meaningful insights on how to improve user experience in social media, users engage in these domains collect and cherish the data as they hope to find patterns and trends and the golden nuggets that help them to accomplish their goal. For example: How to improve student learning; how to increase business profit ability; how to improve user experience in social media; and how to heal patients and assists hospital administrators. Action Rule Miningmines actionable patterns which are hidden in various datasets. Action Rules provide actionable suggestions on how to change the state of an object from an existing state to a desired state for the benefit of the user. There are two major frameworks in the literature of Action Rule mining namely Rule-Based method where the extraction of Action Rules is dependent on the pre-processing step of classification rule discovery and Object-Based method where it extracts the Action Rules directly from the database without the use of classification rules.Hybrid Action rule mining approach combines both these frame works and generates complete set of Action Rules. The hybrid approach shows significant improvement in terms computational performance over the Rule-Based and Object-Based approach. In this work we propose a novel Modified Hybrid Action rule method with Partition Threshold Rho, which further improves the computational performance with large datasets.

AI for identifying social norm violation

Identifying social norms and their violation is a challenge facing several projects in computational science. This paper presents a novel approach to identifying social norm violations. We used GPT-3, zero-shot classification, and automatic rule discovery to develop simple predictive models grounded in psychological knowledge. Tested on two massive datasets, the models present significant predictive performance and show that even complex social situations can be functionally analyzed through modern computational tools.

Cloud Mining Actionable Pattern Discovery In Big Data : A Survey

Everyday several tons of data are generated by Social Media and Education sectors. Mining this data can provide a lot of meaningful insights on how to improve user experience in social media and how to improve student learning experience. Action Rule Mining is a method that can extract such actionable patterns from large datasets. Action Rules provide actionable suggestions on how to change the state of an object from an existing state to a desired state for the benefit of the user. There are two major frameworks in the literature of Action Rule mining namely Rule-Based method where the extraction of Action Rules is dependent on the pre-processing step of classification rule discovery and Object-Based method where it extracts the Action Rules directly from the database without the use of classification rules. Hybrid Action rule mining approach combines both these frameworks and generates complete set of Action Rules. The hybrid approach shows significant improvement in terms computational performance over the Rule-Based and ObjectBased approach. This paper gives a brief survey of previous works on action rule mining algorithms, and discusses Action Rule Mining on BigData and in a distributed environment. The applications of actionable action rules in BigData include business opinion mining, educational opinion mining, medical data decision support systems, text emotion detection, and social media data recommendations.

A novel approach based on genetic algorithm to speed up the discovery of classification rules on GPUs

This paper proposes a new approach to produce classification rules based on evolutionary computation with novel crossover and mutation operators customized for execution on graphics processing unit (GPU). Also, a novel method is presented to define the fitness function, i.e. the function which measures quantitatively the accuracy of the rule. The proposed fitness function is benefited from parallelism due to the parallel execution of data instances. To this end, two novel concepts; coverage matrix and reduction vectors are used and an altered form of the reduction vector is compared with previous works. Our CUDA program performs operations on coverage matrix and reduction vector in parallel. Also these data structures are used for evaluation of fitness function and calculation of genetic operators in parallel. We proposed a vector called average coverage to handle crossover and mutation properly. Our proposed method obtained a maximum accuracy of 99.74% for Hepatitis C Virus (HCV) dataset, 95.73% for Poker dataset, and 100% for COVID-19 dataset. Our speedup is higher than 20% for HCV and COVID-19, and 50% for Poker, compared to using single core processors.

Classification Rule Discovery for Software Bug Severity using KNN with different distance metric

Classification Rule Discovery for Software Bug Severity using KNN with different distance metric

Privacy preserving rule-based classifier using modified artificial bee colony algorithm

Privacy preserving data mining is a hot research field of data mining. The aim of privacy preserving data mining is to prevent the leakage of the sensitive information of individuals while performing data mining techniques. Classification task is one of the most studied fields in data mining hence in privacy preserving data mining as well. On the other hand, differential privacy is a powerful privacy guarantee that determines privacy leakage ratio by using ∊ parameter and enables researchers to mine data which includes sensitive information. Implementations of some well-known classification algorithms such as k-NN, Naïve Bayes, ID3, etc. with differential privacy have been developed. Although the success of the rule-based classifiers using meta-heuristics such as Ant-Miner, BeeMiner etc. in data mining has been demonstrated, any implementation of these classification algorithms with differential privacy has not been proposed in the literature until now to our best knowledge. Artificial bee colony (ABC) is a nature inspired algorithm which imitates foraging behavior of bees, and some approaches using ABC to discover classification rules have been proposed recently and the success of ABC algorithm for the discovery of classification rules has been demonstrated. Motivated by this shortcoming in the literature, we propose to develop a rule-based classifier using ABC algorithm with input perturbation technique of differential privacy to perform privacy preserving classification. According to our experimental results, the proposed ABC-based classifier performs better than the well-known algorithms that are SVM, C4.5, Holte’s One Rule, PART, and RIPPER over non-private and differentially private versions of the datasets in terms of classification performance.

Evaluating pattern restrictions for associative classifiers

Associative classification is a pattern recognition approach that integrates classification and association rule discovery to build accurate classification models. These models are formed by a collection of contrast patterns that fulfill some restrictions. In this paper, we introduce an experimental comparison of the impact of using different restrictions in the classification accuracy. To the best of our knowledge, this is the first time that such analysis is performed, deriving some interesting findings about how restrictions impact on the classification results. Contrasting these results with previously published papers, we found that their conclusions could be unintentionally biased by the restrictions they used. We found, for example, that the jumping restriction could severely damage the pattern quality in the presence of dataset noise. We also found that the minimal support restriction has a different effect in the accuracy of two associative classifiers, therefore deciding which one is the best depends on the support value. This paper opens some interesting lines of research, mainly in the creation of new restrictions and new pattern types by joining different restrictions.

Data mining model for multimedia financial time series using information entropy

At present, KDD research covers many aspects, and has achieved good results in the discovery of time series rules, association rules, classification rules and clustering rules. KDD has also been widely used in practical work such as OLAP and DW. Also, with the rapid development of network technology, KDD research based on WEB has been paid more and more attention. The main research content of this paper is to analyze and mine the time series data, obtain the inherent regularity, and use it in the application of financial time series transactions. In the financial field, there is a lot of data. Because of the huge amount of data, it is difficult for traditional processing methods to find the knowledge contained in it. New knowledge and new technology are urgently needed to solve this problem. The application of KDD technology in the financial field mainly focuses on customer relationship analysis and management, and the mining of transaction data is rare. The actual work requires a tool to analyze the transaction data and find its inherent regularity, to judge the nature and development trend of the transaction. Therefore, this paper studies the application of KDD in financial time series data mining, explores an appropriate pattern mining method, and designs an experimental system which includes mining trading patterns, analyzing the nature of transactions and predicting the development trend of transactions, to promote the application of KDD in the financial field.

MR-AntMiner: A Novel MapReduce Classification Rule Discovery with Ant Colony Intelligence

Ant colony optimization (ACO) algorithms have been successfully applied to data classification problems that aim at discovering a list of classification rules. However, on the one hand, the ACO algorithm has defects including long search times and convergence issues with non-optimal solutions. On the other hand, given bottlenecks such as memory restrictions, time complexity, or data complexity, it is too hard to solve a problem when its scale becomes too large. One solution for this issue is to design a highly parallelized learning algorithm. The MapReduce programming model has quickly emerged as the most common model for executing simple algorithmic tasks over huge volumes of data, since it is simple, highly abstract, and efficient. Therefore, MapReduce-based ACO has been researched extensively. However, due to its unidirectional communication model and the inherent lack of support for iterative execution, ACO algorithms cannot easily be implemented on MapReduce. In this paper, a novel classification rule discovery algorithm is proposed, namely MR-AntMiner, which can capitalize on the benefits of the MapReduce model. In order to construct quality rules with fewer iterations as well as less communication between different nodes to share the parameters used by each ant, our algorithm splits the training data into some subsets that are randomly mapped to different mappers; then the traditional ACO algorithm is run on each mapper to gain the local best rule set, and the global best rule list is produced in the reducer phase according to a voting mechanism. The performance of our algorithm was studied experimentally on 14 publicly available data sets and further compared to several state-of-the-art classification approaches in terms of accuracy. The experimental results show that the predictive accuracy obtained by our algorithm is statistically higher than that of the compared targets. Furthermore, experimental studies show the feasibility and the good performance of the proposed parallelized MR-AntMiner algorithm.

ASAP-DM: a framework for automatic selection of analytic platforms for data mining

The plethora of analytic platforms escalates the difficulty of selecting the most appropriate analytic platform that fits the needed data mining task, the dataset as well as additional user-defined criteria. Especially analysts, who are rather focused on the analytics domain, experience difficulties to keep up with the latest developments. In this work, we introduce the ASAP-DM framework, which enables analysts to seamlessly use several platforms, whereas programmers can easily add several platforms to the framework. Furthermore, we investigate how to predict a platform based on specific criteria, such as lowest runtime or resource consumption during the execution of a data mining task. We formulate this task as an optimization problem, which can be solved by today’s classification algorithms. We evaluate the proposed framework on several analytic platforms such as Spark, Mahout, and WEKA along with several data mining algorithms for classification, clustering, and association rule discovery. Our experiments unveil that the automatic selection process can save up to 99.71% of the execution time due to automatically choosing a faster platform.

A data mining approach to investigate patterns of powered two-wheeler crashes in Spain

Powered two-wheelers (PTWs) are growing globally each year as they are considered an attractive alternative to cars (flexible, small, affordable, fast and easy to park), especially on congested traffic situations. However, PTWs represent an important challenge for road safety. In fact, in 2016, Spain ranked fifth in terms of PTW fatalities among EU 28. For this reason, this paper aims to investigate which are the patterns among crash characteristics contributing to PTW crashes in Spain. Data from 78,611 crashes involving PTWs occurred in Spain in the period 2011–2013 were analyzed. The analysis was performed by using classification trees and rules discovery which are suitable models aimed at extracting knowledge and identifying valid and understandable patterns from large amounts of data previously unknown and indistinguishable. The response variables assessed in this study were severity and crash type. As a result, several combinations of road, environmental and drivers’ characteristics associated with severity and typology of PTW crashes in Spain were identified. Based on the analysis results, several countermeasures to solve or mitigate the safety issues identified in the study were proposed.From the methodological point of view, study results show that both the classification trees and the a priori algorithm were effective in providing non-trivial and unsuspected relations in the data. Classification trees structure allowed a simpler understanding of the phenomenon under study while association discovery provided new information which was previously hidden in the data. Given that the results of the two different techniques were never contradictory, we recommend using classification trees and association discovery as complementary approaches since their combination is effective in exploring data providing meaningful insights about PTW crash characteristics and their interdependencies.

Adaptive strategy operators based GA for rule discovery

A new variant of genetic algorithm, which provides equal opportunity for all parent solution to produce the offspring solution, has been applied in discovery of classification rules from continuous datasets. The main objective of proposed algorithm is used to discover classification rule with three measures like accuracy, coverage (completeness) and comprehensibility, using which easily understandable, accurate and comprehensible rules can be generated. A new process has been defined to simplify the generated rules by reducing the features dimension, according to their role in the success of discovering rules. Adaptive approach for crossover and mutation operations has been applied to handle the exploration and exploitation in dynamic manner. Algorithm has been tested on UCI benchmark dataset. The results show the better classification accuracy and optimal selection of features. It is also observed that, proposed solution generates rules which are easy to handle and does not require computational machine for applications use.

Empirical Performance Analysis of Decision Tree and Support Vector Machine based Classifiers on Biological Databases

The classification and prediction of medical diseases is a cutting edge research problem in the medical field. The experts of machine learning are continuously proposing new classification methods for the prediction of diseases. The discovery of classification rules from medical databases for classification and prediction of diseases is a challenging and non-trivial task. It is very significant to investigate the more promising and efficient classification approaches for the discovery of classification rules from the medical databases. This paper focuses on the problem of selection of more efficient, promising and suitable classifier for the prediction of specific diseases by performing empirical studies on bunch mark medical databases. The research work under the focus concentrates on the benchmark medical data sets i.e. arrhythmia, breast-cancer, diabetes, hepatitis, mammography, lymph, liver-disorders, sick, cardiotocography, heart-statlog, breast-w, and lung-cancer. The medical data sets are obtained from the open-source UCI machine learning repository. The research work will be investigating the performance of Decision Tree (i.e. AdaBoost.NC, C45-C, CART, and ID3-C) and Support Vector Machines. For experimentation, Knowledge Extraction based on Evolutionary Learning (KEEL), a data mining tool will be used. This research work provides the empirical performance analysis of decision tree-based classifiers and SVM on a specific dataset. Moreover, this article provides a comparative performance analysis of classification approaches in terms of statistics.

A Novel Fitness Computation Framework for Nature Inspired Classification Algorithms

Nature inspired algorithms have become popular for discovering classification rules due to their ability to effectively handle large and complex search spaces. However, nature inspired algorithms have to compute the fitness of individuals (candidate classification rules) over successive generations repeatedly. Each fitness computation requires scanning the training data. Since the database scan is computationally expensive operation, the execution time for nature inspired algorithms for discovering classification rules grows unreasonably faster for bulky datasets. This paper proposes a novel fitness computation framework for nature inspire algorithms by using a list structure. The indices of instances, covered by every possible attribute-value pair with respect to each class in the training data, are stored in the suggested list structure. The list is prepared only once in advance and stores all information to compute the fitness of any rule that may come up in the life time of the nature inspired algorithm. The existence of the pre-maintained list eliminates the need of scanning training data again and again for fitness computation. We have conducted experiments on 12 datasets from UCI machine learning repository. The results show that the suggested fitness computational framework brings significant speed gain without compromising predictive accuracy. Although, a Genetic Algorithm is used for classification rule discovery as the nature inspired algorithm in this paper, the fitness computation framework is general and can be used with any other nature inspired algorithm.

ForEx++: A New Framework for Knowledge Discovery from Decision Forests

Decision trees are popularly used in a wide range of real world problems for both prediction and classification (logic) rules discovery. A decision forest is an ensemble of decision trees and it is often built for achieving better predictive performance compared to a single decision tree. Besides improving predictive performance, a decision forest can be seen as a pool of logic rules (rules) with great potential for knowledge discovery. However, a standard-sized decision forest usually generates a large number of rules that a user may not able to manage for effective knowledge analysis. In this paper, we propose a new, data set independent framework for extracting those rules that are comparatively more accurate, generalized and concise than others. We apply the proposed framework on rules generated by two different decision forest algorithms from some publicly available medical related data sets on dementia and heart disease. We then compare the quality of rules extracted by the proposed framework with rules generated from a single J48 decision tree and rules extracted by another recent method. The results reported in this paper demonstrate the effectiveness of the proposed framework.

Classification, Association and Clustering of Water Body Data: Application to Water Quality Monitoring

The application of advanced computational resources in the support of environmental management systems has increased in recent decades. The objective of this research is to discover useful knowledge amidst water monitoring data collected between 2005 and 2011, in a specific region of the state of Sao Paulo in Brazil. The research was performed in three steps: discovery of classification rules of ecotoxicity in water samples using predictive modelling; investigation of the presence of strong relationships between water quality parameters by associative analysis; and discovery of sampling sites, which are similar with respect to their quality parameters, by applying a clustering method. The knowledge discovery process employed in this work was divided into four phases: selection of study area and data, pre-processing of the selected data, mining of the pre-processed data, and interpretation and evaluation of the results. The data mining step was supported by different algorithms, each one focused on a particular issue of the research: sequential coverage algorithm for classification of ecotoxicity; Apriori algorithm for identifying associations between quality parameters, and Prim’s algorithm and pruning algorithm for clustering of water sampling sites. We observed the association of certain quality parameters to water ecotoxicity, the existence of correlations between some of the quality parameters, and the presence of homogeneous groups amidst the sampling sites. These results may provide valuable input to the field of water quality monitoring, from the technical activities, such as the laboratorial analysis of water samples, to the decision makers responsible for defining the future public policies for water resources management.

Comparative Analysis and Survey of Ant Colony Optimization based Rule Miners

In this research study, we analyze the performance of bio inspired classification approaches by selecting Ant-Miners (Ant-Miner, cAnt_Miner, cAnt_Miner2 and cAnt_MinerPB) for the discovery of classification rules in terms of accuracy, terms per rule, number of rules, running time and model size discovered by the corresponding rule mining algorithm. Classification rule discovery is still a challenging and emerging research problem in the field of data mining and knowledge discovery. Rule based classification has become cutting edge research area due to its importance and popular application areas in the banking, market basket analysis, credit card fraud detection, costumer behaviour, stock market prediction and protein sequence analysis. There are various approaches proposed for the discovery of classification rules like Artificial Neural Networks, Genetic Algorithm, Evolutionary Programming, SVM and Swarm Intelligence. This research study is focused on classification rule discovery by Ant Colony Optimization. For the performance analysis, Myra Tool is used for experiments on the 18 public datasets (available on the UCI repository). Data sets are selected with varying number of instances, number of attributes and number of classes. This research paper also provides focused survey of Ant-Miners for the discovery of classification rules.

PSO based Swarm Intelligence Technique for Multi- Objective Classification Rule Mining

Today’s real world faces different kinds of complex optimization problems. The existing methodologies can’t cope of with such complex problems. This paper presents classification rule mining as a multi-objective problem rather than a single objective one. Multi-Objective optimization is a challenging area and focus for research. Here two modern domains of research are discussed one is swarm intelligence and other is data mining. In this paper PSO is taken as taken as a swarm intelligence algorithm and classification rule mining is taken as the problem domain. In classification rule discovery, classifiers are designed through the following two phases: rule extraction and rule selection. In the rule extraction phase, a large number of classification rules are extracted from training data. This phase is based on two rule evaluation criteria: support (coverage) and confidence. An association rule mining technique is used to extract classification rules satisfying pre-specified threshold values of minimum support (coverage) and confidence. In second phase, a small number of rules are targeted from the extracted rules to design an accurate and compact classifier. In this paper, I used PSO for multiple objective rule selection to maximize the accuracy of the rule sets and minimize their complexity.

Protein classification via an ant-inspired association rules-based classifier

Association rules mining and classification rules discovery are two important data mining techniques used to expose the relations among large sets of data items. The technique aims to find out the rules that satisfy the predefined minimum support and the confidence. Association rules mining has successfully been implemented in biomedical research and has demonstrated encouraging results in analysing the gene expression data in order to discover the relevant biological association among different genes, gene expression, and various protein properties like protein functionality and sequence similarity. In this paper, we applied the association rule mining technique - the ACO-AC to the problem of classifying proteins into its correct fold of the SCOP dataset. The technique combines the association rules mining and supervised classification mechanism using ant colony optimisation. Experimental results reveal the classifier performance in protein classification problem as excellent by identifying most accurate and compact rules.

A novel multiple rule sets data classification algorithm based on ant colony algorithm

Ant colony optimization (ACO) algorithms have been successfully applied in data classification, which aim at discovering a list of classification rules. However, due to the essentially random search in ACO algorithms, the lists of classification rules constructed by ACO-based classification algorithms are not fixed and may be distinctly different even using the same training set. Those differences are generally ignored and some beneficial information cannot be dug from the different data sets, which may lower the predictive accuracy. To overcome this shortcoming, this paper proposes a novel classification rule discovery algorithm based on ACO, named AntMinermbc, in which a new model of multiple rule sets is presented to produce multiple lists of rules. Multiple base classifiers are built in AntMinermbc, and each base classifier is expected to remedy the weakness of other base classifiers, which can improve the predictive accuracy by exploiting the useful information from various base classifiers. A new heuristic function for ACO is also designed in our algorithm, which considers both of the correlation and coverage for the purpose to avoid deceptive high accuracy. The performance of our algorithm is studied experimentally on 19 publicly available data sets and further compared to several state-of-the-art classification approaches. The experimental results show that the predictive accuracy obtained by our algorithm is statistically higher than that of the compared targets.