his.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Extending Nearest Neighbor Classification with Spheres of Confidence
School of Business and Informatics, University of Borås, Sweden.
University of Skövde, School of Humanities and Informatics. University of Skövde, The Informatics Research Centre.
School of Business and Informatics, University of Borås, Sweden.
2008 (English)In: Proceedings of the Twenty-First International FLAIRS Conference (FLAIRS 2008), AAAI Press, 2008, 282-287 p.Conference paper, (Refereed)
Abstract [en]

The standard kNN algorithm suffers from two major drawbacks: sensitivity to the parameter value k, i.e., the number of neighbors, and the use of k as a global constant that is independent of the particular region in which theexample to be classified falls. Methods using weighted voting schemes only partly alleviate these problems, since they still involve choosing a fixed k. In this paper, a novel instance-based learner is introduced that does not require kas a parameter, but instead employs a flexible strategy for determining the number of neighbors to consider for the specific example to be classified, hence using a local instead of global k. A number of variants of the algorithm are evaluated on 18 datasets from the UCI repository. The novel algorithm in its basic form is shown to significantly outperform standard kNN with respect to accuracy, and an adapted version of the algorithm is shown to be clearlyahead with respect to the area under ROC curve. Similar to standard kNN, the novel algorithm still allows for various extensions, such as weighted voting and axes scaling.

Place, publisher, year, edition, pages
AAAI Press, 2008. 282-287 p.
National Category
Computer Science
Research subject
Technology
Identifiers
URN: urn:nbn:se:his:diva-2828Scopus ID: 2-s2.0-55849145096ISBN: 978-1-57735-365-2 OAI: oai:DiVA.org:his-2828DiVA: diva2:209013
Conference
21th International Florida Artificial Intelligence Research Society Conference, FLAIRS-21;Coconut Grove, FL;15 May 2008through17 May 2008
Available from: 2009-03-23 Created: 2009-03-04 Last updated: 2013-03-17

Open Access in DiVA

No full text

Other links

ScopusExternal link to full text

Search in DiVA

By author/editor
Boström, Henrik
By organisation
School of Humanities and InformaticsThe Informatics Research Centre
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Total: 25 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf