Fast Nearest Neighbor Classification Using Class-Based Clustering
碩士 === 國立臺中技術學院 === 資訊科技與應用研究所 === 95 === Nearest Neighbor Rule (NNR) is a parameter-free classifier which is easy to implement, simple to operate and with high accuracy. However, it is time and memory consuming for a large dataset. Many improved NNR algorithms were proposed previously. Amongst them...
Main Authors: | Yung-Hsing Chiu, 邱永興 |
---|---|
Other Authors: | Tung-Shou Chen |
Format: | Others |
Language: | zh-TW |
Published: |
2007
|
Online Access: | http://ndltd.ncl.edu.tw/handle/93600610060338451269 |
Similar Items
-
Fast Pattern Classification through Nearest-Neighbor Search
by: Po-chung Wang, et al.
Published: (2010) -
Approximated Nearest Neighbor Searching Based on Clustering
by: Zhuang, Feng-Zhi, et al.
Published: (2015) -
An Improved DBSCAN Algorithm Based on the Neighbor Similarity and Fast Nearest Neighbor Query
by: Shan-Shan Li
Published: (2020-01-01) -
The k conditional nearest neighbor algorithm for classification and class probability estimation
by: Hyukjun Gweon, et al.
Published: (2019-05-01) -
Fast Searching Density Peak Clustering Algorithm Based on Shared Nearest Neighbor and Adaptive Clustering Center
by: Yi Lv, et al.
Published: (2020-12-01)