메뉴 건너뛰기




Volumn 28, Issue 1, 1998, Pages 160-164

Nearest prototype classification: clustering, genetic algorithms, or random search?

Author keywords

Classifier design, genetic algorithms (GA's); Nearest prototypes; Random search (RS)

Indexed keywords

ERROR ANALYSIS; GENETIC ALGORITHMS; RANDOM PROCESSES;

EID: 0031999908     PISSN: 10946977     EISSN: None     Source Type: Journal    
DOI: 10.1109/5326.661099     Document Type: Article
Times cited : (203)

References (13)
  • 1
    • 0001844324 scopus 로고    scopus 로고
    • An overview of genetic algorithms: Part 1, fundamentals
    • vol. 15, pp. 58-69, 1993.
    • D. Beasley, D. R. Bull, and R. R. Martin, An overview of genetic algorithms: Part 1, fundamentals, Univ. Comput., vol. 15, pp. 58-69, 1993.
    • Univ. Comput.
    • Beasley, D.1    Bull, D.R.2    Martin, R.R.3
  • 2
    • 33747981338 scopus 로고    scopus 로고
    • An overview of genetic algorithms: Part 2, research topics
    • vol. 15, pp. 170-181, 1993.
    • An overview of genetic algorithms: Part 2, research topics, Univ. Comput., vol. 15, pp. 170-181, 1993.
    • Univ. Comput.
  • 4
    • 0000436567 scopus 로고    scopus 로고
    • Using genetic algorithms to improve pattern classification performance
    • vol. 3, R. P. Lippmann, J. E. Moody, and D. S. Touretzky, Eds. San Mateo, CA: Morgan Kaufman, 1991, pp. 797-803.
    • E. I. Chang and R. P. Lippmann, Using genetic algorithms to improve pattern classification performance, in Advances in Neural Information Processing Systems, vol. 3, R. P. Lippmann, J. E. Moody, and D. S. Touretzky, Eds. San Mateo, CA: Morgan Kaufman, 1991, pp. 797-803.
    • Advances in Neural Information Processing Systems
    • Chang, E.I.1    Lippmann, R.P.2
  • 5
    • 0016127071 scopus 로고    scopus 로고
    • Finding prototypes for nearest neighbor classifiers
    • 23, pp. 1179-1184, Nov. 1974.
    • C. L. Chang, Finding prototypes for nearest neighbor classifiers, IEEE Trans. Comput., vol. C-23, pp. 1179-1184, Nov. 1974.
    • IEEE Trans. Comput., Vol. C
    • Chang, C.L.1
  • 7
    • 0028385080 scopus 로고    scopus 로고
    • Minimal consistent set (MCS) identification for optimal nearest neighbor decision systems desig
    • vol. 24, pp. 511-517, Apr. 1994.
    • _, Minimal consistent set (MCS) identification for optimal nearest neighbor decision systems design, IEEE Trans. Syst., Man, Cybern., vol. 24, pp. 511-517, Apr. 1994.
    • IEEE Trans. Syst., Man, Cybern.
  • 10
    • 84931162639 scopus 로고    scopus 로고
    • The condensed nearest neighbor rule
    • 14, pp. 515-516, Mar. 1968.
    • P. E. Hart, The condensed nearest neighbor rule, IEEE Trans. Inform. Theory, vol. IT-14, pp. 515-516, Mar. 1968.
    • IEEE Trans. Inform. Theory, Vol. IT
    • Hart, P.E.1
  • 12
    • 0000935031 scopus 로고    scopus 로고
    • Editing for the fc-nearest neighbors rule by a genetic algorithm
    • vol. 16, pp. 809-814, 1995.
    • L. I. Kuncheva, Editing for the fc-nearest neighbors rule by a genetic algorithm, Pattern Recognit. Lett., vol. 16, pp. 809-814, 1995.
    • Pattern Recognit. Lett.
    • Kuncheva, L.I.1
  • 13
    • 0031168619 scopus 로고    scopus 로고
    • Fitness functions in editing fc-NN reference set by genetic algorithms
    • vol. 30, no. 6, pp. 1041-1049, 1997.
    • -, Fitness functions in editing fc-NN reference set by genetic algorithms, Pattern Recognit., vol. 30, no. 6, pp. 1041-1049, 1997.
    • Pattern Recognit.


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