A novel evolutionary data mining algorithm with applications to churn prediction

Evolutionary Algorithms (EAs) are stochastic search algorithms inspired by the process of neo-Darwinian evolution. The motivation for applying EAs to data mining is that they are robust, adaptive search techniques that perform a global search in the solution space. This chapter first presents a brief overview of EAs, focusing mainly on two kinds of EAs, viz. Genetic Algorithms (GAs) and Genetic Programming (GP). Then the chapter reviews the main concepts and principles used by EAs designed for solving several data mining tasks, namely: discovery of classification rules, clustering, attribute selection and attribute construction. Finally, it discusses Multi-Objective EAs, based on the concept of Pareto dominance, and their use in several data mining tasks.

Recent advances in computing, communications, digital storage technologies, and high-throughput data-acquisition technologies, make it possible to gather and store incredible volumes of data. It creates unprecedented opportunities for large-scale knowledge discovery from huge database. Data mining (DM) technology has emerged as a means of performing this discovery. There are countless researchers working on designing efficient data mining techniques, methods, and algorithms. Many data mining methods and algorithms have been developed and applied in a lot of application fields [1]. Unfortunately, most data mining researchers pay much attention to technique problems for developing data mining models and methods, while little to basic issues of data mining [2]. In this talk, some basic issues of data mining are addressed. What is data mining? What is the product of a data mining process? What are we doing in a data mining process? What is the rule we should obey in a data mining process? Through analyzing existing data mining methods, and domain-driven (or user-driven) data mining models [3-5], we find that we should take a data mining process as a process of knowledge transformation. Based on this understanding of data mining, a conceptual data mining model of domain-oriented data-driven data mining (3DM) is proposed [2]. The relationship between traditional domain-driven (or user-driven) data mining models and our proposed 3DM model is also analyzed. Some domain-oriented data-driven data mining algorithms for mining such knowledge as default rule [6], decision tree [7], and concept lattice [8] from database are proposed. The experiment results for these algorithms are also shown to illustrate the efficiency and performance of the knowledge acquired by our 3DM data mining algorithms.

In data mining, nugget discovery is the discovery of interesting classification rules that apply to a target class. In previous research, heuristic methods (genetic algorithms, simulated annealing and tabu search) have been used to optimise a single measure of interest. This paper proposes the use of multi-objective optimisation evolutionary algorithms to allow the user to interactively select a number of interest measures and deliver the best nuggets (an approximation to the Pareto-optimal set) according to those measures. Initial experiments are conducted on a number of databases, using an implementation of the fast elitist non-dominated sorting genetic algorithm (NSGA), and two well known measures of interest. Comparisons with the results obtained using modern heuristic methods are presented. Results indicate the potential of multi-objective evolutionary algorithms for the task of nugget discovery.

With the huge amount of information available online, the World Wide Web is a fertile area for data mining research. The data mining research is at the cross road of research from several research communities, such as database, information retrieval, and within AI, especially the sub-areas of machine learning and data integrity. Every E-commerce and social website in World Wide Web uses the Classification is one of the data mining problems receiving great attention recently in the database community. Neural network is not suitable for data mining directly, because how the classifications were made is not explicitly stated as symbolic rules that are suitable for verification or interpretation by humans. Different concise symbolic rules with high accuracy can be extracted from a neural network with the proposed approach. The neural network is first trained to achieve the required accuracy in data mining. In this paper we are going to combine neural network with the three different algorithms which are commonly used in data mining to improve the data mining result. These three algorithms are CHARM Algorithm, Top K Rules mining and CM SPAM Algorithm. The different datasets of online e-commerce website filpkart and Amazon are used to train the neural network and to use in data mining. The results of all three data mining algorithm with neural network techniques then tested on the available datasets and result are compared by computational complexity of the algorithm.

