Structural Minimax Probability Machine
Reads0
Chats0
TLDR
This paper uses two finite mixture models to capture the structural information of the data from binary classification and proposes a structural MPM, which can be interpreted as a large margin classifier and can be transformed to support vector machine and maxi–min margin machine under certain special conditions.Abstract:
Minimax probability machine (MPM) is an interesting discriminative classifier based on generative prior knowledge. It can directly estimate the probabilistic accuracy bound by minimizing the maximum probability of misclassification. The structural information of data is an effective way to represent prior knowledge, and has been found to be vital for designing classifiers in real-world problems. However, MPM only considers the prior probability distribution of each class with a given mean and covariance matrix, which does not efficiently exploit the structural information of data. In this paper, we use two finite mixture models to capture the structural information of the data from binary classification. For each subdistribution in a finite mixture model, only its mean and covariance matrix are assumed to be known. Based on the finite mixture models, we propose a structural MPM (SMPM). SMPM can be solved effectively by a sequence of the second-order cone programming problems. Moreover, we extend a linear model of SMPM to a nonlinear model by exploiting kernelization techniques. We also show that the SMPM can be interpreted as a large margin classifier and can be transformed to support vector machine and maxi–min margin machine under certain special conditions. Experimental results on both synthetic and real-world data sets demonstrate the effectiveness of SMPM.read more
Citations
More filters
Journal ArticleDOI
Temperature dependent optimal power flow using chaotic whale optimization algorithm
Journal ArticleDOI
A bi-objective fleet size and mix green inventory routing problem, model and solution method
Mehdi Alinaghian,Mohsen Zamani +1 more
TL;DR: A bi-objective meta-heuristic algorithm based on the quantum evolutionary algorithm for green inventory routing problem with the heterogeneous fleet to reduce the emissions and minimize the fleet size, vehicle type, routing, and inventory costs is proposed.
Journal ArticleDOI
A Rough Set Bounded Spatially Constrained Asymmetric Gaussian Mixture Model for Image Segmentation.
TL;DR: The proposed rough set bounded asymmetric Gaussian mixture model with spatial constraint for image segmentation is compared to state-of-the-art segmentation approaches in both synthetic and real images to demonstrate the superior performance.
Journal ArticleDOI
Exploit latent Dirichlet allocation for collaborative filtering
TL;DR: This paper proposes to apply the latent Dirichlet allocation (LDA) model on OCCF with a matrix factorization-based method to tackle the multi-class collaborative filtering (MCCF) problem, and indicates that the proposed method outperforms previous methods on various ranking-oriented evaluation metrics.
Journal ArticleDOI
Fusion of progressive granular neural networks for pattern classification
TL;DR: The proposed model thus takes the advantages of CS granulation, structural adaptability, nonlinear updation of weights and collective opinions from the group of PGNNs, and its superiority to similar other methods has been justified.
References
More filters
Journal ArticleDOI
A tutorial on hidden Markov models and selected applications in speech recognition
TL;DR: In this paper, the authors provide an overview of the basic theory of hidden Markov models (HMMs) as originated by L.E. Baum and T. Petrie (1966) and give practical details on methods of implementation of the theory along with a description of selected applications of HMMs to distinct problems in speech recognition.
Journal ArticleDOI
Hierarchical Grouping to Optimize an Objective Function
TL;DR: In this paper, a procedure for forming hierarchical groups of mutually exclusive subsets, each of which has members that are maximally similar with respect to specified characteristics, is suggested for use in large-scale (n > 100) studies when a precise optimal solution for a specified number of groups is not practical.
Book ChapterDOI
Neural Networks for Pattern Recognition
Suresh Kothari,Heekuck Oh +1 more
TL;DR: The chapter discusses two important directions of research to improve learning algorithms: the dynamic node generation, which is used by the cascade correlation algorithm; and designing learning algorithms where the choice of parameters is not an issue.
Journal ArticleDOI
Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones
TL;DR: This paper describes how to work with SeDuMi, an add-on for MATLAB, which lets you solve optimization problems with linear, quadratic and semidefiniteness constraints by exploiting sparsity.
Journal ArticleDOI
A comparison of methods for multiclass support vector machines
Hsu Chih-Wei,Chih-Jen Lin +1 more
TL;DR: Decomposition implementations for two "all-together" multiclass SVM methods are given and it is shown that for large problems methods by considering all data at once in general need fewer support vectors.
Related Papers (5)
A Robust Regularization Path Algorithm for $\nu $ -Support Vector Classification
Bin Gu,Victor S. Sheng +1 more