Multi-dimensional classification with Bayesian networks

Multi-dimensional classification aims at finding a function that assigns a vector of class values to a given vector of features. In this paper, this problem is tackled by a general family of models, called multi-dimensional Bayesian network classifiers (MBCs). This probabilistic graphical model organizes class and feature variables as three different subgraphs: class subgraph, feature subgraph, and bridge (from class to features) subgraph. Under the standard 0-1 loss function, the most probable explanation (MPE) must be computed, for which we provide theoretical results in both general MBCs and in MBCs decomposable into maximal connected components. Moreover, when computing the MPE, the vector of class values is covered by following a special ordering (gray code). Under other loss functions defined in accordance with a decomposable structure, we derive theoretical results on how to minimize the expected loss. Besides these inference issues, the paper presents flexible algorithms for learning MBC structures from data based on filter, wrapper and hybrid approaches. The cardinality of the search space is also given. New performance evaluation metrics adapted from the single-class setting are introduced. Experimental results with three benchmark data sets are encouraging, and they outperform state-of-the-art algorithms for multi-label classification.     

Hierarchical multilabel classification based on path evaluation

Multi-label classification assigns more than one label for each instance; when the labels are ordered in a predefined structure, the task is called Hierarchical Multi-label Classification (HMC). In HMC there are global and local approaches. Global approaches treat the problem as a whole but tend to explode with large datasets. Local approaches divide the problem into local subproblems, but usually do not exploit the information of the hierarchy. This paper addresses the problem of HMC for both tree and Direct Acyclic Graph (DAG) structures whose labels do not necessarily reach a leaf node. A local classifier per parent node is trained incorporating the prediction of the parent(s) node(s) as an additional attribute to include the relations between classes. In the classification phase, the branches with low probability to occur are pruned, performing non-mandatory leaf node prediction. Our method evaluates each possible path from the root of the hierarchy, taking into account the prediction value and the level of the nodes; selecting the path (or paths in the case of DAGs) with the highest score. We tested our method with 20 datasets with tree and DAG structured hierarchies against a number of state-of-the-art methods. Our method proved to obtain superior results when dealing with deep and populated hierarchies.     

Neighborhood rough sets based multi-label classification for automatic image annotation

Automatic image annotation is concerned with the task of assigning one or more semantic concepts to a given image. It is a typical multi-label classification problem. This paper presents a novel multi-label classification framework MLNRS based on neighborhood rough sets for automatic image annotation which considers the uncertainty of the mapping from visual feature space to semantic concepts space. Given a new instances, its neighbors in the training set are firstly identified. After that, based on the concept of upper and lower approximations of neighborhood rough sets, all possible labels of the given instance are found. Then, based on the statistical information gained from the label sets of the neighbors, maximum a posteriori (MAP) principle is utilized to determine the label set for the given instance. Experiments completed for three different image datasets show that MLNRS achieves more promising performance in comparison with to some well-known multi-label learning algorithms.     

Linking structural equation modeling to Bayesian networks: Decision support for customer retention in virtual communities

Bayesian networks are limited in differentiating between causal and spurious relationships among decision factors. Decision making without differentiating the two relationships cannot be effective. To overcome this limitation of Bayesian networks, this study proposes linking Bayesian networks to structural equation modeling (SEM), which has an advantage in testing causal relationships between factors. The capability of SEM in empirical validation combined with the prediction and diagnosis capabilities of Bayesian modeling facilitates effective decision making from identification of causal relationships to decision support. This study applies the proposed integrated approach to decision support for customer retention in a virtual community. The application results provide insights for practitioners on how to retain their customers. This research benefits Bayesian researchers by providing the application of modeling causal relationships at latent variable level, and helps SEM researchers in extending their models for managerial prediction and diagnosis.     

A patient adaptable ECG beat classifier based on neural networks

A novel supervised neural network-based algorithm is designed to reliably distinguish in electrocardiographic (ECG) records between normal and ischemic beats of the same patient. The basic idea behind this paper is to consider an ECG digital recording of two consecutive R-wave segments (RRR interval) as a noisy sample of an underlying function to be approximated by a fixed number of Radial Basis Functions (RBF). The linear expansion coefficients of the RRR interval represent the input signal of a feed-forward neural network which classifies a single beat as normal or ischemic. The system has been evaluated using several patient records taken from the European ST-T database. Experimental results show that the proposed beat classifier is very reliable, and that it may be a useful practical tool for the automatic detection of ischemic episodes.     

Bayesian inference for Pr (Y

《Applied Mathematical Modelling》2014,38(5-6):1698-1709

A classification model based on goal programming with non-standard preference functions with application to the prediction of cinema-going behaviour

This paper presents a goal programming model that allows for the flexible handling of the two group classification problem. The goal programming model is based around the concepts of non-standard preference functions and penalty function modelling. An extension to a generalised distance metric case is given. The inclusion of multiple levels of classification based upon different levels of certainty is incorporated into the model. The model is tested on a real-life data set pertaining to cinema-going attendance and conclusions are drawn both in the context of the methodology and of the application.