메뉴 건너뛰기




Volumn 26, Issue 7, 2005, Pages 953-963

Stratification for scaling up evolutionary prototype selection

Author keywords

Evolutionary algorithms; Prototype selection; Scaling up; Stratification

Indexed keywords

ARTIFICIAL INTELLIGENCE; DATA ACQUISITION; EVOLUTIONARY ALGORITHMS; VECTORS;

EID: 17444379003     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2004.09.043     Document Type: Article
Times cited : (103)

References (21)
  • 2
    • 0000492326 scopus 로고
    • Learning from noisy examples
    • D. Angluin, and P. Laird Learning from noisy examples Machine Learning 2 4 1987 343 370
    • (1987) Machine Learning , vol.2 , Issue.4 , pp. 343-370
    • Angluin, D.1    Laird, P.2
  • 4
    • 0347763609 scopus 로고    scopus 로고
    • Using evolutionary algorithms as instance selection for data reduction in KDD: An experimental study
    • J.R. Cano, F. Herrera, and M. Lozano Using evolutionary algorithms as instance selection for data reduction in KDD: An experimental study IEEE Transaction on Evolutionary Computation 7 6 2003 561 575
    • (2003) IEEE Transaction on Evolutionary Computation , vol.7 , Issue.6 , pp. 561-575
    • Cano, J.R.1    Herrera, F.2    Lozano, M.3
  • 5
    • 84926662675 scopus 로고
    • Nearest neighbour classification
    • T. Cover, and P. Hart Nearest neighbour classification IEEE Trans. on Inf. Theory IT-13 1 1967 21 27
    • (1967) IEEE Trans. on Inf. Theory , vol.IT-13 , Issue.1 , pp. 21-27
    • Cover, T.1    Hart, P.2
  • 6
    • 0001334115 scopus 로고
    • The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination
    • G.J.E. Rawlins Morgan Kauffman
    • L.J. Eshelman The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination G.J.E. Rawlins Foundations of Genetic Algorithms 1 1991 Morgan Kauffman 265 283
    • (1991) Foundations of Genetic Algorithms 1 , pp. 265-283
    • Eshelman, L.J.1
  • 7
    • 0027701744 scopus 로고
    • What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation
    • S. Forrest, and M. Mitchell What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation Machine Learning 13 1993 285 319
    • (1993) Machine Learning , vol.13 , pp. 285-319
    • Forrest, S.1    Mitchell, M.2
  • 8
    • 0015346497 scopus 로고
    • The reduced nearest neighbour rule
    • G.W. Gates The reduced nearest neighbour rule IEEE Trans. on Inf. Theory 18 5 1972 431 433
    • (1972) IEEE Trans. on Inf. Theory , vol.18 , Issue.5 , pp. 431-433
    • Gates, G.W.1
  • 10
    • 0000777639 scopus 로고
    • The condensed nearest neighbour rule
    • P.E. Hart The condensed nearest neighbour rule IEEE Trans. on Inf. Theory 18 3 1968 431 433
    • (1968) IEEE Trans. on Inf. Theory , vol.18 , Issue.3 , pp. 431-433
    • Hart, P.E.1
  • 12
    • 0000935031 scopus 로고
    • Editing for the k-nearest neighbors rule by a genetic algorithm
    • L. Kuncheva Editing for the k-nearest neighbors rule by a genetic algorithm Pattern Recognition Lett. 16 1995 809 814
    • (1995) Pattern Recognition Lett. , vol.16 , pp. 809-814
    • Kuncheva, L.1
  • 13
    • 0003408496 scopus 로고    scopus 로고
    • University of California Irvine, Department of Information and Computer Science
    • Merz, C.J., Murphy, P.M., 1996. UCI repository of machine learning databases, University of California Irvine, Department of Information and Computer Science, Available from: 〈http://kdd.ics.uci.edu〉
    • (1996) UCI Repository of Machine Learning Databases
    • Merz, C.J.1    Murphy, P.M.2
  • 15
    • 0034825422 scopus 로고    scopus 로고
    • Comparison of genetic algorithm based prototype selection schemes
    • T. Ravindra, and M. Narasimha Comparison of genetic algorithm based prototype selection schemes Pattern Recognition 34 2001 523 525
    • (2001) Pattern Recognition , vol.34 , pp. 523-525
    • Ravindra, T.1    Narasimha, M.2
  • 17
    • 0036832996 scopus 로고    scopus 로고
    • Design of an optimal nearest neighbour classifier using an intelligent genetic algorithm
    • H. Shinn-Ying, L. Chia-Cheng, and L. Soundy Design of an optimal nearest neighbour classifier using an intelligent genetic algorithm Pattern Recognition Lett. 23 13 2002 1495 1503
    • (2002) Pattern Recognition Lett. , vol.23 , Issue.13 , pp. 1495-1503
    • Shinn-Ying, H.1    Chia-Cheng, L.2    Soundy, L.3
  • 18
    • 0015361129 scopus 로고
    • Asymptotic properties of nearest neighbour rules using edited data
    • D.L. Wilson Asymptotic properties of nearest neighbour rules using edited data IEEE Transactions on Systems Man. and Cybernetics 2 1972 408 421
    • (1972) IEEE Transactions on Systems Man. and Cybernetics , vol.2 , pp. 408-421
    • Wilson, D.L.1
  • 20
    • 0033901276 scopus 로고    scopus 로고
    • An integrated instance-based learning algorithm
    • D.R. Wilson, and T.R. Martinez An integrated instance-based learning algorithm Computational Intelligence 16 1 2000 1 28
    • (2000) Computational Intelligence , vol.16 , Issue.1 , pp. 1-28
    • Wilson, D.R.1    Martinez, T.R.2
  • 21
    • 0343081513 scopus 로고    scopus 로고
    • Reduction techniques for instance-based learning algorithms
    • D.R. Wilson, and T.R. Martinez Reduction techniques for instance-based learning algorithms Machine Learning 38 2000 257 268
    • (2000) Machine Learning , vol.38 , pp. 257-268
    • Wilson, D.R.1    Martinez, T.R.2


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