A Parallel Genetic Algorithm for Solving the Inverse Problem of Support Vector Machines
Support Vector Machines (SVMs) are learning machines that can perform binary classification (pattern recognition) and real valued function approximation (regression estimation) tasks. An inverse problem of SVMs is how to split a given dataset into two clusters such that the maximum margin between the two clusters is attained. Here the margin is defined according to the separating hyper-plane generated by support vectors. This paper investigates the inverse problem of SVMs by designing a parallel genetic algorithm. Experiments show that this algorithm can greatly decrease time complexity by the use of parallel processing. This study on the inverse problem of SVMs is motivated by designing a heuristic algorithm for generating decision trees with high generalization capability.
KeywordsGenetic Algorithm Support Vector Machine Inverse Problem Computing Node Master Node
Unable to display preview. Download preview PDF.
- 7.Lin, C.-T., Lee, C.S.G.: Neural Fuzzy Systems: A Neuro-Fuzzy Synergism to Intelligent Systems, 797 p. Prentice Hall PTR, Englewood Cliffs (1996) ISBN 0-13-235169-2Google Scholar
- 8.Cantú-Paz, E.: A survey of parallel genetic algorithms. Tech. Rep., The University of Illinois, IlliGAL Report No. 97003 (1997), FTP address ftp://ftpilligal.ge.uiuc.edu/pub/papers/IlliGALs/97003.ps.Z
- 9.UCI Repository of machine learning databases and domain theories. FTP address, ftp://ftp.ics.uci.edu/pub/machine-learning-databases