Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/8295
Title: | Fast and convergence-guaranteed algorithm for linear separation | Authors: | Liu, Z Zhang, D Li, Y |
Keywords: | Classification Complexity Convergence Efficiency Linear separation problem |
Issue Date: | 2010 | Publisher: | Science in China | Source: | Science in China. Series F, Information sciences, 2010, v. 53, no. 4, p. 729-737 How to cite? | Journal: | Science in China. Series F, Information sciences | Abstract: | Efficient linear separation algorithms are important for pattern classification applications. In this paper, an algorithm is developed to solve linear separation problems in n-dimensional space. Its convergence feature is proved. The proposed algorithm is proved to converge to a correct solution whenever the two sets are separable. The complexity of the proposed algorithm is analyzed, and experiments on both randomly generated examples and real application problems were carried out. While analysis shows that its time complexity is lower than SVM that needs computations for quadratic programming optimization, experiment results show that the developed algorithm is more efficient than the least-mean-square (LMS), and the Perceptron. | URI: | http://hdl.handle.net/10397/8295 | ISSN: | 1009-2757 | DOI: | 10.1007/s11432-010-0037-5 |
Appears in Collections: | Journal/Magazine Article |
Show full item record
SCOPUSTM
Citations
1
Last Week
0
0
Last month
0
0
Citations as of Feb 7, 2019
Page view(s)
94
Last Week
8
8
Last month
Citations as of Feb 18, 2019

Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.