Data mining and image analysis using genetic programming

Over the past few decades, numerous optimization-based methods have been proposed for solving the classification problem in data mining. Classic optimization-based methods do not consider attribute interactions toward classification. Thus, a novel learning machine is needed to provide a better understanding on the nature of classification when the interaction among contributions from various attributes cannot be ignored. The interactions can be described by a non-additive measure while the Choquet integral can serve as the mathematical tool to aggregate the values of attributes and the corresponding values of a non-additive measure. As a main part of this research, a new nonlinear classification method with non-additive measures is proposed. Experimental results show that applying non-additive measures on the classic optimization-based models improves the classification robustness and accuracy compared with some popular classification methods. In addition, motivated by well-known Support Vector Machine approach, we transform the primal optimization-based nonlinear classification model with the signed non-additive measure into its dual form by applying Lagrangian optimization theory and Wolfes dual programming theory. As a result, 2n – 1 parameters of the signed non-additive measure can now be approximated with m (number of records) Lagrangian multipliers by applying necessary conditions of the primal classification problem to be optimal. This method of parameter approximation is a breakthrough for solving a non-additive measure practically when there are relatively small number of training cases available (mn－1). Furthermore, the kernel-based learning method engages the nonlinear classifiers to achieve better classification accuracy. The research produces practically deliverable nonlinear models with the non-additive measure for classification problem in data mining when interactions among attributes are considered.

- The development of increasingly advanced IT in the process of presidential elections. When the Presidential election of 2014 yesterday has a lot of people use the phrase does not educate inappropriate to be delivered among the public. Pros and cons indeed occur among people are so warm that they pour on the internet. This happens because when getting warm diperbincangan 2014 presidential election yesterday happened pengkubu-kubuan two candidates. Society can not adjust the development of IT process well. Naive Bayes is widely used for classification problems in data mining and machine learning for its simplicity and accuracy of classification impressive. Naive Bayes classifier has been shown to be very effective to solve the problem of large scale for text categorization with high accuracy. In addition to having many capabilities mentioned above, however this method has a drawback in the assumptions that are difficult to fulfill, namely the independence of the feature. Particle Swarm Optimization (PSO) is an evolutionary computation technique which is able to produce globally optimal solution in the search space through the interaction of individuals in a swarm of particles. PSO is widely used to solve optimization problems as well as the feature selection. Accuracy is generated on Naive Bayes algorithm amounted to 63.85% and AUC by 0523, while Naive Bayes and Particle Swarm Optimmization with an accuracy of 71.15% and the AUC of 0.600. It can be concluded that the application of optimization can improve the accuracy of 63.85% to 71.15%. Naive Bayes Model and Particle Swarm Optimization can provide solutions to the problems of classification review of public opinion news of the election in order to more accurately and optimally. Keywords:Public Opinion, Classification, Naive Bayes, Particle Swarm Optimization, Text Mining.

Credit assessment is a very typical classification problem in Data Mining. A type of classification technique that has attracted an increasing number of attempts in recent years is finding classification rules based on association rule mining techniques. This paper aims to contribute to this kind of research by classifying the bank's customers via association rules with the use of the APRIORI algorithm and CRISP-DM methodology and considering the Experts' opinions to filter the obtained rules and define the Membership functions for the considered criteria, finally a Fuzzy Expert System is designed based on the selected rules from association rules to specify the Credit Degree of banks' customers. The presented steps have been studied in an Iranian Bank as empirical study.

Discovering how Mesenchymal Stem Cells (MSCs) can be differentiated is an important topic in stem cell therapy and tissue engineering. In a general context, such differentiation analysis can be modeled as a classification problem in data mining. Specifically, this is concerned with the single-label multi-class classification task. Previous studies on this topic suggests the Associative Classification (AC) rather than other alternative (Classification) techniques, and presented classification results based on the CMAR (Classification based on Multiple Association Rules) associative classifier. Other AC algorithms include: CBA (Classification Based on Associations), PRM (Predictive Rule Mining), CPAR (Classification based on Predictive Association Rules) and TFPC (Total From Partial Classification). The main aim of this chapter is to compare the performance of different associative classifiers, in terms of classification accuracy, efficiency, number of rules to be generated, quality of such rules, and the maximum number of attributes in rule-antecedents, with respect to MSC differentiation analysis.