Noting that several rule discovery algorithms in data mining can produce a large number of irrelevant or obvious rules from data, there has been substantial research in data mining that addressed the issue of what makes rules truly 'interesting'. This resulted in the development of a number of interestingness measures and algorithms that find all interesting rules from data. However, these approaches have the drawback that many of the discovered rules, while supposed to be interesting by definition, may actually (1) be obvious in that they logically follow from other discovered rules or (2) be expected given some of the other discovered rules and some simple distributional assumptions. In this paper we argue that this is a paradox since rules that are supposed to be interesting, in reality are uninteresting for the above reason. We show that this paradox exists for various popular interestingness measures and present an abstract characterization of an approach to alleviate the paradox. We finally discuss existing work in data mining that addresses this issue and show how these approaches can be viewed with respect to the characterization presented here.

Preparing a data set for analysis is generally the most time consuming task in a data mining project, requiring many complex SQL queries, joining tables and aggregating columns. Existing SQL aggregations have limitations to prepare data sets because they return one column per aggregated group. In general, a significant manual effort is required to build data sets, where a horizontal layout is required. We propose simple, yet powerful, methods to generate SQL code to return aggregated columns in a horizontal tabular layout, returning a set of numbers instead of one number per row. This new class of functions is called horizontal aggregations. Horizontal aggregations build data sets with a horizontal denormalized layout (e.g. point-dimension, observation-variable, instance-feature), which is the standard layout required by most data mining algorithms. We propose three fundamental methods to evaluate horizontal aggregations: CASE: Exploiting the programming CASE construct; SPJ: Based on standard relational algebra operators (SPJ queries); PIVOT: Using the PIVOT operator, which is offered by some DBMSs. Experiments with large tables compare the proposed query evaluation methods. Our CASE method has similar speed to the PIVOT operator and it is much faster than the SPJ method. In general, the CASE and PIVOT methods exhibit linear scalability, where as the SPJ method does not. In a relational database, especially with normalized tables, a significant effort is required to prepare a summary data set that can be used as input for a data mining or statistical algorithm. Most algorithms require as input a data set with a horizontal layout, with several Records and one variable or dimension per column. That is the case with models like clustering, classification, regression and PCA; consult. Each research discipline uses different terminology to describe the data set. In data mining the common terms are point-dimension. Statistics literature generally uses observation-variable. Machine learning research uses instance-feature. This article introduces a new class of aggregate functions that can be used to build data sets in a horizontal layout (denormalized with aggregations), automating SQL query writing and extending SQL capabilities. We show evaluating horizontal aggregations is a challenging and interesting problem and we introduced alternative methods and optimizations for their efficient evaluation. II. MOTIVATION As mentioned above, building a suitable data set for data mining purposes is a time- consuming task. This task generally requires writing long SQL statements or customizing SQL Code if it is automatically generated by some tool. There are two main ingredients in such SQL code: joins and aggregations; we focus on the second one. The most widely- known aggregation is the sum of a column over groups of rows. Some other aggregations return the average, maximum, minimum or row count over groups of rows. There exist many aggregations functions and operators in SQL. Unfortunately, all these aggregations have limitations to build data sets for data mining purposes. The main reason is that, in general, data sets that are stored in a relational database (or a data warehouse) come

Deriving useful and interesting rules from a data mining system is an essential and important task. Problems such as the discovery of random and coincidental patterns or patterns with no significant values, and the generation of a large volume of rules from a database commonly occur. Works on sustaining the interestingness of rules generated by data mining algorithms are actively and constantly being examined and developed. In this paper, a systematic way to evaluate the association rules discovered from frequent itemset mining algorithms, combining common data mining and statistical interestingness measures, and outline an appropriated sequence of usage is presented. The experiments are performed using a number of real-world datasets that represent diverse characteristics of data/items, and detailed evaluation of rule sets is provided. Empirical results show that with a proper combination of data mining and statistical analysis, the framework is capable of eliminating a large number of non-significant, redundant and contradictive rules while preserving relatively valuable high accuracy and coverage rules when used in the classification problem. Moreover, the results reveal the important characteristics of mining frequent itemsets, and the impact of confidence measure for the classification task

