首页> 外文期刊>Computational statistics & data analysis >Convergence of random k-nearest-neighbour imputation
【24h】

Convergence of random k-nearest-neighbour imputation

机译:随机k最近邻插补的收敛性

获取原文
获取原文并翻译 | 示例
           

摘要

Random k-nearest-neighbour (RKNN) imputation is an established algorithm for filling in missing values in data sets. Assume that data are missing in a random way, so that missingness is independent of unobserved values (MAR), and assume there is a minimum positive probability of a response vector being complete. Then RKNN, with k equal to the square root of the sample size, asymptotically produces independent values with the correct probability distribution for the ones that are missing. An experiment illustrates two different distance functions for a synthetic data set.
机译:随机k近邻(RKNN)插补是一种用于填充数据集中缺失值的既定算法。假设数据以随机方式丢失,则丢失与观察值(MAR)无关,并假定响应向量完成的最小正概率。然后,RKNN的k等于样本大小的平方根,渐近产生独立的值,对于丢失的值具有正确的概率分布。实验说明了合成数据集的两个不同的距离函数。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号