PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
April 1, 200810 citations

An Enhancement of K-Nearest Neighbor Algorithm Using Information Gain and Extension Relativity

View Full Paper
BWBaobao WangMJMao JinshengSMShao Minru

Key Points

Key points are not available for this paper at this time.

Abstract

An enhanced K-NN algorithm is proposed in this paper to improve the conventional K-NN algorithm. The enhanced K-NN algorithm proposed uses information gain and extension relativity. The weight coefficient is got through computing the information gain of attributes. In this approach, the anti-jamming ability and accuracy of the K-NN algorithm is improved highly, and the computing time is reduced and the time is improved greatly. The test results show that the novel K-NN algorithm is feasible and effective.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Wang et al. (2008) studied this question.

synapsesocial.com/papers/6a21f4aa505988242b492b91https://doi.org/10.1109/cmd.2008.4580218
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Fast k-nearest neighbor classification using cluster-based trees2004 · 164 citations
  2. 2A fast nearest neighbor search algorithm by filtration2002 · 18 citations
  3. 3Strategies for efficient incremental nearest neighbor search1990 · 79 citations
  4. 4A multiple feature/resolution approach to handprinted digit and character recognition1996 · 121 citations
  5. 5A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition1986 · 109 citations