메뉴 건너뛰기




Volumn 2, Issue , 2005, Pages 865-870

Algorithms of fast SVM evaluation based on subspace projection

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BINARY CODES; CLASSIFICATION (OF INFORMATION); DATABASE SYSTEMS; ITERATIVE METHODS; NEURAL NETWORKS; VECTORS;

EID: 33745947215     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IJCNN.2005.1555966     Document Type: Conference Paper
Times cited : (10)

References (21)
  • 4
    • 0001562735 scopus 로고    scopus 로고
    • Reducing the run-time complexity of support vector machines
    • B. Schölkopf. C. Burges, and A. Smola, Eds. MIT Press, Cambridge, MA, December
    • E. Osuna and F. Girosi, "Reducing the run-time complexity of support vector machines," in Advances in kernel methods: Support Vector Machines, B. Schölkopf. C. Burges, and A. Smola, Eds., pp. 271-283. MIT Press, Cambridge, MA, December 1999.
    • (1999) Advances in Kernel Methods: Support Vector Machines , pp. 271-283
    • Osuna, E.1    Girosi, F.2
  • 6
    • 84898957872 scopus 로고    scopus 로고
    • Improving the accuracy and speed of support vector learning machines
    • M. Mozer, M. Jordan, and T. Petsche, Eds. MIT Press, Cambridge, MA
    • C.J.C. Burges and B. Schölkopf, "Improving the accuracy and speed of support vector learning machines," in Advances in Neural Information Processing Systems. M. Mozer, M. Jordan, and T. Petsche, Eds., vol. 9, pp. 375-381. MIT Press, Cambridge, MA, 1997.
    • (1997) Advances in Neural Information Processing Systems , vol.9 , pp. 375-381
    • Burges, C.J.C.1    Schölkopf, B.2
  • 7
    • 0000263906 scopus 로고    scopus 로고
    • Fast approximation of support vector kernel expansions, and an interpretation of clustering as approximation in feature spaces
    • Springer, Berlin
    • B. Schölkopf, P. Knirsch, A.J. Smola. and C. Burges, "Fast approximation of support vector kernel expansions, and an interpretation of clustering as approximation in feature spaces," in Mustererkennung, DAGM-Symposium, pp. 124-132, Springer, Berlin. 1998.
    • (1998) Mustererkennung, DAGM-Symposium , pp. 124-132
    • Schölkopf, B.1    Knirsch, P.2    Smola, A.J.3    Burges, C.4
  • 9
    • 0001500115 scopus 로고
    • Functions of positive and negative type and their connection with the theory of integral equations
    • J. Mercer, "Functions of positive and negative type and their connection with the theory of integral equations," Philos. Trans. Roy. Soc. London, vol. A(209), pp. 415-446, 1909.
    • (1909) Philos. Trans. Roy. Soc. London , vol.A , Issue.209 , pp. 415-446
    • Mercer, J.1
  • 12
    • 0004236492 scopus 로고    scopus 로고
    • The Johns Hopkins University Press, Baltimore, Maryland, 3nd edition
    • G.H. Golub and C.F.Van Loan, Matrix computations. The Johns Hopkins University Press, Baltimore, Maryland, 3nd edition, 1996.
    • (1996) Matrix Computations
    • Golub, G.H.1    Loan, C.F.V.2
  • 15
    • 33745965577 scopus 로고    scopus 로고
    • Fast svm testing algorithms
    • CENPARMI, Concordia University, Montreal. Canada. July
    • J.X. Dong, C.Y. Suen. and A. Krzyżak, "Fast svm testing algorithms," Tech. Rep., CENPARMI, Concordia University, Montreal. Canada. July 2003.
    • (2003) Tech. Rep.
    • Dong, J.X.1    Suen, C.Y.2    Krzyzak, A.3
  • 19
    • 17144374074 scopus 로고    scopus 로고
    • Fast svm training algorithm with decomposition on very large datasets
    • April
    • J. X. Dong, A. Krzyżak, and C. Y. Suen, "Fast svm training algorithm with decomposition on very large datasets," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 27, no. 4, pp. 603-618, April 2005.
    • (2005) IEEE Trans. Pattern Analysis and Machine Intelligence , vol.27 , Issue.4 , pp. 603-618
    • Dong, J.X.1    Krzyzak, A.2    Suen, C.Y.3


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