메뉴 건너뛰기




Volumn 36, Issue 4, 2003, Pages 1009-1018

Finding representative patterns with ordered projections

Author keywords

Axis parallel classifiers; Data mining; Pattern analysis; Preprocessing techniques

Indexed keywords

DATA REDUCTION; LEARNING ALGORITHMS;

EID: 0036555992     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(02)00119-X     Document Type: Article
Times cited : (72)

References (15)
  • 2
    • 84926662675 scopus 로고
    • Nearest neighbor pattern classification
    • T.M. Cover, P.E. Hart, Nearest neighbor pattern classification, IEEE Trans. Inf. Theory IT-13 (1) (1967) 21-27. 1018 J.C. Riquelme et al. Pattern Recognition 36 (2003) 1009- 1018
    • (1967) IEEE Trans. Inf. Theory IT-13 , Issue.1 , pp. 21-27
    • Cover, T.M.1    Hart, P.E.2
  • 3
    • 84931162639 scopus 로고
    • The condensed nearest neighbor rule
    • P. Hart, The condensed nearest neighbor rule, IEEE Trans. Inf. Theory 14 (3) (1968) 515-516.
    • (1968) IEEE Trans. Inf. Theory , vol.14 , Issue.3 , pp. 515-516
    • Hart, P.1
  • 5
    • 0001899045 scopus 로고    scopus 로고
    • Improved heterogeneous distance functions
    • D.R. Wilson, T.R. Martinez, Improved heterogeneous distance functions, J. Artif. Intell. Res. 6 (1) (1997) 1-34.
    • (1997) J. Artif. Intell. Res. , vol.6 , Issue.1 , pp. 1-34
    • Wilson, D.R.1    Martinez, T.R.2
  • 6
    • 0016969272 scopus 로고
    • An experiment with the edited nearest-neighbor rule
    • I. Tomek, An experiment with the edited nearest-neighbor rule, IEEE Trans. Syst. Man Cybern. 6 (6) (1976) 448-452.
    • (1976) IEEE Trans. Syst. Man Cybern. , vol.6 , Issue.6 , pp. 448-452
    • Tomek, I.1
  • 7
    • 0016569790 scopus 로고
    • An algorithm for a selective nearest neighbor decision rule
    • G. Ritter, H. Woodruff, S. Lowry, T. Isenhour, An algorithm for a selective nearest neighbor decision rule, IEEE Trans. Inf. Theory 21 (6) (1975) 665-669.
    • (1975) IEEE Trans. Inf. Theory , vol.21 , Issue.6 , pp. 665-669
    • Ritter, G.1    Woodruff, H.2    Lowry, S.3    Isenhour, T.4
  • 8
    • 0003160635 scopus 로고
    • On the complexity of d-dimensional voronoi diagrams
    • V. Klee, On the complexity of d-dimensional voronoi diagrams, Arch. Math. 34 (1980) 75-80.
    • (1980) Arch. Math. , vol.34 , pp. 75-80
    • Klee, V.1
  • 9
    • 0019213414 scopus 로고
    • The relative neighborhood graph of a finite planar set
    • G.T. Toussaint, The relative neighborhood graph of a finite planar set, Pattern Recognition 12 (4) (1980) 261-268.
    • (1980) Pattern Recognition , vol.12 , Issue.4 , pp. 261-268
    • Toussaint, G.T.1
  • 12
    • 0015361129 scopus 로고
    • Asymptotic properties of nearest neighbor rules using edited data
    • D. Wilson, Asymptotic properties of nearest neighbor rules using edited data, IEEE Trans. Syst. Man Cybern. 2 (3) (1972) 408-421.
    • (1972) IEEE Trans. Syst. Man Cybern. , vol.2 , Issue.3 , pp. 408-421
    • Wilson, D.1
  • 13
  • 14
    • 0002217386 scopus 로고
    • Quicksort
    • C.A.R. Hoare, Quicksort, Comput. J. 5 (1) (1962) 10-15.
    • (1962) Comput. J. , vol.5 , Issue.1 , pp. 10-15
    • Hoare, C.A.R.1
  • 15


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