Cost-Sensitive Decision Trees with Completion Time Requirements

In many classification tasks, managing costs and completion times are the main concerns. In this paper, we assume that the completion time for classifying an instance is determined by its class label, and that a late penalty cost is incurred if the deadline is not met. This time requirement enriches the classification problem but posts a challenge to developing a solution algorithm. We propose an innovative approach for the decision tree induction, which produces multiple candidate trees by allowing more than one splitting attribute at each node. The user can specify the maximum number of candidate trees to control the computational efforts required to produce the final solution. In the tree-induction process, an allocation scheme is used to dynamically distribute the given number of candidate trees to splitting attributes according to their estimated contributions to cost reduction. The algorithm finds the final tree by backtracking. An extensive experiment shows that the algorithm outperforms the top-down heuristic and can effectively obtain the optimal or near-optimal decision trees without an excessive computation time.classification, decision tree, cost and time sensitive learning, late penalty

Using Non-Additive Measure for Optimization-Based Nonlinear Classification

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, 2 – 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 a relatively small number of training cases available (). 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

Noise Models in Classification: Unified Nomenclature, Extended Taxonomy and Pragmatic Categorization

This paper presents the first review of noise models in classification covering both label and attribute noise. Their study reveals the lack of a unified nomenclature in this field. In order to address this problem, a tripartite nomenclature based on the structural analysis of existing noise models is proposed. Additionally, a revision of their current taxonomies is carried out, which are combined and updated to better reflect the nature of any model. Finally, a categorization of noise models is proposed from a practical point of view depending on the characteristics of noise and the study purpose. These contributions provide a variety of models to introduce noise, their characteristics according to the proposed taxonomy and a unified way of naming them, which will facilitate their identification and study, as well as the reproducibility of future research

Hyperspectral Image Classification for Remote Sensing

This thesis is focused on deep learning-based, pixel-wise classification of hyperspectral images (HSI) in remote sensing. Although presence of many spectral bands in an HSI provides a valuable source of features, dimensionality reduction is often performed in the pre-processing step to reduce the correlation between bands. Most of the deep learning-based classification algorithms use unsupervised dimensionality reduction methods such as principal component analysis (PCA). However, in this thesis in order to take advantage of class discriminatory information in the dimensionality reduction step as well as power of deep neural network we propose a new method that combines a supervised dimensionality reduction technique, principal component discriminant analysis (PCDA) and deep learning. Furthermore, in this thesis in order to overcome the common problem of inadequacy of labeled samples in remote sensing HSI classification, we propose a spectral perturbation method to augment the number of training samples and improve the classification results. Since combining spatial and spectral information can dramatically improve HSI classification results, in this thesis we propose a new spectral-spatial feature vector. In our feature vector, based on their proximity to the dominant edges, neighbors of a target pixel have different contributions in forming the spatial information. To obtain such a proximity measure, we propose a method to compute the distance transform image of the input HSI. We then improved the spatial feature vector by adding extended multi attribute profile (EMAP) features to it. Classification accuracies demonstrate the effectiveness of our proposed method in generating a powerful, expressive spectral-spatial feature vector

Green BPM as a business-oriented discipline : a systematic mapping study and research agenda

Green Business Process Management (BPM) focuses on the ecological impact of business processes. This article provides a systematic mapping study of Green BPM literature to evaluate five attributes of the Green BPM research area: (1) scope, (2) disciplines, (3) accountability, (4) researchers and (5) quality control. The results allow developing a research agenda to enhance Green BPM as an approach for environmentally sustainable organizations. We rely on a dichotomy of knowledge production to present research directives relevant for both academics and practitioners in order to help close a rigor-relevance gap. The involvement of both communities is crucial for Green BPM to advance as an applied, business-oriented discipline