메뉴 건너뛰기




Volumn 24, Issue 8, 2013, Pages 1304-1315

Feasibility and finite convergence analysis for accurate on-line ν-support vector machine

Author keywords

Active set method; feasibility analysis; finite convergence analysis; incremental support vector classification; online learning

Indexed keywords

ACTIVE SET METHODS; FEASIBILITY ANALYSIS; FINITE CONVERGENCE; ONLINE LEARNING; SUPPORT VECTOR CLASSIFICATION;

EID: 84880921984     PISSN: 2162237X     EISSN: 21622388     Source Type: Journal    
DOI: 10.1109/TNNLS.2013.2250300     Document Type: Article
Times cited : (54)

References (32)
  • 6
    • 80052866161 scopus 로고    scopus 로고
    • Incremental and decremental support vector machine learning
    • Cambridge, MA, USA: MIT Press
    • G. Cauwenberghs and T. Poggio, "Incremental and decremental support vector machine learning," in Advances in Neural Information Processing Systems. Cambridge, MA, USA: MIT Press, 2001, pp. 409-415.
    • (2001) Advances in Neural Information Processing Systems , pp. 409-415
    • Cauwenberghs, G.1    Poggio, T.2
  • 8
    • 0000667930 scopus 로고    scopus 로고
    • Training ν-support vector classifiers: Theory and algorithms
    • DOI 10.1162/089976601750399335
    • C.-C. Chang and C.-J. Lin, "Training ?-support vector classifiers: Theory and algorithms," Neural Comput., vol. 13, no. 9, pp. 2119-2147, Sep. 2001. (Pubitemid 33595045)
    • (2001) Neural Computation , vol.13 , Issue.9 , pp. 2119-2147
    • Chang, C.-C.1    Lin, C.-J.2
  • 10
    • 0141480928 scopus 로고    scopus 로고
    • Svm incremental learning, adaptation and optimization
    • Jul
    • C. P. Diehl and G. Cauwenberghs, "Svm incremental learning, adaptation and optimization," in Proc. Int. Joint Conf. Neural Netw., vol. 4. Jul. 2003, pp. 2685-2690.
    • (2003) Proc. Int. Joint Conf. Neural Netw. , vol.4 , pp. 2685-2690
    • Diehl, C.P.1    Cauwenberghs, G.2
  • 11
    • 0000897328 scopus 로고    scopus 로고
    • The kernel-adatron algorithm: A fast and simple learning procedure for support vector machines
    • T.-T. Frieb, N. Cristianini, and C. Campbell, "The kernel-adatron algorithm: A fast and simple learning procedure for support vector machines," in Proc. 15th Int. Conf. Mach. Learn., 1998, pp. 188-196.
    • (1998) Proc. 15th Int. Conf. Mach. Learn. , pp. 188-196
    • Frieb, T.-T.1    Cristianini, N.2    Campbell, C.3
  • 13
    • 0141565173 scopus 로고    scopus 로고
    • On-line one-class support vector machines. An application to signal segmentation
    • Apr
    • A. Gretton and F. Desobry, "On-line one-class support vector machines. An application to signal segmentation," in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process., vol. 2. Apr. 2003, pp. 709-712.
    • (2003) Proc. IEEE Int. Conf. Acoust., Speech, Signal Process. , vol.2 , pp. 709-712
    • Gretton, A.1    Desobry, F.2
  • 14
    • 56349156232 scopus 로고    scopus 로고
    • On-line off-line ranking support vector machine and analysis
    • B. Gu, J. D. Wang, and H. Y. Chen, "On-line off-line ranking support vector machine and analysis," in Proc. Int. Joint Conf. Neural Netw., 2008, pp. 1365-1370.
    • (2008) Proc. Int. Joint Conf. Neural Netw. , pp. 1365-1370
    • Gu, B.1    Wang, J.D.2    Chen, H.Y.3
  • 15
    • 33745777639 scopus 로고    scopus 로고
    • Incremental support vector learning: Analysis, implementation and applications
    • P. Laskov, C. Gehl, S. Krüger, K.-R. Müller, K. Bennett, and E. Parrado-Hern, "Incremental support vector learning: Analysis, implementation and applications," J. Mach. Learn. Res., vol. 7, no. 12, pp. 1909-1936, Dec. 2006. (Pubitemid 44477117)
    • (2006) Journal of Machine Learning Research , vol.7 , pp. 1909-1936
    • Laskov, P.1    Gehl, C.2    Kruger, S.3    Muller, K.-R.4
  • 16
    • 0032594961 scopus 로고    scopus 로고
    • Successive overrelaxation for support vector machines
    • Sep.
    • O. L. Mangasarian and D. R. Musicant, "Successive overrelaxation for support vector machines," IEEE Trans. Neural Netw., vol. 10, no. 5, pp. 1032-1037, Sep. 1998.
    • (1998) IEEE Trans. Neural Netw. , vol.10 , Issue.5 , pp. 1032-1037
    • Mangasarian, O.L.1    Musicant, D.R.2
  • 17
    • 84945261592 scopus 로고    scopus 로고
    • On-line support vector machine regression
    • M. Martin, "On-line support vector machine regression," in Proc. 13th Eur. Conf. Mach. Learn., 2002, pp. 282-294.
    • (2002) Proc. 13th Eur. Conf. Mach. Learn. , pp. 282-294
    • Martin, M.1
  • 20
    • 77954563782 scopus 로고    scopus 로고
    • Multiple incremental decremental learning of support vector machines
    • Jul.
    • M. Karasuyama and I. Takeuchi, "Multiple incremental decremental learning of support vector machines," IEEE Trans. Neural Netw., vol. 21, no. 7, pp. 1048-1059, Jul. 2010.
    • (2010) IEEE Trans. Neural Netw. , vol.21 , Issue.7 , pp. 1048-1059
    • Karasuyama, M.1    Takeuchi, I.2
  • 21
    • 0035506741 scopus 로고    scopus 로고
    • On the convergence of the decomposition method for support vector machines
    • DOI 10.1109/72.963765, PII S1045922701064566
    • C.-J. Lin, "On the convergence of the decomposition method for support vector machines," IEEE Trans. Neural Netw., vol. 12, no. 6, pp. 1288-1298, Jun. 2001. (Pubitemid 33106034)
    • (2001) IEEE Transactions on Neural Networks , vol.12 , Issue.6 , pp. 1288-1298
    • Lin, C.-J.1
  • 22
    • 84925605946 scopus 로고    scopus 로고
    • The entire regularization path for the support vector machine
    • Oct.
    • T. Hastie, S. Rosset, R. Tibshirani, J. Zhu, and N. Cristianini, "The entire regularization path for the support vector machine," J.Mach. Learn. Res., vol. 5, no. 10, pp. 1391-1415, Oct. 2004.
    • (2004) J.Mach. Learn. Res. , vol.5 , Issue.10 , pp. 1391-1415
    • Hastie, T.1    Rosset, S.2    Tibshirani, R.3    Zhu, J.4    Cristianini, N.5
  • 23
    • 84971957489 scopus 로고
    • Continuation and path following
    • Jan.
    • E. Allgower, and K. Georg, "Continuation and path following," Acta Numer., vol. 2, pp. 1-64, Jan. 1992.
    • (1992) Acta Numer. , vol.2 , pp. 1-64
    • Allgower, E.1    Georg, K.2
  • 26
    • 0011323861 scopus 로고    scopus 로고
    • An algorithm for the solution of the parametric quadratic programming problem
    • H. Fischer, B. Riedemller, and S. Schffler, Eds. New York, USA: Springer-Verlag
    • M. J. Best, "An algorithm for the solution of the parametric quadratic programming problem," in Applied Mathematics and Parallel Computing: Festschrift for Klaus Ritter, H. Fischer, B. Riedemller, and S. Schffler, Eds. New York, USA: Springer-Verlag, 1996, pp. 57-76.
    • (1996) Applied Mathematics and Parallel Cxomputing: Festschrift for Klaus Ritter , pp. 57-76
    • Best, M.J.1
  • 28
    • 0021501063 scopus 로고
    • Equivalence of some quadratic programming algorithms
    • Sep.
    • M. J. Best, "Equivalence of some quadratic programming algorithms," Math. Program., vol. 30, no. 1, pp. 71-87, Sep. 1984.
    • (1984) Math. Program. , vol.30 , Issue.1 , pp. 71-87
    • Best, M.J.1
  • 29
    • 84870467261 scopus 로고    scopus 로고
    • Ph.D. dissertation, Dept. Math., Univ. California, San Diego, CA, USA
    • E. Wong, "Active-set methods for quadratic programming," Ph.D. dissertation, Dept. Math., Univ. California, San Diego, CA, USA, 2011.
    • (2011) Active-set Methods for Quadratic Programming
    • Wong, E.1
  • 30
    • 84875884987 scopus 로고    scopus 로고
    • Simple proof of convergence of the SMO algorithm for different SVM variants
    • Jul.
    • J. Lopez and J. R. Dorronsoro, "Simple proof of convergence of the SMO algorithm for different SVM variants," IEEE Trans. Neural Netw. Learn. Syst., vol. 23, no. 7, pp. 1142-1147, Jul. 2012.
    • (2012) IEEE Trans. Neural Netw. Learn. Syst. , vol.23 , Issue.7 , pp. 1142-1147
    • Lopez, J.1    Dorronsoro, J.R.2
  • 31
    • 84880916385 scopus 로고    scopus 로고
    • An exponential lower bound on the complexity of regularization paths
    • B. Gärtner, J. Giesen, and M. Jaggi, "An exponential lower bound on the complexity of regularization paths," JoCG, vol. 3, no. 1, pp. 168-195, 2012.
    • (2012) JoCG , vol.3 , Issue.1 , pp. 168-195
    • Gärtner, B.1    Giesen, J.2    Jaggi, M.3
  • 32
    • 84871870466 scopus 로고    scopus 로고
    • Reducing the number of support vectors of svm classifiers using the smoothed separable case approximation
    • Apr.
    • D. Geebelen, J. A. K. Suykens, and J. Vandewalle, "Reducing the number of support vectors of svm classifiers using the smoothed separable case approximation," IEEE Trans. Neural Netw. Learn. Syst., vol. 23, no. 4, pp. 682-688, Apr. 2012.
    • (2012) IEEE Trans. Neural Netw. Learn. Syst. , vol.23 , Issue.4 , pp. 682-688
    • Geebelen, D.1    Suykens, J.A.K.2    Vandewalle, J.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.