The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
The cross entropy method for classification
Abstract
We consider support vector machines for binary classification. As opposed to most approaches we use the number of support vectors (the "L0 norm") as a regularizing term instead of the L1 or L2 norms. In order to solve the optimization problem we use the cross entropy method to search over the possible sets of support vectors. The algorithm consists of solving a sequence of efficient linear programs. We report experiments where our method produces generalization errors that are similar to support vector machines, while using a considerably smaller number of support vectors.
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
An Introduction to Support Vector Machines and Other Kernel-based Learning Methods
Cristianini, N., & Shawe-Taylor, J. (2000) · doi:10.1017/cbo9780511801389 · Cited by 13,855
Fast Training of Support Vector Machines Using Sequential Minimal Optimization
Platt, J. C. (1998) · Advances in Kernel Methods · doi:10.7551/mitpress/1130.003.0016 · Cited by 5,437
A Tutorial on the Cross-Entropy Method
de Boer, P.-T., Kroese, D. P., Mannor, S., & Rubinstein, R. Y. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-5724-z · Cited by 3,024
Self-citationAdvances in Large-Margin Classifiers
(2000) · The MIT Press eBooks · doi:10.7551/mitpress/1113.001.0001 · Cited by 1,869
*13 Simulated Annealing and Boltzmann Machines
(1993) · Neural Network Learning and Expert Systems · doi:10.7551/mitpress/4931.003.0017 · Cited by 1,637
(1990) · Discrete Applied Mathematics · doi:10.1016/0166-218x(90)90039-f · Cited by 1,440
Improvements to Platt's SMO Algorithm for SVM Classifier Design
Keerthi, S. S., Shevade, S. K., Bhattacharyya, C., & Murthy, K. R. K. (2001) · Neural Computation · doi:10.1162/089976601300014493 · Cited by 1,318
Rubinstein, R. Y., & Kroese, D. P. (2004) · Springer eBooks · Cited by 1,156
Self-citationRubinstein, R. Y., & Kroese, D. P. (2004) · Medical Entomology and Zoology · Cited by 1,074
Self-citation
Cited by
Binary cross entropy with deep learning technique for Image classification
Dr.A, U. R. (2020) · International Journal of Advanced Trends in Computer Science and Engineering · doi:10.30534/ijatcse/2020/175942020 · Cited by 623
Brain tumor classification in MRI image using convolutional neural network
Ali Khan, H., 1 School of Computer Science and Technology, S. U. O. S. A. T., Jue, W., Mushtaq, M., Umer Mushtaq, M., 2 Insitute for Neuro and Bioinformatics, U. O. L., 3 School of Information Engineering, S. U. O. S. A. T., & 4 Department of Software Engineering, M. (2020) · Mathematical Biosciences and Engineering · doi:10.3934/mbe.2020328 · Cited by 383
Blind Hyperspectral Unmixing Using Autoencoders: A Critical Comparison
Palsson, B., Sveinsson, J. R., & Ulfarsson, M. O. (2022) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2021.3140154 · Cited by 107
Metadata
- Authors
- Mannor, S., Peleg, D., & Rubinstein, R.
- Venue
- Proceedings of the 22nd international conference on Machine learning - ICML '05
- Publisher
- ACM Press
- Published
- 2005
- Pages
- 561-568
- OpenAlex
- W2116873850
- Cited by
- 312
- References
- 20
- FWCI
- 0.48
- Type
- conference paper
- 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: The cross entropy method for classification. https://app.cochat.ai/papers/10.1145/1102351.1102422
- The paper
- Mannor, S., Peleg, D., & Rubinstein, R. (2005). The cross entropy method for classification. Proceedings of the 22nd international conference on Machine learning - ICML '05. https://doi.org/10.1145/1102351.1102422
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.