메뉴 건너뛰기




Volumn , Issue , 2004, Pages 375-378

Using representative-based clustering for nearest neighbor dataset editing

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING; DATASET; DATASET EDITING; EMPIRICAL EVALUATION;

EID: 19544361851     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2004.10044     Document Type: Conference Paper
Times cited : (21)

References (7)
  • 2
    • 0017458061 scopus 로고
    • Another look at the edited nearest neighbor rule
    • Penrod, C. and Wagner, T., "Another look at the edited nearest neighbor rule", IEEE Trans. Syst., Man, Cyber., SMC-7:92-94, 1977.
    • (1977) IEEE Trans. Syst., Man, Cyber. , vol.SMC-7 , pp. 92-94
    • Penrod, C.1    Wagner, T.2
  • 3
    • 12144277738 scopus 로고    scopus 로고
    • Proximity graphs for nearest neighbor decision rules: Recent progress
    • Montreal, Canada, April 17-20
    • th Symposium on the INTERFACE, Montreal, Canada, April 17-20, 2002.
    • (2002) th Symposium on the INTERFACE
    • Toussaint, G.1
  • 4
    • 34250666040 scopus 로고    scopus 로고
    • University of California at Irving, Machine Learning Repository. http://www.ics.uci.edu/~mlearn/MLRepository.html
    • Machine Learning Repository
  • 5
    • 0015361129 scopus 로고
    • Asymptotic properties of nearest neighbor rules using edited data
    • Wilson, D.L., "Asymptotic Properties of Nearest Neighbor Rules Using Edited Data", IEEE Transactions on Systems, Man, and Cybernetics, 2:408-420, 1972.
    • (1972) IEEE Transactions on Systems, Man, and Cybernetics , vol.2 , pp. 408-420
    • Wilson, D.L.1
  • 6
    • 19544366730 scopus 로고    scopus 로고
    • Using k-medoid style algorithms for supervised summary generation
    • Las Vegas, June
    • Zeidat, N., Eick, C., "Using k-medoid Style Algorithms for Supervised Summary Generation", Proceedings of MLMTA, Las Vegas, June 2004.
    • (2004) Proceedings of MLMTA
    • Zeidat, N.1    Eick, C.2


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