A survey of cost-sensitive decision tree induction algorithms

The past decade has seen a significant interest on the problem of inducing decision trees that take account of costs of misclassification and costs of acquiring the features used for decision making. This survey identifies over 50 algorithms including approaches that are direct adaptations of accuracy based methods, use genetic algorithms, use anytime methods and utilize boosting and bagging. The survey brings together these different studies and novel approaches to cost-sensitive decision tree learning, provides a useful taxonomy, a historical timeline of how the field has developed and should provide a useful reference point for future research in this field

Specification-Driven Predictive Business Process Monitoring

Predictive analysis in business process monitoring aims at forecasting the future information of a running business process. The prediction is typically made based on the model extracted from historical process execution logs (event logs). In practice, different business domains might require different kinds of predictions. Hence, it is important to have a means for properly specifying the desired prediction tasks, and a mechanism to deal with these various prediction tasks. Although there have been many studies in this area, they mostly focus on a specific prediction task. This work introduces a language for specifying the desired prediction tasks, and this language allows us to express various kinds of prediction tasks. This work also presents a mechanism for automatically creating the corresponding prediction model based on the given specification. Differently from previous studies, instead of focusing on a particular prediction task, we present an approach to deal with various prediction tasks based on the given specification of the desired prediction tasks. We also provide an implementation of the approach which is used to conduct experiments using real-life event logs.Comment: This article significantly extends the previous work in https://doi.org/10.1007/978-3-319-91704-7_7 which has a technical report in arXiv:1804.00617. This article and the previous work have a coauthor in commo

Classifiers With a Reject Option for Early Time-Series Classification

Early classification of time-series data in a dynamic environment is a challenging problem of great importance in signal processing. This paper proposes a classifier architecture with a reject option capable of online decision making without the need to wait for the entire time series signal to be present. The main idea is to classify an odor/gas signal with an acceptable accuracy as early as possible. Instead of using posterior probability of a classifier, the proposed method uses the "agreement" of an ensemble to decide whether to accept or reject the candidate label. The introduced algorithm is applied to the bio-chemistry problem of odor classification to build a novel Electronic-Nose called Forefront-Nose. Experimental results on wind tunnel test-bed facility confirms the robustness of the forefront-nose compared to the standard classifiers from both earliness and recognition perspectives

A model for phenotype change in a stochastic framework

some species, an inducible secondary phenotype will develop some time after the environmental change that evokes it. Nishimura (2006) [4] showed how an individual organism should optimize the time it takes to respond to an environmental change ("waiting time''). If the optimal waiting time is considered to act over the population, there are implications for the expected value of the mean fitness in that population. A stochastic predator-prey model is proposed in which the prey have a fixed initial energy budget. Fitness is the product of survival probability and the energy remaining for non-defensive purposes. The model is placed in the stochastic domain by assuming that the waiting time in the population is a normally distributed random variable because of biological variance inherent in mounting the response. It is found that the value of the mean waiting time that maximises fitness depends linearly on the variance of the waiting time