Empirical Likelihood Ratio Based K-Nearest Neighbours Regression

Regression models play a pivotal role in real-life applications by enabling the analysis and prediction of continuous outcomes. Among these, the k-Nearest Neighbours (KNN) model stands out as a significant advancement in machine learning. KNN's ability to make predictions based on the proximity of data points has found wide-ranging applications in various fields. However, the traditional KNN regression model has its limitations, including sensitivity to noise and an uneven distribution of neighbours. In response, this paper introduces a novel approach: an empirical likelihood ratio (ELR) based regression algorithm. The ELR technique offers distinct advantages over distance-based nearest neighbour computations, particularly in handling skewed data distributions and minimizing the impact of outliers. The proposed ELRbased KNN regression model is rigorously assessed through both simulation studies and real-life scenarios. The results explicitly demonstrate the enhanced performance of the ELR-based approach over the conventional KNN model. This research contributes to a deeper understanding of regression techniques and underscores the practical significance of leveraging empirical likelihood ratios in refining predictive models for real-world applications.. KEYWORDS :Regression model, k-Nearest neighbours, Empirical likelihood ratio, Distance measures, Data distributions.

Authors

Publication Details

Journal
International Journal of Agricultural and Statistical Sciences
Published
2024-12-01
DOI
https://doi.org/10.59467/ijass.2024.20.421
Primary Topic
Face and Expression Recognition
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Empirical Likelihood Ratio Based K-Nearest Neighbours Regression

Satyanarayana Satyanarayana, R. Sukshitha
International Journal of Agricultural and Statistical Sciences
Face and Expression Recognition
article

Empirical Likelihood Ratio Based K-Nearest Neighbours Regression

Satyanarayana Satyanarayana, R. Sukshitha
article en

Abstract

Regression models play a pivotal role in real-life applications by enabling the analysis and prediction of continuous outcomes. Among these, the k-Nearest Neighbours (KNN) model stands out as a significant advancement in machine learning. KNN's ability to make predictions based on the proximity of data points has found wide-ranging applications in various fields. However, the traditional KNN regression model has its limitations, including sensitivity to noise and an uneven distribution of neighbours. In response, this paper introduces a novel approach: an empirical likelihood ratio (ELR) based regression algorithm. The ELR technique offers distinct advantages over distance-based nearest neighbour computations, particularly in handling skewed data distributions and minimizing the impact of outliers. The proposed ELRbased KNN regression model is rigorously assessed through both simulation studies and real-life scenarios. The results explicitly demonstrate the enhanced performance of the ELR-based approach over the conventional KNN model. This research contributes to a deeper understanding of regression techniques and underscores the practical significance of leveraging empirical likelihood ratios in refining predictive models for real-world applications.. KEYWORDS :Regression model, k-Nearest neighbours, Empirical likelihood ratio, Distance measures, Data distributions.

International Journal of Agricultural and Statistical SciencesVol. 20(02)
Openalex Percentile: Top 78%
Face and Expression Recognition
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.