메뉴 건너뛰기




Volumn 21, Issue 4, 1999, Pages 380-384

Data compression and local metrics for nearest neighbor classification

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING ALGORITHMS; LEARNING SYSTEMS; MATHEMATICAL MODELS;

EID: 0032664374     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.761268     Document Type: Article
Times cited : (30)

References (21)
  • 1
    • 0000217085 scopus 로고
    • Tolerating Noisy, Irrelevant, and Novel Attributes in Instance-Based Learning Algorithms
    • D.W. Aha, "Tolerating Noisy, Irrelevant, and Novel Attributes in Instance-Based Learning Algorithms," Int'l }. Man-Machine Studies, vol. 36, pp. 267-287,1992.
    • (1992) Int'l }. Man-Machine Studies , vol.36 , pp. 267-287
    • Aha, D.W.1
  • 3
    • 0031069975 scopus 로고    scopus 로고
    • Voting over Multiple Condensed Nearest Neighbors
    • E. Alpaydim, "Voting Over Multiple Condensed Nearest Neighbors," AI Review J., vol. 11, pp. 115-132,1997.
    • (1997) AI Review J. , vol.11 , pp. 115-132
    • Alpaydim, E.1
  • 4
    • 33749733409 scopus 로고    scopus 로고
    • Nearest Neighbor Classification from Multiple Feature Subsets
    • S.D. Bay, "Nearest Neighbor Classification From Multiple Feature Subsets," Machine Learning, 1998.
    • (1998) Machine Learning
    • Bay, S.D.1
  • 5
    • 0030211964 scopus 로고    scopus 로고
    • Bagging Predictors
    • L. Breiman, "Bagging Predictors," Machine Learning, vol. 24, no. 2, pp. 123-140,1996.
    • (1996) Machine Learning , vol.24 , Issue.2 , pp. 123-140
    • Breiman, L.1
  • 6
    • 0003619255 scopus 로고    scopus 로고
    • Bias, Variance, and Arcing Classifiers
    • Univ. of California, Berkeley, Apr.
    • L. Breiman, "Bias, Variance, and Arcing Classifiers," Technical Report 460, Univ. of California, Berkeley, Apr. 1996.
    • (1996) Technical Report , vol.460
    • Breiman, L.1
  • 9
    • 0004161991 scopus 로고
    • A.K. Kain and R.C. Dubes, eds. Prentice Hall
    • Algorithms for Clustering Data, A.K. Kain and R.C. Dubes, eds. Prentice Hall, 1988.
    • (1988) Algorithms for Clustering Data
  • 10
    • 0025489075 scopus 로고
    • The Self-Organizing Map
    • Sept.
    • T. Kohonen, "The Self-Organizing Map," Proc. IEEE, vol. 78, no. 9, pp. 1,464-1,480, Sept. 1990.
    • (1990) Proc. IEEE , vol.78 , Issue.9
    • Kohonen, T.1
  • 11
    • 0023991782 scopus 로고
    • Context and Structure in Conceptual Combination
    • D.L. Medin and EJ. Shoben, "Context and Structure in Conceptual Combination," Cognitive Psychology, vol. 20, pp. 158-190,1988.
    • (1988) Cognitive Psychology , vol.20 , pp. 158-190
    • Medin, D.L.1    Shoben, E.J.2
  • 14
    • 84871556450 scopus 로고    scopus 로고
    • Error-Correcting Output Codes for Local Learners
    • Chemnitz, Germany, Apr.
    • F. Ricci and D.W. Aha, "Error-Correcting Output Codes for Local Learners," Proc. Wth European Conf. Machine Learning, Chemnitz, Germany, Apr. 1998.
    • (1998) Proc. Wth European Conf. Machine Learning
    • Ricci, F.1    Aha, D.W.2
  • 15
    • 0343825113 scopus 로고    scopus 로고
    • Nearest Neighbor Classification with a Local Asymmetrically Weighted Metric
    • IRST, Feb.
    • F. Ricci and P. Avesani, "Nearest Neighbor Classification With a Local Asymmetrically Weighted Metric," Technical Report no. 9602-01, IRST, Feb. 1996.
    • (1996) Technical Report No. 9602-01
    • Ricci, F.1    Avesani, P.2
  • 17
    • 0019610270 scopus 로고
    • The Optimal Distance Measure for Nearest Neighbour Classification
    • R.D. Short and K. Fukunaga, "The Optimal Distance Measure for Nearest Neighbour Classification. IEEE Trans. Information Theory, vol. 27, pp. 622-627,1981.
    • (1981) IEEE Trans. Information Theory , vol.27 , pp. 622-627
    • Short, R.D.1    Fukunaga, K.2
  • 18
    • 0012657799 scopus 로고
    • Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
    • New Brunswick, N.J.
    • D.B. Skalak, "Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms," Proc. llth Int'l Machine Learning Conf., pp. 293-301, New Brunswick, N.J., 1994.
    • (1994) Proc. Llth Int'l Machine Learning Conf. , pp. 293-301
    • Skalak, D.B.1
  • 19
    • 0022909661 scopus 로고
    • Toward Memory-Based Reasoning
    • C. Stanfill and D. Waltz, "Toward Memory-Based Reasoning," Comm. ACM, vol. 29, pp. 1,213-1,229,1986.
    • (1986) Comm. ACM , vol.29
    • Stanfill, C.1    Waltz, D.2
  • 20
    • 0031073477 scopus 로고    scopus 로고
    • A Review and Empirical Comparison of Feature Weighting Methods for a Class of Lazy Learning Algorithms
    • D. Wettschereck, T. Mohri, and D.W. Aha, "A Review and Empirical Comparison of Feature Weighting Methods for a Class of Lazy Learning Algorithms," AI Review J., vol. 11, pp. 273-314,1997.
    • (1997) AI Review J. , vol.11 , pp. 273-314
    • Wettschereck, D.1    Mohri, T.2    Aha, D.W.3


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