Name
Abstract | ||
|---|---|---|
The two-case pattern recognition problem aims to find the best way of linearly separate two different classes of data points with a good generalization performance.In the context of learning machines proposed to solve the pattern recognition problem, the analytic center machine (ACM) uses the analytic center cutting plane method restricted to spherical shells.In this work we prove existence and uniqueness of the analytic center of a spherical surface, which guarantees the well definedness of ACM problem. We also propose and analyze new primal, dual and primal-dual formulations based on interior point methods for the analytic center machine. Further, we provide a complexity bound on the number of iterations for the primal approach. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/s10589-007-9142-9 | Comp. Opt. and Appl. |
Keywords | Field | DocType |
Pattern recognition problem,Learning machines,Interior point methods,Analytic center | Data point,Uniqueness,Mathematical optimization,Cutting-plane method,Pattern recognition problem,Interior point method,Mathematics,Global analytic function | Journal |
Volume | Issue | ISSN |
43 | 3 | 0926-6003 |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fernanda M. P. Raupp | 1 | 29 | 5.35 |
| B. F. Svaiter | 2 | 608 | 72.74 |