Murty, M and Avinash, M (2023) Nearest Neighbor Algorithms. [Book Chapter]
Full text not available from this repository.
Official URL: https://doi.org/10.1007/978-981-19-7908-8_3
Abstract
Most of the practical data sets are high-dimensional. A major difficulty with classifying such data is involved not only in terms of the computational demands but also in terms of classification performance. It is very obvious when the learning algorithms are dependent on distances. In this chapter, we present the difficulties and possible solutions to deal with such high-dimensional data classification.
| Item Type: | Book Chapter |
|---|---|
| Publication: | SpringerBriefs in Computer Science |
| Publisher: | Springer |
| Additional Information: | The copyright for this article belongs to Springer. |
| Keywords: | Clustering algorithms, Classification performance; Computational demands; Data classification; Data set; High dimensional data; High-dimensional; Higher-dimensional; Nearest-neighbor algorithms, Classification (of information) |
| Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
| Date Deposited: | 20 May 2023 05:26 |
| Last Modified: | 20 May 2023 05:26 |
| URI: | https://eprints.iisc.ac.in/id/eprint/81586 |
Actions (login required)
 |
View Item |
