메뉴 건너뛰기




Volumn 13, Issue 2, 2010, Pages 131-141

A new fast prototype selection method based on clustering

Author keywords

Border prototypes; Clustering; Data reduction; Instance based classifiers; Prototype selection; Supervised classification

Indexed keywords


EID: 77951767444     PISSN: 14337541     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10044-008-0142-x     Document Type: Article
Times cited : (98)

References (30)
  • 1
    • 0031999908 scopus 로고    scopus 로고
    • Nearest prototype classification, clustering, genetic algorithms, or random search?
    • Kuncheva LI, Bezdek JC (1998) Nearest prototype classification, clustering, genetic algorithms, or random search? IEEE Trans Syst Man Cybern C28(1): 160-164.
    • (1998) IEEE Trans Syst Man Cybern , vol.C28 , Issue.1 , pp. 160-164
    • Kuncheva, L.I.1    Bezdek, J.C.2
  • 2
    • 0035575921 scopus 로고    scopus 로고
    • Nearest prototype classifier designs: An experimental study
    • Bezdek JC, Kuncheva LI (2001) Nearest prototype classifier designs: an experimental study. Int J Intell Syst 16(12): 1445-1473.
    • (2001) Int J Intell Syst , vol.16 , Issue.12 , pp. 1445-1473
    • Bezdek, J.C.1    Kuncheva, L.I.2
  • 3
    • 0343081513 scopus 로고    scopus 로고
    • Reduction techniques for instance-based learning algorithms
    • Wilson DR, Martínez TR (2000) Reduction techniques for instance-based learning algorithms. Mach Learn 38: 257-286.
    • (2000) Mach Learn , vol.38 , pp. 257-286
    • Wilson, D.R.1    Martínez, T.R.2
  • 4
    • 0036104537 scopus 로고    scopus 로고
    • Advances in instance selection for instance-based learning algorithms
    • Brighton H, Mellish C (2002) Advances in instance selection for instance-based learning algorithms. Data Min Knowl Disc 6(2): 153-172.
    • (2002) Data Min Knowl Disc , vol.6 , Issue.2 , pp. 153-172
    • Brighton, H.1    Mellish, C.2
  • 5
    • 84926662675 scopus 로고
    • Nearest neighbor pattern classification
    • Cover T, Hart P (1967) Nearest neighbor pattern classification. IEEE Trans Inf Theory 13: 21-27.
    • (1967) IEEE Trans Inf Theory , vol.13 , pp. 21-27
    • Cover, T.1    Hart, P.2
  • 12
    • 84931162639 scopus 로고
    • The condensed nearest neighbor rule
    • Hart PE (1968) The condensed nearest neighbor rule. IEEE Trans Inf Theory 14: 515-516.
    • (1968) IEEE Trans Inf Theory , vol.14 , pp. 515-516
    • Hart, P.E.1
  • 13
    • 0015361129 scopus 로고
    • Asymptotic properties of nearest neighbor rules using edited data
    • Wilson DL (1972) Asymptotic properties of nearest neighbor rules using edited data. IEEE Trans Syst Man Cybern 2: 408-421.
    • (1972) IEEE Trans Syst Man Cybern , vol.2 , pp. 408-421
    • Wilson, D.L.1
  • 14
    • 0018492515 scopus 로고
    • The condensed nearest neighbor rule using the concept of mutual nearest neighborhood
    • Chidananda GK, Krishna G (1979) The condensed nearest neighbor rule using the concept of mutual nearest neighborhood. IEEE Trans Inf Theory 25: 488-490.
    • (1979) IEEE Trans Inf Theory , vol.25 , pp. 488-490
    • Chidananda, G.K.1    Krishna, G.2
  • 16
    • 0016969272 scopus 로고
    • An experiment with the edited nearest-neighbor rule
    • Tomek I (1976) An experiment with the edited nearest-neighbor rule. IEEE Trans Syst Man Cybern 6-6: 448-452.
    • (1976) IEEE Trans Syst Man Cybern , vol.6 , Issue.6 , pp. 448-452
    • Tomek, I.1
  • 18
    • 0141688336 scopus 로고    scopus 로고
    • On issues of instance selection
    • Liu H, Motoda H (2002) On issues of instance selection. Data Min Knowl Disc 6: 115-130.
    • (2002) Data Min Knowl Disc , vol.6 , pp. 115-130
    • Liu, H.1    Motoda, H.2
  • 20
    • 29144517863 scopus 로고    scopus 로고
    • A clustering method for automatic biometric template selection
    • Lumini A, Nanni L (2006) A clustering method for automatic biometric template selection. Pattern Recogn 39: 495-497.
    • (2006) Pattern Recogn , vol.39 , pp. 495-497
    • Lumini, A.1    Nanni, L.2
  • 21
    • 25844469288 scopus 로고    scopus 로고
    • The nearest sub-class classifier: A compromise between the nearest mean and nearest neighbor classifier
    • Venmann CJ, Reinders MJT (2005) The nearest sub-class classifier: a compromise between the nearest mean and nearest neighbor classifier. IEEE Trans Pattern Anal Mach Intell 27(9): 1417-1429.
    • (2005) IEEE Trans Pattern Anal Mach Intell , vol.27 , Issue.9 , pp. 1417-1429
    • Venmann, C.J.1    Reinders, M.J.T.2
  • 23
    • 0036887535 scopus 로고    scopus 로고
    • An efficient prototype merging strategy for the condensed 1-NN rule through class-conditional hierarchical clustering
    • Mollineda RA, Ferri FJ, Vidal E (2002) An efficient prototype merging strategy for the condensed 1-NN rule through class-conditional hierarchical clustering. Pattern Recogn 35: 2771-2782.
    • (2002) Pattern Recogn , vol.35 , pp. 2771-2782
    • Mollineda, R.A.1    Ferri, F.J.2    Vidal, E.3
  • 24
    • 19744376790 scopus 로고    scopus 로고
    • A divide-and-conquer approach to the pairwise opposite class-nearest neighbor (POC-NN) algorithm
    • Raicharoen T, Lursinsap C (2005) A divide-and-conquer approach to the pairwise opposite class-nearest neighbor (POC-NN) algorithm. Pattern Recognit Lett 26(10): 1554-1567.
    • (2005) Pattern Recognit Lett , vol.26 , Issue.10 , pp. 1554-1567
    • Raicharoen, T.1    Lursinsap, C.2
  • 25
    • 0037277806 scopus 로고    scopus 로고
    • Fast minimization of structural risk by nearest neighbor rule
    • Karaçali B, Krim H (2002) Fast minimization of structural risk by nearest neighbor rule. IEEE Trans Neural Netw 14: 127-137.
    • (2002) IEEE Trans Neural Netw , vol.14 , pp. 127-137
    • Karaçali, B.1    Krim, H.2
  • 26
    • 36948999941 scopus 로고    scopus 로고
    • In: University of California, School of Information and Computer Science, Irvine, CA
    • Asuncion A, Newman DJ (2007) UCI machine learning repository. In: University of California, School of Information and Computer Science, Irvine, CA. http://www. ics. uci. edu/~mlearn/MLRepository. html.
    • (2007) UCI machine learning repository
    • Asuncion, A.1    Newman, D.J.2
  • 27
    • 0000259511 scopus 로고    scopus 로고
    • Approximate statistical tests for comparing supervised classification learning algorithms
    • Dietterich TG (1998) Approximate statistical tests for comparing supervised classification learning algorithms. Neural Comput 10(7): 1895-1924.
    • (1998) Neural Comput , vol.10 , Issue.7 , pp. 1895-1924
    • Dietterich, T.G.1
  • 28
    • 77951768992 scopus 로고    scopus 로고
    • Statistical pattern recognition toolbox for Matlab
    • Research report Faculty of Electrical Engineering, Czech Technical University
    • Vojtech F, Václav H (2004) Statistical pattern recognition toolbox for Matlab. Research report, Center for Machine Perception Department of Cybernetic, Faculty of Electrical Engineering, Czech Technical University.
    • (2004) Center for Machine Perception Department of Cybernetic
    • Vojtech, F.1    Václav, H.2
  • 30
    • 77951766195 scopus 로고    scopus 로고
    • The MathWorks Inc.(1994-2008) Natick
    • The MathWorks Inc. (1994-2008) Natick. [http://www. mathworks. com].


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