Scholarlink

<p>In the dual optimization problem behind Support Vector Machine (SVM), each data point corresponds to a decision variable. Therefore, removing data points is equivalent to reducing the dimensionality of the dual problem, leading to a more efficient optimization process. We introduce linear programming models to determine whether two sets of points are linearly separable efficiently, compute the misclassification rate, and reduce the dimension of the optimization problems behind the SVM procedure. Data reduction can be conducted using a simple convexity property for the linearly separable case. The misclassification rate is a key indicator of the complexity of separating the two sets, providing valuable insights into the classification performance. Our approach combines SVM optimization with linear programming techniques to offer a comprehensive classification and complexity analysis framework.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Improving SVM performance through data reduction and misclassification analysis with linear programming

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年6月21日

查看全文
  • Carlos Aníbal Suárez,
  • Mauricio Castro,
  • Mariuxi Leon,
  • Carlos Martin-Barreiro,
  • Michael Liut

摘要

In the dual optimization problem behind Support Vector Machine (SVM), each data point corresponds to a decision variable. Therefore, removing data points is equivalent to reducing the dimensionality of the dual problem, leading to a more efficient optimization process. We introduce linear programming models to determine whether two sets of points are linearly separable efficiently, compute the misclassification rate, and reduce the dimension of the optimization problems behind the SVM procedure. Data reduction can be conducted using a simple convexity property for the linearly separable case. The misclassification rate is a key indicator of the complexity of separating the two sets, providing valuable insights into the classification performance. Our approach combines SVM optimization with linear programming techniques to offer a comprehensive classification and complexity analysis framework.