טוען...
A Fast Exact k-Nearest Neighbors Algorithm for High Dimensional Search Using k-Means Clustering and Triangle Inequality
The k-nearest neighbors (k-NN) algorithm is a widely used machine learning method that finds nearest neighbors of a test object in a feature space. We present a new exact k-NN algorithm called kMkNN (k-Means for k-Nearest Neighbors) that uses the k-means clustering and the triangle inequality to acc...
שמור ב:
| מחבר ראשי: | |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
2012
|
| נושאים: | |
| גישה מקוונת: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3255306/ https://ncbi.nlm.nih.gov/pubmed/22247818 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1016/j.patcog.2010.01.003 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|