메뉴 건너뛰기




Volumn 26, Issue 10, 2005, Pages 1554-1567

A divide-and-conquer approach to the pairwise opposite class-nearest neighbor (POC-NN) algorithm

Author keywords

Nearest neighbor rule; Pattern classification; Prototype replacement; Prototype selection

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; DATA REDUCTION; SENSITIVITY ANALYSIS; SET THEORY; SOFTWARE PROTOTYPING; STORAGE ALLOCATION (COMPUTER); USER INTERFACES;

EID: 19744376790     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2005.01.003     Document Type: Article
Times cited : (50)

References (30)
  • 1
    • 0031069975 scopus 로고    scopus 로고
    • Voting over multiple condensed nearest neighbors
    • E. Alpaydin Voting over multiple condensed nearest neighbors Artificial Intell. Rev. 11 1997 115 132
    • (1997) Artificial Intell. Rev. , vol.11 , pp. 115-132
    • Alpaydin, E.1
  • 2
    • 0016127071 scopus 로고
    • Finding prototypes for nearest neighbor classifiers
    • C.L. Chang Finding prototypes for nearest neighbor classifiers IEEE Trans. Computer 23 11 1974 1179 1184
    • (1974) IEEE Trans. Computer , vol.23 , Issue.11 , pp. 1179-1184
    • Chang, C.L.1
  • 3
    • 0018492515 scopus 로고
    • The condensed nearest neighbor rule using the concept of mutual nearest neighborhood
    • K. Chidananda Gowda, and G. Krishna The condensed nearest neighbor rule using the concept of mutual nearest neighborhood IEEE Trans. Inform. Theory 25 4 1979 488 490
    • (1979) IEEE Trans. Inform. Theory , vol.25 , Issue.4 , pp. 488-490
    • Chidananda Gowda, K.1    Krishna, G.2
  • 4
    • 34249753618 scopus 로고
    • Support Vector Networks
    • C. Cortes, and V.N. Vapnik Support Vector Networks Mach. Learn. 20 3 1995 273 297
    • (1995) Mach. Learn. , vol.20 , Issue.3 , pp. 273-297
    • Cortes, C.1    Vapnik, V.N.2
  • 6
    • 0040788584 scopus 로고    scopus 로고
    • Nearest neighbor editing and condensing tools-synergy exploitation
    • B.V. Dasarathy, J.S. Sanchez, and S. Townsend Nearest neighbor editing and condensing tools-synergy exploitation Pattern Anal. Appl. 3 2000 19 30
    • (2000) Pattern Anal. Appl. , vol.3 , pp. 19-30
    • Dasarathy, B.V.1    Sanchez, J.S.2    Townsend, S.3
  • 7
    • 0036466989 scopus 로고    scopus 로고
    • An incremental prototype set building technique
    • V.S. Devi, and M.N. Murty An incremental prototype set building technique Pattern Recognit. 35 2002 505 513
    • (2002) Pattern Recognit. , vol.35 , pp. 505-513
    • Devi, V.S.1    Murty, M.N.2
  • 11
    • 0032597795 scopus 로고    scopus 로고
    • Considerations about sample-size sensitivity of a family of edited nearest neighbor rules
    • F.J. Ferri, J.V. Albert, and E. Vidal Considerations about sample-size sensitivity of a family of edited nearest neighbor rules IEEE Trans. Systems Man Cybernet. B 29 5 1999 667 672
    • (1999) IEEE Trans. Systems Man Cybernet. B , vol.29 , Issue.5 , pp. 667-672
    • Ferri, F.J.1    Albert, J.V.2    Vidal, E.3
  • 12
    • 0015346497 scopus 로고
    • The reduced nearest neighbor rule
    • G.W. Gates The reduced nearest neighbor rule IEEE Trans. Inform. Theory 18 1972 431 433
    • (1972) IEEE Trans. Inform. Theory , vol.18 , pp. 431-433
    • Gates, G.W.1
  • 13
    • 19744367834 scopus 로고
    • An asymptotic analysis of the nearest-neighbor decision rule
    • Stanford Electron. Lab., Stanford, Calif. SEL-66-016
    • Hart, P.E., 1966. An asymptotic analysis of the nearest-neighbor decision rule. Stanford Electron. Lab., Stanford, Calif., Tech. Rep., SEL-66-016, 1828-2.
    • (1966) Tech. Rep. , pp. 1828-1832
    • Hart, P.E.1
  • 14
    • 84931162639 scopus 로고
    • The condensed nearest neighbor rule
    • P.E. Hart The condensed nearest neighbor rule IEEE Trans. Inform. Theory 14 3 1968 515 516
    • (1968) IEEE Trans. Inform. Theory , vol.14 , Issue.3 , pp. 515-516
    • Hart, P.E.1
  • 17
    • 0031999908 scopus 로고    scopus 로고
    • Nearest prototype classification: Clustering, genetic algorithm, or random search?
    • L.I. Kuncheva, and J.C. Bezdek Nearest prototype classification: Clustering, genetic algorithm, or random search? IEEE Trans. Systems Man Cybernet. C 28 1 1998 160 164
    • (1998) IEEE Trans. Systems Man Cybernet. C , vol.28 , Issue.1 , pp. 160-164
    • Kuncheva, L.I.1    Bezdek, J.C.2
  • 21
    • 0003408496 scopus 로고
    • Department of Information and Computer Science, University of California, Irvine, CA
    • Murphy, P.M., Aha, D.W., 1994. UCI Repository of machine learning databases [ http://www.ics.uci.edu/mlearn/MLRepository.html ], Department of Information and Computer Science, University of California, Irvine, CA.
    • (1994) UCI Repository of Machine Learning Databases
    • Murphy, P.M.1    Aha, D.W.2
  • 26
    • 0028483952 scopus 로고
    • A counterexample to Tomek's consistency theorem for a condensed nearest neighbor
    • G.T. Toussaint A counterexample to Tomek's consistency theorem for a condensed nearest neighbor Pattern Recognit. Lett. 15 1994 797 801
    • (1994) Pattern Recognit. Lett. , vol.15 , pp. 797-801
    • Toussaint, G.T.1
  • 30
    • 0015361129 scopus 로고
    • Asymtotic properties of nearest neighbor rules using edited data
    • D.L. Wilson Asymtotic properties of nearest neighbor rules using edited data IEEE Trans. Systems Man Cybernet. Cybernet. 2 1972 408 420
    • (1972) IEEE Trans. Systems Man Cybernet. Cybernet. , vol.2 , pp. 408-420
    • Wilson, D.L.1


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