Nearest-Neighbor Methods: A Modern Perspective

Aryeh Kontorovich; Samory Kpotufe

doi:10.1007/978-3-031-24628-9_5

Nearest-Neighbor Methods: A Modern Perspective

Aryeh Kontorovich, Samory Kpotufe

Department of Computer Science

Ben-Gurion University of the Negev

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

This chapter aims at providing an overview of various modern approaches to learning with nearest neighbors in general metric spaces. We provide the necessary background and then proceed to cover classification, regression—with sufficient detail and literature pointers to yield practical insights into how various configuration and pre-processing choices, e.g., metric, the number of neighbors, data subsampling, and compression, affect learning and computational performance.

Original language	American English
Title of host publication	Machine Learning for Data Science Handbook
Subtitle of host publication	Data Mining and Knowledge Discovery Handbook, Third Edition
Pages	75-92
Number of pages	18
ISBN (Electronic)	9783031246289
DOIs	https://doi.org/10.1007/978-3-031-24628-9_5
State	Published - 1 Jan 2023

All Science Journal Classification (ASJC) codes

General Computer Science
General Mathematics

Access to Document

10.1007/978-3-031-24628-9_5

Cite this

@inbook{96d0990c32d94f22905b3ea5240206e1,

title = "Nearest-Neighbor Methods: A Modern Perspective",

abstract = "This chapter aims at providing an overview of various modern approaches to learning with nearest neighbors in general metric spaces. We provide the necessary background and then proceed to cover classification, regression—with sufficient detail and literature pointers to yield practical insights into how various configuration and pre-processing choices, e.g., metric, the number of neighbors, data subsampling, and compression, affect learning and computational performance.",

author = "Aryeh Kontorovich and Samory Kpotufe",

note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2023.",

year = "2023",

month = jan,

day = "1",

doi = "10.1007/978-3-031-24628-9\_5",

language = "American English",

isbn = "9783031246272",

pages = "75--92",

booktitle = "Machine Learning for Data Science Handbook",

}

TY - CHAP

T1 - Nearest-Neighbor Methods

T2 - A Modern Perspective

AU - Kontorovich, Aryeh

AU - Kpotufe, Samory

PY - 2023/1/1

Y1 - 2023/1/1

N2 - This chapter aims at providing an overview of various modern approaches to learning with nearest neighbors in general metric spaces. We provide the necessary background and then proceed to cover classification, regression—with sufficient detail and literature pointers to yield practical insights into how various configuration and pre-processing choices, e.g., metric, the number of neighbors, data subsampling, and compression, affect learning and computational performance.

AB - This chapter aims at providing an overview of various modern approaches to learning with nearest neighbors in general metric spaces. We provide the necessary background and then proceed to cover classification, regression—with sufficient detail and literature pointers to yield practical insights into how various configuration and pre-processing choices, e.g., metric, the number of neighbors, data subsampling, and compression, affect learning and computational performance.

UR - http://www.scopus.com/inward/record.url?scp=85195583837&partnerID=8YFLogxK

U2 - 10.1007/978-3-031-24628-9_5

DO - 10.1007/978-3-031-24628-9_5

M3 - Chapter

SN - 9783031246272

SP - 75

EP - 92

BT - Machine Learning for Data Science Handbook

ER -

Nearest-Neighbor Methods: A Modern Perspective

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this