메뉴 건너뛰기




Volumn 21, Issue 2, 2010, Pages 351-357

Scaling up support vector machines using nearest neighbor condensation

Author keywords

Classification; Large data sets; Nearest neighbor rule; Support vector machines (SVMs); Training set condensation

Indexed keywords

CLASSIFICATION RULES; FAST RESPONSE TIME; LARGE DATA SETS; LOSS OF ACCURACY; MULTI-DIMENSIONAL DATASETS; NEAREST NEIGHBOR RULE; NEAREST NEIGHBORS; ORDERS OF MAGNITUDE; SCALING-UP; SUPPORT VECTOR; SVM CLASSIFIERS; TRAINING AND TESTING; TRAINING SETS;

EID: 76749097649     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNN.2009.2039227     Document Type: Article
Times cited : (38)

References (20)
  • 1
    • 35348902771 scopus 로고    scopus 로고
    • Fast nearest neighbor condensation for large data sets classification
    • DOI 10.1109/TKDE.2007.190645
    • F. Angiulli, "Fast nearest neighbor condensation for large data sets classification," IEEE Trans. Knowl. Data Eng., vol.19, no.11, pp. 1450-1464, Nov. 2007. (Pubitemid 47573790)
    • (2007) IEEE Transactions on Knowledge and Data Engineering , vol.19 , Issue.11 , pp. 1450-1464
    • Angiulli, F.1
  • 6
    • 0015346497 scopus 로고
    • The reduced nearest neighbor rule
    • May
    • W. Gates, "The reduced nearest neighbor rule," IEEE Trans. Inf. Theory, vol.IT-18, no.3, pp. 431-433, May 1972.
    • (1972) IEEE Trans. Inf. Theory , vol.IT-18 , Issue.3 , pp. 431-433
    • Gates, W.1
  • 7
    • 84931162639 scopus 로고
    • The condensed nearest neighbor rule
    • May
    • P. E. Hart, "The condensed nearest neighbor rule," IEEE Trans. Inf. Theory, vol.IT-14, no.3, pp. 515-516, May 1968.
    • (1968) IEEE Trans. Inf. Theory , vol.IT-14 , Issue.3 , pp. 515-516
    • Hart, P.E.1
  • 9
    • 0037277806 scopus 로고    scopus 로고
    • Fast minimization of structural risk by nearest neighbor rule
    • Jan.
    • B. Karaçali and H. Krim, "Fast minimization of structural risk by nearest neighbor rule," IEEE Trans. Neural Netw., vol.14, no.1, pp. 127-134, Jan. 2002.
    • (2002) IEEE Trans. Neural Netw. , vol.14 , Issue.1 , pp. 127-134
    • Karaçali, B.1    Krim, H.2
  • 14
    • 0003120218 scopus 로고    scopus 로고
    • Sequential minimal optimization:A fast algorithm for training support vector machines
    • C. Burges, and A. Smola, Eds. Cambridge, MA: MIT Press
    • J. Platt, "Sequential minimal optimization:A fast algorithm for training support vector machines," in Advances in Kernel Methods-Support Vector Learning, B. Schölkopf, C. Burges, and A. Smola, Eds. Cambridge, MA: MIT Press, 1999.
    • (1999) Advances in Kernel Methods-Support Vector Learning, B. Schölkopf
    • Platt, J.1
  • 15
    • 0003798627 scopus 로고    scopus 로고
    • Advances in kernel methods: Support vector learning
    • C. J. C. Burges and A. J. Smola, Eds. Cambridge, MA: MIT Press
    • B. Schölkopf, "Advances in kernel methods: Support vector learning," in Advances in Neural Information Processing System, C. J. C. Burges and A. J. Smola, Eds. Cambridge, MA: MIT Press, 1999.
    • (1999) Advances in Neural Information Processing System
    • Schölkopf, B.1
  • 17
    • 25444436302 scopus 로고    scopus 로고
    • Proximity graphs for nearest neighbor decision rules: Recent progress
    • Montreal, QC, Canada
    • G. Toussaint, "Proximity graphs for nearest neighbor decision rules: Recent progress," in Proc. Symp. Comput. Statist., Montreal, QC, Canada, 2002, pp. 17-20.
    • (2002) Proc. Symp. Comput. Statist. , pp. 17-20
    • Toussaint, G.1
  • 19
    • 0343081513 scopus 로고    scopus 로고
    • Reduction techniques for instancebased learning algorithms
    • D. R. Wilson and T. R. Martinez, "Reduction techniques for instancebased learning algorithms," Mach. Learn., vol.38, no.3, pp. 257-286, 2000.
    • (2000) Mach. Learn. , vol.38 , Issue.3 , pp. 257-286
    • Wilson, D.R.1    Martinez, T.R.2
  • 20
    • 77952390455 scopus 로고    scopus 로고
    • Classifying large data sets using SVMs with hierarchical clusters
    • H. Yu, J. Yang, and J. Han, "Classifying large data sets using SVMs with hierarchical clusters," in Proc. Int. Conf. Knowl. Disc. Data Mining, 2003, pp. 306-315.
    • (2003) Proc. Int. Conf. Knowl. Disc. Data Mining , pp. 306-315
    • Yu, H.1    Yang, J.2    Han, J.3


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