The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Linear and Nonlinear Separation of Patterns by Linear Programming
Abstract
A pattern separation problem is basically a problem of obtaining a criterion for distinguishing between the elements of two disjoint sets of patterns. The patterns are usually represented by points in a Euclidean space. One way to achieve separation is to construct a plane or a nonlinear surface such that one set of patterns lies on one side of the plane or the surface, and the other set of patterns on the other side. Recently, it has been shown that linear and ellipsoidal separation may be achieved by nonlinear programming. In this work it is shown that both linear and nonlinear separation may be achieved by linear programming.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Linear and Nonlinear Methods in Pattern Classification
Greenberg, H. J., & Konheim, A. G. (1964) · IBM Journal of Research and Development · doi:10.1147/rd.83.0299 · Cited by 31
Cited by
A tutorial on support vector regression
Smola, A. J., & Schölkopf, B. (2004) · Statistics and Computing · doi:10.1023/b:stco.0000035301.49549.88 · Cited by 13,387
Advances in Large-Margin Classifiers
(2000) · The MIT Press eBooks · doi:10.7551/mitpress/1113.001.0001 · Cited by 1,869
Kernel methods in machine learning
Hofmann, T., Schölkopf, B., & Smola, A. J. (2008) · The Annals of Statistics · doi:10.1214/009053607000000677 · Cited by 1,651
Rätsch, G., Onoda, T., & Müller, K.-R. (2001) · Machine Learning · doi:10.1023/a:1007618119488 · Cited by 1,299
Elmaghraby, W., & Keskinocak, P. (2003) · Management Science · doi:10.1287/mnsc.49.10.1287.17315 · Cited by 1,285
Robust linear programming discrimination of two linearly inseparable sets
Bennett, K. P., & Mangasarian, O. L. (1992) · Optimization Methods and Software · doi:10.1080/10556789208805504 · Cited by 780
Self-citationA survey of credit and behavioural scoring: forecasting financial risk of lending to consumers
Thomas, L. C. (2000) · International Journal of Forecasting · doi:10.1016/s0169-2070(00)00034-0 · Cited by 741
Karatzoglou, A., Amatriain, X., Baltrunas, L., & Oliver, N. (2010) · Proceedings of the fourth ACM conference on Recommender systems · doi:10.1145/1864708.1864727 · Cited by 721
Support Vector Machines for Classification
Awad, M., & Khanna, R. (2015) · Efficient Learning Machines · doi:10.1007/978-1-4302-5990-9_3 · Cited by 543
An Introduction to Boosting and Leveraging
Meir, R., & Rätsch, G. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36434-x_4 · Cited by 447
Support Vector Machines – An Introduction
Kecman, V. (2005) · Studies in Fuzziness and Soft Computing · doi:10.1007/10984697_1 · Cited by 425
Linear Programming Boosting via Column Generation
Demiriz, A., Bennett, K. P., & Shawe-Taylor, J. (2002) · Machine Learning · doi:10.1023/a:1012470815092 · Cited by 413
A new fuzzy support vector machine to evaluate credit risk
Wang, Y., Wang, S., & Lai, K. K. (2005) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2005.859320 · Cited by 383
Vert, J.-P., Tsuda, K., & Schölkopf, B. (2004) · Kernel Methods in Computational Biology · doi:10.7551/mitpress/4057.003.0004 · Cited by 365
Multicategory Classification by Support Vector Machines
Bredensteiner, E. J., & Bennett, K. P. (1999) · Computational Optimization and Applications · doi:10.1023/a:1008663629662 · Cited by 337
Credit risk assessment with a multistage neural network ensemble learning approach
YU, L., WANG, S., & LAI, K. (2008) · Expert Systems with Applications · doi:10.1016/j.eswa.2007.01.009 · Cited by 310
Forecasting and operational research: a review
Fildes, R., Nikolopoulos, K., Crone, S. F., & Syntetos, A. A. (2008) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2602597 · Cited by 287
“Using an extended data set from Meade and Islam (1998), they show that their new method generally produces more accurate forecasts.”
BackgroundMethodResultInfluentialKernel methods: a survey of current techniques
Campbell, C. (2002) · Neurocomputing · doi:10.1016/s0925-2312(01)00643-9 · Cited by 268
Support Vector Machines with the Ramp Loss and the Hard Margin Loss
Brooks, J. P. (2011) · Operations Research · doi:10.1287/opre.1100.0854 · Cited by 145
Road vehicle classification using Support Vector Machines
Chen, Z., Pears, N., Freeman, M., & Austin, J. (2009) · 2009 IEEE International Conference on Intelligent Computing and Intelligent Systems · doi:10.1109/icicisys.2009.5357707 · Cited by 74
Metadata
- Authors
- Mangasarian, O. L.
- Venue
- Operations Research
- Published
- 1965-06
- Volume
- 13
- Issue
- 3
- Pages
- 444-452
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2060591526
- Cited by
- 328
- References
- 1
- FWCI
- 1.79
- 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
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.