Binary classification posed as a quadratically constrained quadratic programming and solved using particle swarm optimization

Particle swarm optimization (PSO) is used in several combinatorial optimization problems. In this work, particle swarms are used to solve quadratic programming problems with quadratic constraints. The central idea is to use PSO to move in the direction towards optimal solution rather than searching...

Full description

Saved in:
Bibliographic Details
Published in:Sadhana (Bangalore) Vol. 41; no. 3; pp. 289 - 298
Main Authors: KUMAR, DEEPAK, RAMAKRISHNAN, A G
Format: Journal Article
Language:English
Published: New Delhi Springer India 01.03.2016
Subjects:
Engineering
particle swarm optimization
Quadratic programming
hyperplane
binary classification
quadratic constraints
ISSN:0256-2499, 0973-7677
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Particle swarm optimization (PSO) is used in several combinatorial optimization problems. In this work, particle swarms are used to solve quadratic programming problems with quadratic constraints. The central idea is to use PSO to move in the direction towards optimal solution rather than searching the entire feasible region. Binary classification is posed as a quadratically constrained quadratic problem and solved using the proposed method. Each class in the binary classification problem is modeled as a multidimensional ellipsoid to form a quadratic constraint in the problem. Particle swarms help in determining the optimal hyperplane or classification boundary for a data set. Our results on the Iris, Pima, Wine, Thyroid, Balance, Bupa, Haberman, and TAE datasets show that the proposed method works better than a neural network and the performance is close to that of a support vector machine.
ISSN:0256-2499
0973-7677
DOI:10.1007/s12046-016-0466-y