ShopSpell

Improved Classification Rates for Localized Algorithms under Margin Conditions [Paperback]

$40.99     $54.99   25% Off      (Free Shipping)
100 available
  • Category: Books (Mathematics)
  • Author:  Blaschzyk, Ingrid Karin
  • Author:  Blaschzyk, Ingrid Karin
  • ISBN-10:  3658295902
  • ISBN-10:  3658295902
  • ISBN-13:  9783658295905
  • ISBN-13:  9783658295905
  • Publisher:  Springer Spektrum
  • Publisher:  Springer Spektrum
  • Binding:  Paperback
  • Binding:  Paperback
  • Pub Date:  01-Apr-2020
  • Pub Date:  01-Apr-2020
  • SKU:  3658295902-11-SPRI
  • SKU:  3658295902-11-SPRI
  • Pages:  126
  • Pages:  126
  • Item ID: 104267340
  • List Price: $54.99
  • Seller: ShopSpell
  • Ships in: 5 business days
  • Transit time: Up to 5 business days
  • Delivery by: Oct 12 to Oct 14
  • Notes: Brand New Item. Not shipped to AK, HI, APO, FPO, AE.
Support vector machines (SVMs) are one of the most successful algorithms on small and medium-sized data sets, but on large-scale data sets their training and predictions become computationally infeasible. The author considers a spatially defined data chunking method for large-scale learning problems, leading to so-called localized SVMs, and implements an in-depth mathematical analysis with theoretical guarantees, which in particular include classification rates. The statistical analysis relies on a new and simple partitioning based technique and takes well-known margin conditions into account that describe the behavior of the data-generating distribution. It turns out that the rates outperform known rates of several other learning algorithms under suitable sets of assumptions. From a practical point of view, the author shows that a common training and validation procedure achieves the theoretical rates adaptively, that is, without knowing the margin parameters in advance.Introduction to Statistical Learning Theory.- Histogram Rule: Oracle Inequality and Learning Rates.- Localized SVMs: Oracle Inequalities and Learning Rates.Ingrid Karin Blaschzyk is a postdoctoral researcher in the Department of Mathematics at the University of Stuttgart, Germany. Support vector machines (SVMs) are one of the most successful algorithms on small and medium-sized data sets, but on large-scale data sets their training and predictions become computationally infeasible. The author considers a spatially defined data chunking method for large-scale learning problems, leading to so-called localized SVMs, and implements an in-depth mathematical analysis with theoretical guarantees, which in particular include classification rates. The statistical analysis relies on a new and simple partitioning based technique and takes well-known margin conditions into account that describe the behavior of the data-generating distribution. It turns out that the rates outperform known rates of severl³8
Add Review