Eye diseases are very common diseases in the medical field. High intraocular pressure is one of serious eye diseases, which leads to the loss of vision in the affected eye. Thus, how to effectively discover the hidden risk factors from large data of high intraocular pressure is a very significant and challenging issue. Data mining algorithms (such as classification and association rules) can discover the hidden knowledge from large-scaled data sets in many real-world applications especially in the medical field. Therefore, this paper focuses on finding out the risk factors hidden in high intraocular pressure effectively and efficiently by using J48, and Apriori algorithms. In terms of these data mining algorithms, we can discover some interesting and useful rules in the data set of eye disease. Results of the study discover some risk factors of high intraocular pressure which have been proved by medical trials. The experimental study demonstrates the effective and usability of data mining techniques in Medical field. Meanwhile, this study discovers some new risk factors for high intraocular pressure which have not been discovered previously by studies based on medical trials. This knowledge will contribute to early detection and preventing blindness by recognizing risk factors for high intraocular pressure.

Liver cirrhosis or hepatic cirrhosis is termed as condition in which the liver of patient not working properly owing to damage by various factors. In a present day, data mining in the field of medical is an important tool to explore the sign patterns in term of medical data sets. The aim of current study is to investigate a method for the classification system of liver cirrhosis in data findings in databases utilizing data mining method which are used in present time. In the data mining system and research work, the Tanagra data mining device, an accurate classifier algorithm and an open source project is used. By using different classification algorithms, we find a pattern which is formed in it. Fischer filtering was good feature in feature selection algorithm. Limited number of attributes in filtering algorithm along with better classification system were chosen and executed. The architecture model flow includes: training dataset, feature relevance analysis, classification process i.e. classification and regression tree, random tree binary logistic regression, support vector machine accuracy analysis. The research work was accomplished on the basis classification algorithms including training and test datsets along with well obtained characterized data. The classification process categorized the liver cirrhosis in dataset and provides better results. The feature relevance analysis displays the different important characteristics which are intended for. The experiment is projected to prove the efficiency of the presentation of numerous classifiers to the liver cirrhosis and dataset used in it. Primary diagnosis of any.

Discovery of Classification Rules Using Distributed Genetic Algorithm

Knowledge discovery from genomic data has become an important research area for biologists. Nowadays, a lot of data is available on the web, but the corresponding knowledge is not necessarly also available. For example, the first draft of the human genome, which contains 3×109 letters, has been achieved in June 2000, but up to now only a small part of the hidden knowledge has been discovered. The aim of bioinformatics is to bring together biology, computer science, mathematics, statistics and information theory to analyze biological data for interpretation and prediction. Hence many problems encountered while studying genomic data may be modeled as data mining tasks, such as feature selection, classification, clustering, and association rule discovery. An important characteristic of genomic applications is the large amount of data to analyze and it is, most of the time, not possible to enumerate all the possibilities. Therefore, we propose to model these knowledge discovery tasks as combinatorial optimization tasks, in order to apply efficient optimization algorithms to extract knowledge from large datasets. To design an efficient optimization algorithm, several aspects have to be considered. The main one is the choice of the type of resolution method according to the characteristics of the problem. Is it an easy problem, for which a polynomial algorithm may be found? If yes, let us design such an algorithm. Unfortunately, most of the time the response to the question is ‘NO’ and only heuristics, that may find good but not necessarily optimal solutions, can be used. In our approach we focus on evolutionary computation, which has already shown an interesting ability to solve highly complex combinatorial problems. In this chapter, we will show the efficiency of such an approach while describing the main steps required to solve data mining problems from genomics with evolutionary algorithms. We will illustrate these steps with a real problem.

