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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1), 117–122 (2008)
LSH Algorithm and Implementation (E2LSH): https://www.mit.edu/~andoni/LSH/
Murty, M.N., Susheela devi, V.: Introduction to Pattern Recognition and Machine Learning. World Scientific/IISc Press (2015)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Murty, M., Avinash, M. (2023). Nearest Neighbor Algorithms. In: Representation in Machine Learning. SpringerBriefs in Computer Science. Springer, Singapore. https://doi.org/10.1007/978-981-19-7908-8_3
Download citation
DOI: https://doi.org/10.1007/978-981-19-7908-8_3
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-7907-1
Online ISBN: 978-981-19-7908-8
eBook Packages: Computer ScienceComputer Science (R0)