期刊论文

An Adaptive IDW Algorithm Involving Spatial Heterogeneity

中文

武汉大学学报(信息科学版)

1671-8860

2020

45

01

97-104

10.13203/j.whugis20180213

国家社会科学重大项目

本校为其他机构

传统的反距离加权(inverse distance weighted,IDW)插值法存在以假设空间过程平稳为前提,且插值过程需要用户提供初始化参数如分区数目、参考样点个数等的问题,因此提出一种顾及空间异质性的自适应IDW插值算法。该算法首先根据样点待插值属性数据的数理统计特征自适应设定分类阈值,将全部样点按照属性值大小分成高、中、低三类,其次利用机器学习算法k近邻法(k-nearest neighbor,k-NN)判定待插值点所属类别,然后根据分类结果自适应为待插值点一阶邻近样点,并设置相应的权重调和因子,最后构造出一个集空间相关与空间异质性于一体的IDW插值算法模型。实验结果表明,顾及空间异质性算法无需用户提供任...

An adaptive inverse distance weighted(IDW) algorithm involving spatial heterogeneity to solve some problems existed in the classical IDW is proposed.The first problem is that classical IDW algorithms are heavily dependent on the spatial stability. Another one is that the initial parameters are determined by the users empirically, such as the number of stratums or sample points. The k-nearest neighbor IDW (kAIDW) algorithm can take both spatial correlation and heterogeneity into account simultaneously without the needs of parameters input for users. Firstly, kAIDW sets the classification thresh...