There are many data mining algorithms and methodologies for various fields and various problematic. Each data mining researcher/practitioner should describe the intrinsic quality of the discovered models and patterns. In addition he/she is faced with assessing the performance of his/her own solution(s) in order to make –fair– comparisons with state of the art approaches. Which methodology, which benchmarks, which measures of performance, which tools, which measures of interest, which scenarios, etc., should be used, and why? Every one should answer these questions, and assessing the quality and the performance of a data mining process is a critical issue. Assessing the quality and the performance is a critical issue for classical situations and even more in the Big Data era where we can not manage this issue with classical and current approaches. Clearly, large scale data, complex data and streaming data bring new challenges (e.g. large scale inference, fake correlations, necessity of perpetual validation). In this setting, the Quality Issues, Measures of Interestingness and Evaluation of data mining models Workshop series provide an open forum for intensive discussions and the exchange of new ideas and best practices on quality issues among data mining researchers. QIMIE focuses on the theory, the techniques, the links between the discovery stage and the quality assessment stage, and the practices that can ensure that the discovered knowledge of a data mining process is of quality. It is organized with the IEEE Task Force on Evaluation and Quality issues (Data Mining and Big Data Analytics Technical Committee, IEEE Computational Intelligence Society).

Bio-Inspired Approaches in Sequence and Data Streams.- Adaptive and Self-adaptive Techniques for Evolutionary Forecasting Applications Set in Dynamic and Uncertain Environments.- Sequence Pattern Mining.- Growing Self-Organizing Map for Online Continuous Clustering.- Synthesis of Spatio-temporal Models by the Evolution of Non-uniform Cellular Automata.- Bio-Inspired Approaches in Classification Problem.- Genetic Selection Algorithm and Cloning for Data Mining with GMDH Method.- Inducing Relational Fuzzy Classification Rules by Means of Cooperative Coevolution.- Post-processing Evolved Decision Trees.- Evolutionary Fuzzy and Swarm in Clustering Problems.- Evolutionary Fuzzy Clustering: An Overview and Efficiency Issues.- Stability-Based Model Order Selection for Clustering Using Multiple Cooperative Particle Swarms.- Genetic and Evolutionary Algorithms in Bioinformatics.- Data-Mining Protein Structure by Clustering, Segmentation and Evolutionary Algorithms.- A Clustering Genetic Algorithm for Genomic Data Mining.- Detection of Remote Protein Homologs Using Social Programming.- Bio-Inspired Approaches in Information Retrieval and Visualization.- Optimizing Information Retrieval Using Evolutionary Algorithms and Fuzzy Inference System.- Web Data Clustering.- Efficient Construction of Image Feature Extraction Programs by Using Linear Genetic Programming with Fitness Retrieval and Intermediate-Result Caching.- Mining Network Traffic Data for Attacks through MOVICAB-IDS.

Data mining (DM) research has successfully developed advanced DM techniques and algorithms over the last few decades, and many organisations have great expectations to take more benefit of their data warehouses in decision making. Currently, the strong focus of most DM-researchers is still only on technology-oriented topics. Commonly the DM research has several stakeholders, the major of which can be divided into internal and external ones each having their own point of view, and which are at least partly conflicting. The most important internal groups of stakeholders are the DM research community and academics in other disciplines. The most important external stakeholder groups are managers and domain experts who have their own utility-based interests to DM and DM research results. In this paper we discuss these practice-oriented points of view towards DM research and suggest broader discussions inside the DM research community about who should do that kind of research. We bring in the discussion several topics developed in the information systems (IS) discipline and show some similarities between IS and DM systems. DM systems have also their own peculiarities and we conclude that researchers who take into account human and organisational aspects related to DM systems need to have also some understanding about DM. This makes us suggest that the research area inside the DM community should be made broader than the current heavily technology-oriented one.

Robot basketball is an emerging cross-discipline, involving robotics, intelligent control and image processing, computer vision and other fields, but as the amount of data collected by the system increases sharply, this information comes from different times and uses different expressions As the amount of information continues to increase, its effectiveness is limited. The purpose of this article is to study the positioning of the basketball robot’s target recognition system based on data mining algorithms. Based on the research of data mining, support vector machines and related technologies, this paper establishes an SVM method to realize basketball robot target recognition. Experimental research shows that, according to the measurement accuracy characteristics of the binocular vision system, when the object distance L=500mm~600mm is used, the relative error of the measurement is small and the system accuracy is high.