메뉴 건너뛰기




Volumn 13, Issue 2, 2001, Pages 159-181

Learning with nearest neighbour classifiers

Author keywords

Hand written character recognition; Learning vector quantization; Nearest neighbour classifiers; Online gradient descent

Indexed keywords

CHARACTER RECOGNITION; ONLINE SYSTEMS; SOFTWARE PROTOTYPING;

EID: 0035306504     PISSN: 13704621     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011332406386     Document Type: Article
Times cited : (7)

References (25)
  • 3
    • 0035306637 scopus 로고    scopus 로고
    • Finite-Sample Convergence Properties of the LVQ1 algorithm and the BLVQ1 algorithm
    • this issue
    • Bermejo, S. and Cabestany, J.: Finite-Sample Convergence Properties of the LVQ1 algorithm and the BLVQ1 algorithm, Neural Processing Letters 13, 135-157 (this issue).
    • Neural Processing Letters , vol.13 , pp. 135-157
    • Bermejo, S.1    Cabestany, J.2
  • 5
    • 0013309537 scopus 로고    scopus 로고
    • Online Learning and Stochastic Approximations
    • David Saal (ed.), Cambridge University Press, Cambridge
    • Bottou, L.: Online Learning and Stochastic Approximations, In David Saal (ed.), Online Learning and Neural Networks, Cambridge University Press, Cambridge (1998).
    • (1998) Online Learning and Neural Networks
    • Bottou, L.1
  • 6
    • 0003479038 scopus 로고    scopus 로고
    • Department of Statistics, University of California, Technical Report No. 534
    • Breiman, L.: Half-&-Half Bagging and Hard Boundary Points, Department of Statistics, University of California, Technical Report No. 534 (1998).
    • (1998) Half-&-Half Bagging and Hard Boundary Points
    • Breiman, L.1
  • 8
    • 0002629270 scopus 로고
    • Maximum Likelihood from incomplete data via the EM algorithm
    • Dempster, A. P., Laird, N. M., and Rubin, D. B.: Maximum Likelihood from incomplete data via the EM algorithm, J. Roy. Stat. Soc. B 39, (1977), 1-38.
    • (1977) J. Roy. Stat. Soc. B , vol.39 , pp. 1-38
    • Dempster, A.P.1    Laird, N.M.2    Rubin, D.B.3
  • 11
    • 0004067283 scopus 로고
    • Department of Statistics and Stanford Linear Accelerator Center, Stanford University, Stanford CA, Technical Report
    • Friedman, J.: Flexible Metric Nearest Neighbor Classification, Department of Statistics and Stanford Linear Accelerator Center, Stanford University, Stanford CA, Technical Report (1994).
    • (1994) Flexible Metric Nearest Neighbor Classification
    • Friedman, J.1
  • 13
    • 84931162639 scopus 로고
    • The Condensed Nearest Neighbor Rule
    • Hart, P. E.: The Condensed Nearest Neighbor Rule, IEEE Trans. Inf. Th. (Corresp.), IT-14 (1968), 515-516.
    • (1968) IEEE Trans. Inf. Th. (Corresp.) , vol.IT-14 , pp. 515-516
    • Hart, P.E.1
  • 17
    • 0342356992 scopus 로고
    • How Receptive Field Parameters Affect Neural Learning
    • R. P. Lippmann, J. E. Moody, and D. S. Touretzky (eds.), Morgan Kaufmann Publishers, Boston, MA
    • Mel, B. W. and Omohundro, S. M.: How Receptive Field Parameters Affect Neural Learning, R. P. Lippmann, J. E. Moody, and D. S. Touretzky (eds.), Advances in Neural Information Processing Systems 3, Morgan Kaufmann Publishers, Boston, MA (1991).
    • (1991) Advances in Neural Information Processing Systems 3 , vol.3
    • Mel, B.W.1    Omohundro, S.M.2
  • 21
    • 0003893955 scopus 로고    scopus 로고
    • Ph.D. Thesis, Informatik der Technischen Universität Berlin
    • Schölkopf, B.: Support Vector Learning. Ph.D. Thesis, Informatik der Technischen Universität Berlin (1997).
    • (1997) Support Vector Learning
    • Schölkopf, B.1
  • 25
    • 0015361129 scopus 로고
    • Asymptotic properties of nearest neighbor rules using edited data
    • Wilson, D.: Asymptotic properties of nearest neighbor rules using edited data, IEEE Trans, on Systems, Man and Cybernetics 2, (1972), 408-421.
    • (1972) IEEE Trans, on Systems, Man and Cybernetics , vol.2 , pp. 408-421
    • Wilson, D.1


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