Search

The paper reviews classification algorithms based on Gene Expression Programming (GEP) used for mining the real-life datasets. Our aim is to show, chronologically, most important developments as well as the current state-of-the-art in the area of GEP-based classifiers, with a view to attract further real life applications. We begin with reviewing approaches to building basic, stand alone, GEP classifiers and eventually, combining them into the classifier ensemble. In the following part of the paper we describe and illustrate with example several hybrid solutions where GEP is integrated with other methods. Next, we review specialized and dedicated methods including multiple criteria and incremental GEP-based classification tools. Final part of the paper reviews specialized GEP-based classifiers used to mine the real-life datasets. [ABSTRACT FROM AUTHOR]

Due to the vast and rapid increase in data, data mining has become an increasingly important tool for the purpose of knowledge discovery in order to prevent the presence of rich data but poor knowledge. Data mining tasks can be undertaken in two ways, namely, manual walkthrough of data and use of machine learning approaches. Due to the presence of big data, machine learning has thus become a powerful tool to do data mining in intelligent ways. A popular approach of machine learning is inductive learning, which can be used to generate a rule set (a set of rules) using a particular algorithm. Inductive learning can involve a single base algorithm learning from a single data set following a standard learning approach. In this approach, the learning algorithm can generate a single rule set such as decision trees. On the other hand, the inductive learning can also involve a single base algorithm learning from multiple data sets following an ensemble learning approach. In this approach, the learning algorithm can generate multiple rule sets such as random forests. The latter approach is usually designed to reduce overfitting of models that usually arises when the former approach is adopted. In this context, the ensemble learning approach usually enables the improvement of the overall accuracy in prediction. The aim of this paper is to introduce a new approach of ensemble learning called Collaborative Rule Generation. In the new approach, the inductive learning involves multiple base algorithms learning from a single data set to generate a single rule set, which aims to enable each rule to have a higher quality. This paper also includes an experimental study validating the Collaborative Rule Generation approach and discusses the results in both quantitative and qualitative ways. [ABSTRACT FROM AUTHOR]

Fault diagnosis plays a crucial role to maintain healthy conditions in rotating machinery. In real industrial applications, a Machine Learning based Classifier (ML-C) analyses data from a current machinery condition to detect abnormal behaviours. Usually, this is achieved through a previous training of the ML-C model, under supervised learning; however, for new machinery conditions, the classifier is not able to correctly identify these new condition. This paper proposes a framework to detect new patterns of abnormal conditions in gearboxes, that could be associated to new faults. The framework relies on an algorithm to build evolving models in simultaneous scenarios of classification and clustering. The design is inspired by the main principles of the K-means and the One Nearest Neighbour (1-NN) algorithms. A heuristic metric is defined to analyse the new discovered clusters; as a result, these new clusters can be labelled as new classes corresponding to new faulty patterns. Once a new pattern is identified, the associated data feeds a dedicated supervised classifier which is updated through a new training phase. The proposed framework is tested on data collected from a gearbox test bed under realistic conditions of faults. Experimental results show that the algorithm is able to discover new valuable knowledge than can be identified as new faulty classes. [ABSTRACT FROM AUTHOR]

Machine-learning and data-mining techniques have been developed to turn data into useful task-oriented knowledge. The algorithms for mining association rules identify relationships among transactions using binary values and find rules at a single-concept level or multiple levels. Mining associations among itemsets only by using support and confidence thresholds at different levels of hierarchical data would not give interesting rules both for binary or quantitative data. This paper proposes a two phase algorithm that mines rare generalized fuzzy coherent rules at inter-cross level hierarchies. During phase-I both positive and negative fuzzy coherent rules are mined and in Phase-II, rare generalized fuzzy coherent rules are extracted from the resultant rules obtained from Phase-I. The algorithm framework works on top down methodology in generating positive and negative fuzzy coherent rules and mining rare generalized rules from it. Experiments conducted using synthetic dataset show the performance of the proposed algorithm in terms of the number of rare generalized rules generated, compared to fuzzy multiple-level association rule mining algorithm. [ABSTRACT FROM AUTHOR]

In this paper, a recurrent wavelet-based neuro-fuzzy identifier (RWNFI) with a self-organization hybrid evolution learning algorithm (SOHELA) is proposed for solving various identification problems. In the proposed SOHELA, the group-based symbiotic evolution (GSE) is adopted such that each group in the GSE represents a collection of only one fuzzy rule. The proposed SOHELA consists of structure learning and parameter learning. In structure learning, the proposed SOHELA uses the self-organization algorithm (SOA) to determine a suitable rule number in the RWNFI. In parameter learning, the proposed SOHELA uses the data mining-based selection method (DMSM) and the data mining-based crossover method (DMCM) to determine groups and parent groups using the data mining method called the frequent pattern growth (FP-Growth) method. Based on identification simulations, the excellent performance of the proposed SOHELA compares with other various existing models. [ABSTRACT FROM AUTHOR]

The only metric that had existed so far to determine the best algorithm for solving an general Asymmetric Traveling Salesman Problem (ATSP) instance is based on the number of cities; nevertheless, it is not sufficiently adequate for discriminating the best algorithm for solving an ATSP instance, thus the necessity for devising a new metric through the use of data-mining techniques. In this paper we propose: (1) the use of a genetic distance metric for improving the selection of the algorithms that best solve a given instance of the ATSP and (2) the use of discriminant analysis as a means for predictive learning (data-mining techniques) aiming at selecting meta-heuristic algorithms. [ABSTRACT FROM AUTHOR]