skip to main content
10.1145/1148170.1148317acmconferencesArticle/Chapter ViewAbstractPublication PagesirConference Proceedingsconference-collections
Article

An analysis of the coupling between training set and neighborhood sizes for the kNN classifier

Published:06 August 2006Publication History

ABSTRACT

We consider the relationship between training set size and the parameter k for the k-Nearest Neighbors (kNN) classifier. When few examples are available, we observe that accuracy is sensitive to k and that best k tends to increase with training size. We explore the subsequent risk that k tuned on partitions will be suboptimal after aggregation and re-training. This risk is found to be most severe when little data is available. For larger training sizes, accuracy becomes increasingly stable with respect to k and the risk decreases.

References

  1. D. D. Lewis, et al., RCV1: A New Benchmark Collection for Text Categorization Research. J. Mach. Learn. Res., 5, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Y. Yang. An Evaluation of Statistical Approaches to Text Categorization. Information Retrieval, 1, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Y. Yang, et al., A Scalability Analysis of Classifiers in Text Categorization. In SIGIR, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. An analysis of the coupling between training set and neighborhood sizes for the kNN classifier

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SIGIR '06: Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
        August 2006
        768 pages
        ISBN:1595933697
        DOI:10.1145/1148170

        Copyright © 2006 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 6 August 2006

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate792of3,983submissions,20%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader