C × K-nearest neighbor classification with ordered weighted averaging distance
Book chapter · 2016
Authors: Gözde ULUTAGAY, Efendi Nasibov
Studies in Computational Intelligence, Springer Verlagservice@springer.de, International, 2016, pp 105-122, Germany
DOI: 10.1007/978-3-319-14194-7_6
Summary
In this study, OWA (Ordered Weighted Averaging) distance based C × K-nearest neighbor algorithm (C × K-NN) is considered. In this approach, from each class, where the number of classes is C, K-nearest neighbors are taken. The distance between the new sample and its K-nearest set is determined based on the OWA operator. It is shown that by adjusting the weights of the OWA operator, it is possible to obtain the results of various clustering strategies like single-linkage, complete-linkage, average-linkage, etc.