Comparison Between Mini-Models Based on Multidimensional Polytopes and K-Nearest Neighbor Method: Case Study of 4D and 5D Problems

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents the comparison between mini-models method based on multidimensional polytopes and k-nearest neighbor method. Both algorithms are similar, and bothmethods use samples only from the local neighborhood of the query point. The mini-models method can on the defined local area use any approximation algorithm to compute the model answer. The paper describes the learning technique of mini-models and presents the results of experiments that compare the effectiveness of two examined algorithms.

Cite

CITATION STYLE

APA

Pietrzykowski, M. (2015). Comparison Between Mini-Models Based on Multidimensional Polytopes and K-Nearest Neighbor Method: Case Study of 4D and 5D Problems. In Advances in Intelligent Systems and Computing (Vol. 342, pp. 107–118). Springer Verlag. https://doi.org/10.1007/978-3-319-15147-2_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free