A data mining based procedure for automated reverse engineering and defect discovery has been developed. The data mining algorithm for reverse engineering uses a genetic program (GP) as a data mining function. A GP is an evolutionary algorithm that automatically evolves populations of computer programs or mathematical expressions, eventually selecting one that is optimal in the sense it maximizes a fitness function. The system to be reverse engineered is typically a sensor that may not be disassembled and for which there are no design documents. The sensor is used to create a database of input signals and output measurements. Rules about the likely design properties of the sensor are collected from experts. The rules are used to create a fitness function for the GP allowing GP based data mining. This procedure incorporates not only the experts’ rules into the fitness function, but also the information in the database. The information extracted through this process is the internal design specifications of the sensor. These design properties can be used to create a fitness function for a genetic algorithm, which is in turn used to search for defects in the digital logic design. Significant theoretical and experimental results are provided.

: A data mining based procedure for automated reverse engineering has been developed. The data mining algorithm for reverse engineering uses a genetic program (GP) as a data mining function. A genetic program is an algorithm based on the theory of evolution that automatically evolves populations of computer programs or mathematical expressions, eventually selecting one that is optimal in the sense it maximizes a measure of effectiveness, referred to as a fitness function. The system to be reverse engineered is typically a sensor. Design documents for the sensor are not available and conditions prevent the sensor from being taken apart. The sensor is used to create a database of input signals and output measurements. Rules about the likely design properties of the sensor are collected from experts. The rules are used to create a fitness function for the genetic program. Genetic program based data mining is then conducted. This procedure incorporates not only the experts? rules into the fitness function, but also the information in the database. The information extracted through this process is the internal design specifications of the sensor. Significant mathematical formalism and experimental results related to GP based data mining for reverse engineering will be provided.

This paper investigates the unexpected convergence behaviour of genetic Programming (GP) for classification problems. Firstly the paper investigates the relationship between computational effort and attainable classification accuracy. Secondly we attempt to understand why GP classifiers sometimes fail to reach satisfactory levels of accuracy for certain problems regardless of computational effort. The investigation uses an artificially generated dataset for which certain properties are known in advance for the exploration of these areas.Results from this artificial problem show that by increasing computational effort, in the form of larger population sizes and more generations, the probability of success for a run does improve, but that the computational cost far outweighs the rate of this success. Also, some runs, even with very large populations running for many generations, became stagnant and were unable to find an acceptable solution. These results are also reflected in real world classification problems.From analysis of sub-tree components making up successful and unsuccessful programs it was noted that a small number of particular components were almost always present in successful programs, and that these components were often absent from unsuccessful programs. Also a variety of components appeared in unsuccessful programs that were never present in successful ones. Evidence from runs suggests that these components represent paths leading to optimal and sub-optimal branches in the evolutionary search space. Additionally, results suggest that if suboptimal components (which mirror the concept of deception in genetic algorithms) are relatively greater in number than the optimal components for the problem, then the chances of GP finding a successful solution are reduced.

