The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Structural Minimax Probability Machine
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,387
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743
Hierarchical Grouping to Optimize an Objective Function
Ward, J. H. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500845 · Cited by 20,598
Neural Networks for Pattern Recognition
Bishop, C. M. (1995) · doi:10.1093/oso/9780198538493.001.0001 · Cited by 12,287
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
A comparison of methods for multiclass support vector machines
Hsu, C.-W., & Lin, C.-J. (2002) · IEEE Transactions on Neural Networks · doi:10.1109/72.991427 · Cited by 6,838
An empirical study of the naive Bayes classifier
Rish, I. (2001) · Cited by 3,202
Online and off-line handwriting recognition: a comprehensive survey
Plamondon, R., & Srihari, S. N. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.824821 · Cited by 2,498
Cited by
A novel intelligent diagnosis method using optimal LS-SVM with improved PSO algorithm
Deng, W., Yao, R., Zhao, H., Yang, X., & Li, G. (2019) · Soft Computing · doi:10.1007/s00500-017-2940-9 · Cited by 490
Study on an improved adaptive PSO algorithm for solving multi-objective gate assignment
Deng, W., Zhao, H., Yang, X., Xiong, J., Sun, M., & Li, B. (2017) · Applied Soft Computing · doi:10.1016/j.asoc.2017.06.004 · Cited by 364
Privacy-preserving outsourced classification in cloud computing
Li, P., Li, J., Huang, Z., Gao, C.-Z., Chen, W.-B., & Chen, K. (2018) · Cluster Computing · doi:10.1007/s10586-017-0849-9 · Cited by 309
Deng, W., Zhang, S., Zhao, H., & Yang, X. (2018) · IEEE Access · doi:10.1109/access.2018.2834540 · Cited by 282
Text classification based on deep belief network and softmax regression
Jiang, M., Liang, Y., Feng, X., Fan, X., Pei, Z., Xue, Y., & Guan, R. (2018) · Neural Computing and Applications · doi:10.1007/s00521-016-2401-x · Cited by 268
Metadata
- Authors
- Gu, B., Sun, X., & Sheng, V. S.
- Venue
- IEEE Transactions on Neural Networks and Learning Systems
- Published
- 2017-07
- Volume
- 28
- Issue
- 7
- Pages
- 1646-1656
- ISSN
- 2162-237X (ISSN-L)
- 2162-2388
- OpenAlex
- W2336484677
- Cited by
- 338
- References
- 22
- FWCI
- 83.54
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Structural Minimax Probability Machine. https://app.cochat.ai/papers/10.1109/tnnls.2016.2544779
- The paper
- Gu, B., Sun, X., & Sheng, V. S. (2017). Structural Minimax Probability Machine. IEEE Transactions on Neural Networks and Learning Systems. https://doi.org/10.1109/tnnls.2016.2544779
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.