Bayesian Kernel and Mutual $k$-Nearest Neighbor Regression

2016-08-04 · Hyun-Chul Kim

We propose Bayesian extensions of two nonparametric regression methods which are kernel and mutual $k$-nearest neighbor regression methods. Derived based on Gaussian process models for regression, the extensions provide distributions for target value estimates and the framework to select the hyperparameters. It is shown that both the proposed methods asymptotically converge to kernel and mutual $k$-nearest neighbor regression methods, respectively. The simulation results show that the proposed methods can select proper hyperparameters and are better than or comparable to the former methods for an artificial data set and a real world data set.

📄 PDF Abstract BibTeX arXiv:1608.01410

Code (0)

등록된 구현이 없습니다.

Tasks

regression

Bayesian Model Selection Methods for Mutual and Symmetric $k$-Nearest Neighbor Classification

2016-08-14 · Hyun-Chul Kim

The $k$-nearest neighbor classification method ($k$-NNC) is one of the simplest nonparametric classification methods. The mutual $k$-NN classification method (M$k$NNC) is a variant of $k$-NNC based on mutual neighborship…

Classification General Classification Model Selection regression

Nearest Neighbor Dirichlet Mixtures

2020-03-17 · Shounak Chattopadhyay, Antik Chakraborty, David B. Dunson

There is a rich literature on Bayesian methods for density estimation, which characterize the unknown density as a mixture of kernels. Such methods have advantages in terms of providing uncertainty quantification in esti…

Density Estimation Uncertainty Quantification

Explaining the Success of Nearest Neighbor Methods in Prediction

2025-02-21 · George H. Chen, Devavrat Shah

Many modern methods for prediction leverage nearest neighbor search to find past training examples most similar to a test example, an idea that dates back in text to at least the 11th century and has stood the test of ti…

Prediction regression Time Series Forecasting

Locality-Sensitive Hashing for f-Divergences: Mutual Information Loss and Beyond

2019-10-28 · NeurIPS 2019 12 · Lin Chen, Hossein Esfandiari, Thomas Fu, Vahab S. Mirrokni

Computing approximate nearest neighbors in high dimensional spaces is a central problem in large-scale data mining with a wide range of applications in machine learning and data science. A popular and effective technique…

Model Compression

Breaking the Bandwidth Barrier: Geometrical Adaptive Entropy Estimation

2016-09-07 · NeurIPS 2016 12 · Weihao Gao, Sewoong Oh, Pramod Viswanath

Estimators of information theoretic measures such as entropy and mutual information are a basic workhorse for many downstream applications in modern data science. State of the art approaches have been either geometric (n…