Many real-world problems have an uneven distribution of data over different classes. The imbalanced nature of data impacts the performance of classifiers. The higher counts of majority class samples influence the learning abilities of well-known classifiers. Genetic programming (GP) algorithm based on natural evolution also impacts if the data’s nature is imbalanced. The fitness function plays a pivotal role and impacts almost each building block of the GP framework. GP with the standard fitness function produces under-fitted and biased classifiers. Therefore, this paper has proposed a new fitness function in GP to classify the imbalanced data. The proposed method is used to classify nine imbalanced problems: ABL-18, ABL-9-18, BAL, YEAST2, YEAST1, ABL-9, ION, WDBC, and SPECT. The imbalanced factor of benchmark problems varies from 99:1 to 59:41. The proposed method’s performance is compared with K-Nearest-Neighbourhood (KNN) and the standard fitness function-based GP methods. The GP with newly proposed fitness function gives average AUC values for ABL-18(99:1), ABL-9-18(94:6), BAL(92:8), YEAST2(89:11), YEAST1(84:16), ABL-9(83:17), ION(64:36), WDBC(63:37), and SPECT(59:41) as 0.714, 0.812, 0.975, 0.916, 0.768, 0.654, 0.872, 0.939, and 0.704, respectively, which are higher than KNN and the standard fitness function-based GP methods. The result outcomes prove the superiority of the proposed method.

Genetic programming (GP) is used to classify tumours based on 1H nuclear magnetic resonance (NMR) spectra of biopsy extracts. Analysis of such data would ideally give not only a classification result but also indicate which parts of the spectra are driving the classification (i.e. feature selection). Experiments on a database of variables derived from 1H NMR spectra from human brain tumour extracts (n = 75) are reported, showing GP's classification abilities and comparing them with that of a neural network. GP successfully classified the data into meningioma and non-meningioma classes. The advantage over the neural network method was that it made use of simple combinations of a small group of metabolites, in particular glutamine, glutamate and alanine. This may help in the choice of the most informative NMR spectroscopy methods for future non-invasive studies in patients.

The figure of merit (FOM) is popular for testing an edge detector's performance, but there are very few reports using FOM as an evaluation method in Genetic Programming (GP). In this study, FOM is investigated as a fitness function in GP for edge detection. Since FOM has some drawbacks from type II errors, new fitness functions are developed based on FOM in order to address these weaknesses. Experimental results show that FOM can be used to evolve GP edge detectors that perform better than the Sobel detector, and the new fitness functions clearly improve the ability of GP edge detectors to find edge points and give a single response on edges, compared with the fitness function using FOM.

Data Mining refers to a set of methods applicable to large and complex databases to eliminate the randomness and discover the hidden pattern. Datamining (DM), also known as knowledge discovery from databases (KDD), is the extraction of new knowledge from huge databases. Data mining involves the use of sophisticated data analysis tools to discover previously unknown, valid patterns and relationships in large data sets. Data mining tools can forecast the future trends and activities to support the decision of people. The scope of datamining is associated with Uncovering trends and patterns are a great power for the businesses of all sectors and industries. Modern intrusion detection applications are confronted with a variety of issues. These applications must be reliable, extensible, manageable, and minimal in maintenance costs. Data mining-based intrusion detection systems (IDSs) have shown high accuracy, good generalisation to novel types of intrusion, and stable behaviour in a changing environment in recent years. The number of hidden layers in various neural network topologies is evaluated in order to discover the best neural network. The technique of attempting to discover instances of network attacks by comparing current behaviour to the expected actions of an intruder is known as misuse detection. Artificial neural networks have the ability to detect and classify network activity using data that is limited, incomplete, and nonlinear. The main purpose of this work is to identify privacy and security concerns among cloud computing participants and consumers in a distributed environment. Techniques like Machine Learning, Natural Language Processing (NLP), and Data Mining are combined to automatically identify and uncover patterns from many sorts of materials. Predictive analytics is capable of dealing with both continuous and discontinuous changes. Classification, prediction, and to some extent, affinity analysis constitute the analytical methods employed in predictive analytics. The contemporary study in text or document mining is focusing on syntactic components and the semantic environment. In order to accomplish this, and with the motivation gained from our previous research contributions, we investigated a mining model to classify documents based on the Order of Context, Concept, and Semantic Relations (OCCSR). The use of data mining techniques based on Cloud computing will enable users to retrieve meaningful information from virtually integrated data warehouses, lowering infrastructure and storage costs. Data mining can extract useful and potentially useful information from the cloud. Big Data is typically defined by three characteristics known as the 3Vs (Volume, Velocity and Variety). The surveys approaches, environments, and technologies in key areas for Big Data analytics capabilities and discusses how they aid in the development of analytics solutions for Clouds. The clustering technique belongs to an unsupervised learning and it is used to discover a new set of categories. Grid-based clustering has the shortest processing time, which is typically determined by the size of the grid rather than the data. We compare the performance of three clustering algorithms: hierarchical clustering, density-based clustering, and K Means clustering. The majority of current approaches to detecting misuse involve the use of rule-based expert systems to identify indicators of known attacks. We provide a brief overview of the use of various Artificial Intelligence techniques and their advancements in the design, development, and application of Intrusion Detection Systems (IDS) for protecting computer and communication networks from intruders. The goal of Knowledge Discovery in Data (KDD) is to extract information that is not obvious by using careful and detailed analysis and interpretation. To drive decisions and actions, analytics employs KDD, data mining, text mining, statistical and quantitative analysis, explanatory and predictive models, and advanced and interactive visualisation techniques.

