scholarly journals Genetic programming for region detection, feature extraction, feature construction and classification in image data

2020 ◽  
Author(s):  
Andrew Lensen ◽  
Harith Al-Sahaf ◽  
Mengjie Zhang ◽  
Bing Xue

© Springer International Publishing Switzerland 2016. Image analysis is a key area in the computer vision domain that has many applications. Genetic Programming (GP) has been successfully applied to this area extensively, with promising results. Highlevel features extracted from methods such as Speeded Up Robust Features (SURF) and Histogram of Oriented Gradients (HoG) are commonly used for object detection with machine learning techniques. However, GP techniques are not often used with these methods, despite being applied extensively to image analysis problems. Combining the training process of GP with the powerful features extracted by SURF or HoG has the potential to improve the performance by generating high-level, domain-tailored features. This paper proposes a new GP method that automatically detects different regions of an image, extracts HoG features from those regions, and simultaneously evolves a classifier for image classification. By extending an existing GP region selection approach to incorporate the HoG algorithm, we present a novel way of using high-level features with GP for image classification. The ability of GP to explore a large search space in an efficient manner allows all stages of the new method to be optimised simultaneously, unlike in existing approaches. The new approach is applied across a range of datasets, with promising results when compared to a variety of well-known machine learning techniques. Some high-performing GP individuals are analysed to give insight into how GP can effectively be used with high-level features for image classification.

2020 ◽  
Author(s):  
Andrew Lensen ◽  
Harith Al-Sahaf ◽  
Mengjie Zhang ◽  
Bing Xue

© Springer International Publishing Switzerland 2016. Image analysis is a key area in the computer vision domain that has many applications. Genetic Programming (GP) has been successfully applied to this area extensively, with promising results. Highlevel features extracted from methods such as Speeded Up Robust Features (SURF) and Histogram of Oriented Gradients (HoG) are commonly used for object detection with machine learning techniques. However, GP techniques are not often used with these methods, despite being applied extensively to image analysis problems. Combining the training process of GP with the powerful features extracted by SURF or HoG has the potential to improve the performance by generating high-level, domain-tailored features. This paper proposes a new GP method that automatically detects different regions of an image, extracts HoG features from those regions, and simultaneously evolves a classifier for image classification. By extending an existing GP region selection approach to incorporate the HoG algorithm, we present a novel way of using high-level features with GP for image classification. The ability of GP to explore a large search space in an efficient manner allows all stages of the new method to be optimised simultaneously, unlike in existing approaches. The new approach is applied across a range of datasets, with promising results when compared to a variety of well-known machine learning techniques. Some high-performing GP individuals are analysed to give insight into how GP can effectively be used with high-level features for image classification.


2021 ◽  
Author(s):  
◽  
Cao Truong Tran

<p>Classification is a major task in machine learning and data mining. Many real-world datasets suffer from the unavoidable issue of missing values. Classification with incomplete data has to be carefully handled because inadequate treatment of missing values will cause large classification errors.    Existing most researchers working on classification with incomplete data focused on improving the effectiveness, but did not adequately address the issue of the efficiency of applying the classifiers to classify unseen instances, which is much more important than the act of creating classifiers. A common approach to classification with incomplete data is to use imputation methods to replace missing values with plausible values before building classifiers and classifying unseen instances. This approach provides complete data which can be then used by any classification algorithm, but sophisticated imputation methods are usually computationally intensive, especially for the application process of classification. Another approach to classification with incomplete data is to build a classifier that can directly work with missing values. This approach does not require time for estimating missing values, but it often generates inaccurate and complex classifiers when faced with numerous missing values. A recent approach to classification with incomplete data which also avoids estimating missing values is to build a set of classifiers which then is used to select applicable classifiers for classifying unseen instances. However, this approach is also often inaccurate and takes a long time to find applicable classifiers when faced with numerous missing values.   The overall goal of the thesis is to simultaneously improve the effectiveness and efficiency of classification with incomplete data by using evolutionary machine learning techniques for feature selection, clustering, ensemble learning, feature construction and constructing classifiers.   The thesis develops approaches for improving imputation for classification with incomplete data by integrating clustering and feature selection with imputation. The approaches improve both the effectiveness and the efficiency of using imputation for classification with incomplete data.   The thesis develops wrapper-based feature selection methods to improve input space for classification algorithms that are able to work directly with incomplete data. The methods not only improve the classification accuracy, but also reduce the complexity of classifiers able to work directly with incomplete data.   The thesis develops a feature construction method to improve input space for classification algorithms with incomplete data by proposing interval genetic programming-genetic programming with a set of interval functions. The method improves the classification accuracy and reduces the complexity of classifiers.   The thesis develops an ensemble approach to classification with incomplete data by integrating imputation, feature selection, and ensemble learning. The results show that the approach is more accurate, and faster than previous common methods for classification with incomplete data.   The thesis develops interval genetic programming to directly evolve classifiers for incomplete data. The results show that classifiers generated by interval genetic programming can be more effective and efficient than classifiers generated the combination of imputation and traditional genetic programming. Interval genetic programming is also more effective than common classification algorithms able to work directly with incomplete data.    In summary, the thesis develops a range of approaches for simultaneously improving the effectiveness and efficiency of classification with incomplete data by using a range of evolutionary machine learning techniques.</p>


