二次约束二次规划粒子群分类算法及其应用
Quadratically constrained quadratic programming for classification using particle swarms and applications
摘要:
将粒子群算法应用于多个组合优化问题。在这项工作中,粒子群被用来解决二次约束的二次规划问题。粒子群方法是优化中内点方法作为迭代技术的一个例子。这种方法是新颖的,处理分类问题,而不使用传统的分类器。我们的方法确定最佳超平面或分类边界的数据集。在二进制分类问题中,我们将每个类约束为一个聚类,该聚类被椭球包围。两个簇之间的最优超平面的估计被提出作为一个二次约束的二次问题。采用改进的粒子群算法对优化问题进行分布式求解。我们的方法的优点是使用的方向朝着最优解,而不是搜索整个可行域。在Iris、Pima、Wine和Thyroid数据集上的实验结果表明,该方法优于神经网络,性能接近SVM。
英文摘要:
Particle swarm optimization is used in several combinatorial optimization problems. In this work, particle swarms are used to solve quadratic programming problems with quadratic constraints. The approach of particle swarms is an example for interior point methods in optimization as an iterative technique. This approach is novel and deals with classification problems without the use of a traditional classifier. Our method determines the optimal hyperplane or classification boundary for a data set. In a binary classification problem, we constrain each class as a cluster, which is enclosed by an ellipsoid. The estimation of the optimal hyperplane between the two clusters is posed as a quadratically constrained quadratic problem. The optimization problem is solved in distributed format using modified particle swarms. Our method has the advantage of using the direction towards optimal solution rather than searching the entire feasible region. Our results on the Iris, Pima, Wine, and Thyroid datasets show that the proposed method works better than a neural network and the performance is close to that of SVM.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。