Chronic kidney disease (CKD) is one of the serious health concerns in the twenty-first century. CKD impacts over 37 million Americans. By applying machine learning (ML) techniques to clinical data, CKD can be diagnosed early. This early detection of CKD can prevent numerous loss of life. In this work, clinical data set of 400 patients, available on the UCI repository, are taken. Unfortunately, this data set doesn’t have an equal distribution of CKD and Non-CKD samples. This imbalanced nature of data highly influences the learning capabilities of classifiers. Genetic Programming (GP) is an ML technique based on the evolution of species. GP with standard fitness function, also impacted by this imbalanced nature of data. A new Euclidean distance-based fitness function in GP is proposed to handle this imbalanced nature of the data set. To compare the robustness of the proposed work, other classification techniques, K-nearest neighborhood (KNN), KNN with particle swarm optimization (PSO), and GP with the standard fitness function, is also applied. For ten-fold cross-validation, the KNN shows an accuracy of 83.54% with an AUC value of 0.69, the PSO-KNN shows an accuracy of 96.79% with an AUC value of 0.94, and the GP, with the newly proposed fitness function, supersedes KNN and PSO-KNN and shows the accuracy of 99.33% with an AUC value of 0.99.

Knowledge discovery in databases and data mining aim at semiautomatic tools for the analysis of large data sets. We consider some methods used in data mining, concentrating on levelwise search for all frequently occurring patterns. We show how this technique can be used in various applications. We also discuss possibilities for compiling data mining queries into algorithms, and look at the use of sampling in data mining. We conclude by listing several open research problems in data mining and knowledge discovery.

The ensemble of evolving neural networks, which employs neural networks and genetic algorithms, is developed for classification problems in data mining. This network meets data mining requirements such as smart architecture, user interaction, and performance. The evolving neural network has a smart architecture in that it is able to select inputs from the environment and controls its topology. A built-in objective function of the network offers user interaction for customized classification. The bagging technique, which uses a portion of the training set in multiple networks, is applied to the ensemble of evolving neural networks in order to improve classification performance. The ensemble of evolving neural networks is tested by various data sets and produces better performance than both classical neural networks and simple ensemble methods.

Genetic programming (GP) has emerged as a promising approach to deal with the classification task in data mining. This paper extends the tree representation of GP to evolve multiple comprehensible IF-THEN classification rules. We introduce a concept mapping technique for the fitness evaluation of individuals. A covering algorithm that employs an artificial immune system-like memory vector is utilized to produce multiple rules as well as to remove redundant rules. The proposed GP classifier is validated on nine benchmark data sets, and the simulation results confirm the viability and effectiveness of the GP approach for solving data mining problems in a wide spectrum of application domains.