2008
DOI: 10.1016/j.chemolab.2008.06.007
|View full text |Cite
|
Sign up to set email alerts
|

Calculation of the probability of correct classification in probabilistic bagged k-Nearest Neighbours

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2009
2009
2016
2016

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(7 citation statements)
references
References 25 publications
0
7
0
Order By: Relevance
“…The new Bagged k-nearest neighbours is compared here to PBkNN [10], which combines kNN and bootstrap, without taking into account the uncertainty in the x. In PBkNN, for a given unknown object x t , its k-nearest neighbours in each X b are obtained.…”
Section: Probabilistic Bagged-knn (Pbknn)mentioning
confidence: 99%
See 4 more Smart Citations
“…The new Bagged k-nearest neighbours is compared here to PBkNN [10], which combines kNN and bootstrap, without taking into account the uncertainty in the x. In PBkNN, for a given unknown object x t , its k-nearest neighbours in each X b are obtained.…”
Section: Probabilistic Bagged-knn (Pbknn)mentioning
confidence: 99%
“…Bagging (Bootstrap AGGregatING) is a type of ensemble method which uses bootstrap to improve the performance of the classifier [7,[9][10][11][12]. The improvement is obtained because bootstrap combined with a classification method leads to a reduction of the misclassification error [13].…”
Section: Baggingmentioning
confidence: 99%
See 3 more Smart Citations