Author(s):  
Christine A. Toh ◽  
Elizabeth M. Starkey ◽  
Conrad S. Tucker ◽  
Scarlett R. Miller

The emergence of ideation methods that generate large volumes of early-phase ideas has led to a need for reliable and efficient metrics for measuring the creativity of these ideas. However, existing methods of human judgment-based creativity assessments, as well as numeric model-based creativity assessment approaches suffer from low reliability and prohibitive computational burdens on human raters due to the high level of human input needed to calculate creativity scores. In addition, there is a need for an efficient method of computing the creativity of large sets of design ideas typically generated during the design process. This paper focuses on developing and empirically testing a machine learning approach for computing design creativity of large sets of design ideas to increase the efficiency and reliability of creativity evaluation methods in design research. The results of this study show that machine learning techniques can predict creativity of ideas with relatively high accuracy and sensitivity. These findings show that machine learning has the potential to be used for rating the creativity of ideas generated based on their descriptions.


2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Alaa Khadidos ◽  
Adil Khadidos ◽  
Olfat M. Mirza ◽  
Tawfiq Hasanin ◽  
Wegayehu Enbeyle ◽  
...  

The word radiomics, like all domains of type omics, assumes the existence of a large amount of data. Using artificial intelligence, in particular, different machine learning techniques, is a necessary step for better data exploitation. Classically, researchers in this field of radiomics have used conventional machine learning techniques (random forest, for example). More recently, deep learning, a subdomain of machine learning, has emerged. Its applications are increasing, and the results obtained so far have demonstrated their remarkable effectiveness. Several previous studies have explored the potential applications of radiomics in colorectal cancer. These potential applications can be grouped into several categories like evaluation of the reproducibility of texture data, prediction of response to treatment, prediction of the occurrence of metastases, and prediction of survival. Few studies, however, have explored the potential of radiomics in predicting recurrence-free survival. In this study, we evaluated and compared six conventional learning models and a deep learning model, based on MRI textural analysis of patients with locally advanced rectal tumours, correlated with the risk of recidivism; in traditional learning, we compared 2D image analysis models vs. 3D image analysis models, models based on a textural analysis of the tumour versus models taking into account the peritumoural environment in addition to the tumour itself. In deep learning, we built a 16-layer convolutional neural network model, driven by a 2D MRI image database comprising both the native images and the bounding box corresponding to each image.


2017 ◽  
pp. 36-58 ◽  
Author(s):  
Anand Narasimhamurthy

Medical image analysis is an area which has witnessed an increased use of machine learning in recent times. In this chapter, the authors attempt to provide an overview of applications of machine learning techniques to medical imaging problems, focusing on some of the recent work. The target audience comprises of practitioners, engineers, students and researchers working on medical image analysis, no prior knowledge of machine learning is assumed. Although the stress is mostly on medical imaging problems, applications of machine learning to other proximal areas will also be elucidated briefly. Health informatics is a relatively new area which deals with mining large amounts of data to gain useful insights. Some of the common challenges in health informatics will be briefly touched upon and some of the efforts in related directions will be outlined.


Author(s):  
Prakhar Mehrotra

The objective of this chapter is to discuss the integration of advancements made in the field of artificial intelligence into the existing business intelligence tools. Specifically, it discusses how the business intelligence tool can integrate time series analysis, supervised and unsupervised machine learning techniques and natural language processing in it and unlock deeper insights, make predictions, and execute strategic business action from within the tool itself. This chapter also provides a high-level overview of current state of the art AI techniques and provides examples in the realm of business intelligence. The eventual goal of this chapter is to leave readers thinking about what the future of business intelligence would look like and how enterprise can benefit by integrating AI in it.


2002 ◽  
Vol 11 (02) ◽  
pp. 267-282 ◽  
Author(s):  
AGAPITO LEDEZMA ◽  
RICARDO ALER ◽  
DANIEL BORRAJO

Nowadays, there is no doubt that machine learning techniques can be successfully applied to data mining tasks. Currently, the combination of several classifiers is one of the most active fields within inductive machine learning. Examples of such techniques are boosting, bagging and stacking. From these three techniques, stacking is perhaps the less used one. One of the main reasons for this relates to the difficulty to define and parameterize its components: selecting which combination of base classifiers to use, and which classifier to use as the meta-classifier. One could use for that purpose simple search methods (e.g. hill climbing), or more complex ones (e.g. genetic algorithms). But before search is attempted, it is important to know the properties of the search space itself. In this paper we study exhaustively the space of Stacking systems that can be built by using four base learning systems: C4.5, IB1, Naive Bayes, and PART. We have also used the Multiple Linear Response (MLR) as meta-classifier. The properties of this state-space obtained in this paper will be useful for designing new Stacking-based algorithms and tools.


2017 ◽  
Vol 140 ◽  
pp. 61-68 ◽  
Author(s):  
Markos G. Tsipouras ◽  
Nikolaos Giannakeas ◽  
Alexandros T. Tzallas ◽  
Zoe E. Tsianou ◽  
Pinelopi Manousou ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document