2013 International Conference on Machine Learning and Cybernetics 2013
DOI: 10.1109/icmlc.2013.6890883
|View full text |Cite
|
Sign up to set email alerts
|

KNNCC: An algorithm for k-nearest neighbor clique clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 5 publications
0
1
0
Order By: Relevance
“…The main idea of KNN was that a sample's category is decided by its k most similar samples. The sample falls into a category which contains the largest number of its k most similar samples (Qu, Yuan, & Wei, ). KNN classifier allows for an intuitive display of the prediction results (Paul et al, ).…”
Section: Methodsmentioning
confidence: 99%
“…The main idea of KNN was that a sample's category is decided by its k most similar samples. The sample falls into a category which contains the largest number of its k most similar samples (Qu, Yuan, & Wei, ). KNN classifier allows for an intuitive display of the prediction results (Paul et al, ).…”
Section: Methodsmentioning
confidence: 99%