2020
DOI: 10.1007/978-981-15-3514-7_43
|View full text |Cite
|
Sign up to set email alerts
|

Analysis of the Nearest Neighbor Classifiers: A Review

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 24 publications
0
3
0
Order By: Relevance
“…A K-Nearest Neighbor (KNN) algorithm is a data classification method that estimates the likelihood that a data point will become a member of one group or another, depending on which group the nearest data point belongs. It means a KNN classifier is a distance function, in effect an application of the Pythagorean theorem, which measures the difference or similarity between two instances [11]. The KNN ML approach is practical in several network categories (e.g., IoT, industry WLAN IoT, and self-designed networks) where each network could be affected by different attacks.…”
Section: Improve Diversity Of Generated Dtmentioning
confidence: 99%
“…A K-Nearest Neighbor (KNN) algorithm is a data classification method that estimates the likelihood that a data point will become a member of one group or another, depending on which group the nearest data point belongs. It means a KNN classifier is a distance function, in effect an application of the Pythagorean theorem, which measures the difference or similarity between two instances [11]. The KNN ML approach is practical in several network categories (e.g., IoT, industry WLAN IoT, and self-designed networks) where each network could be affected by different attacks.…”
Section: Improve Diversity Of Generated Dtmentioning
confidence: 99%
“…The kNN algorithm compares the unknown sample to the k training sample, which is the new sample's nearest neighbor. Preliminary theoretical results were published by [18], while a thorough summary was published by [19]. Finding the k closest training examples was the first step in applying the kNN algorithm to a new instance.…”
Section: K-nearest Neighbors (Knn)mentioning
confidence: 99%
“…The kNN algorithm compares the unknown sample with the k training sample, the closest neighbor of the new sample. The preliminary theoretical results can be found in [27], and a comprehensive overview can be found in [28] In the next step, the kNN algorithm classifies the unknown sample by voting on the majority of the neighbors it finds. In the case of a regression, the predicted value is the average of the found values of the neighbor.…”
Section: K-nearest Neighbors (Knn)mentioning
confidence: 99%