| Residential College | false |
| Status | 已發表Published |
| Decomposition algorithm of LS-SVM: Combination optimization | |
| Zeng S.2; Tang Y.Y.2 | |
| 2007-09-01 | |
| Source Publication | Journal of Information and Computational Science
 |
| ISSN | 15487741 |
| Volume | 4Issue:3Pages:913-919 |
| Abstract | This paper focuses on LS-SVM combination optimization algorithm. According to the nature that the solution of LS-SVM isn't sparse, it proposes LS-SVM combination optimization algorithm and improves it, and analyzes their time and space complexity. With integer programming, optimizes number of samples in the sample subset based on LS-SVM combination optimization algorithm, and testes and verifies convergence and availability of the algorithms with the simulation. |
| Keyword | Combination optimization algorithm Decomposition algorithm LS-SVM |
| URL | View the original |
| Language | 英語English |
| Fulltext Access | |
| Document Type | Journal article |
| Collection | University of Macau |
| Affiliation | 1.Chongqing Normal University 2.Chongqing University |
| Recommended Citation GB/T 7714 | Zeng S.,Tang Y.Y.. Decomposition algorithm of LS-SVM: Combination optimization[J]. Journal of Information and Computational Science, 2007, 4(3), 913-919. |
| APA | Zeng S.., & Tang Y.Y. (2007). Decomposition algorithm of LS-SVM: Combination optimization. Journal of Information and Computational Science, 4(3), 913-919. |
| MLA | Zeng S.,et al."Decomposition algorithm of LS-SVM: Combination optimization".Journal of Information and Computational Science 4.3(2007):913-919. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment