An arithmetic method algorithm optimizing k-nearest neighbors compared to regression algorithms and evaluated on real world data sources
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911434428907520 |
|---|---|
| author | Anagnostopoulos, Theodoros Zervoudi, Evanthia Anagnostopoulos, Christos Christopoulos, Apostolos Wierzbinski, Bogdan |
| author_facet | Anagnostopoulos, Theodoros Zervoudi, Evanthia Anagnostopoulos, Christos Christopoulos, Apostolos Wierzbinski, Bogdan |
| contents | Linear regression analysis focuses on predicting a numeric regressand value based on certain regressor values. In this context, k-Nearest Neighbors (k-NN) is a common non-parametric regression algorithm, which achieves efficient performance when compared with other algorithms in literature. In this research effort an optimization of the k-NN algorithm is proposed by exploiting the potentiality of an introduced arithmetic method, which can provide solutions for linear equations involving an arbitrary number of real variables. Specifically, an Arithmetic Method Algorithm (AMA) is adopted to assess the efficiency of the introduced arithmetic method, while an Arithmetic Method Regression (AMR) algorithm is proposed as an optimization of k-NN adopting the potentiality of AMA. Such algorithm is compared with other regression algorithms, according to an introduced optimal inference decision rule, and evaluated on certain real world data sources, which are publicly available. Results are promising since the proposed AMR algorithm has comparable performance with the other algorithms, while in most cases it achieves better performance than the k-NN. The output results indicate that introduced AMR is an optimization of k-NN. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_08577 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | An arithmetic method algorithm optimizing k-nearest neighbors compared to regression algorithms and evaluated on real world data sources Anagnostopoulos, Theodoros Zervoudi, Evanthia Anagnostopoulos, Christos Christopoulos, Apostolos Wierzbinski, Bogdan Machine Learning Combinatorics Computation 68Q25, 68W40, 68W05, 68W32, 68W25, 03D15, 03F52, 12D05, 03H15, 12E05 I.1.1; I.1.2; I.5.1; I.5.2; I.5.4; I.6.5; G.1.3; G.1.6; F.2.1; F.2.2 Linear regression analysis focuses on predicting a numeric regressand value based on certain regressor values. In this context, k-Nearest Neighbors (k-NN) is a common non-parametric regression algorithm, which achieves efficient performance when compared with other algorithms in literature. In this research effort an optimization of the k-NN algorithm is proposed by exploiting the potentiality of an introduced arithmetic method, which can provide solutions for linear equations involving an arbitrary number of real variables. Specifically, an Arithmetic Method Algorithm (AMA) is adopted to assess the efficiency of the introduced arithmetic method, while an Arithmetic Method Regression (AMR) algorithm is proposed as an optimization of k-NN adopting the potentiality of AMA. Such algorithm is compared with other regression algorithms, according to an introduced optimal inference decision rule, and evaluated on certain real world data sources, which are publicly available. Results are promising since the proposed AMR algorithm has comparable performance with the other algorithms, while in most cases it achieves better performance than the k-NN. The output results indicate that introduced AMR is an optimization of k-NN. |
| title | An arithmetic method algorithm optimizing k-nearest neighbors compared to regression algorithms and evaluated on real world data sources |
| topic | Machine Learning Combinatorics Computation 68Q25, 68W40, 68W05, 68W32, 68W25, 03D15, 03F52, 12D05, 03H15, 12E05 I.1.1; I.1.2; I.5.1; I.5.2; I.5.4; I.6.5; G.1.3; G.1.6; F.2.1; F.2.2 |
| url | https://arxiv.org/abs/2602.08577 |