Loading...
Please wait, while we are loading the content...
Similar Documents
A Logarithmic-Complexity Algorithm for Nearest Neighbor Classification Using Layered Range Trees
| Content Provider | Semantic Scholar |
|---|---|
| Author | Al-Bluwi, Ibrahim Elnagar, Ashraf |
| Copyright Year | 2013 |
| Abstract | Finding Nearest Neighbors efficiently is crucial to the design of any nearest neighbor classifier. This paper shows how Layered Range Trees (LRT) could be utilized for efficient nearest neighbor classification. The presented algorithm is robust and finds the nearest neighbor in a logarithmic order. The proposed algorithm reports the nearest neighbor in , where k is a very small constant when compared with the dataset size n and d is the number of dimensions. Experimental results demonstrate the efficiency of the proposed algorithm. 1 log log O d n n kd 2 |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://file.scirp.org/pdf/IIM20120200002_18017544.pdf |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Dimensions Genealogical Tree K-nearest neighbors algorithm Large Long-running transaction Nearest neighbor search Nearest neighbour algorithm Question (inquiry) Range query (database) Range tree Robustness (computer science) Single Linkage Cluster Analysis Trees (plant) anatomical layer |
| Content Type | Text |
| Resource Type | Article |
