Model-based inference for k-nearest neighbours predictions using a canonical vine copula

被引:4
|
作者
Ene, Liviu Theodor [1 ]
Naesset, Erik [1 ]
Gobakken, Terje [1 ]
机构
[1] Norwegian Univ Life Sci, Dept Ecol & Nat Resource Management, NO-1432 As, Norway
关键词
copulas; k-NN imputations; variance estimation; NATIONAL FOREST INVENTORY; REMOTELY-SENSED DATA; VARIANCE-ESTIMATION; SATELLITE IMAGERY; FIELD PLOTS; VARIABLES; VOLUME; AREA; SIMULATION; REGRESSION;
D O I
10.1080/02827581.2012.723743
中图分类号
S7 [林业];
学科分类号
0829 ; 0907 ;
摘要
The k-near neighbours (k-NN) technique combines field data from forest inventories and auxiliary information for forest resource estimation at various geographical scales. In this study, auxiliary data consisting of Landsat 5 TM satellite imagery and terrain elevations were used to perform k-NN imputations of plot-level above ground biomass. Following the model-based inference, a superpopulation model consisting of a canonical vine copula was constructed from the empirical data, and new samples were generated from the model and used for k-NN predictions. The method used herein allows constructing the sampling distribution for the imputation errors and for assessing the statistical properties of the k-NN estimator. Using a data-splitting procedure, the copula-based approach was assessed against pair-bootstrap resampling. The imputations were performed using k (the number of neighbours) = 1 and by using optimal k values selected according to a bias-minimizing criterion. The empirical coverage probabilities of the confidence intervals constructed using the copula-based approach were closer to the nominal coverages. The improvements were due to significant bias reduction, while the standard errors were higher compared to the bootstrap. Still, the root mean squared error was significantly reduced. The best results were obtained using the copula approach and k-NN imputations with k=1.
引用
收藏
页码:266 / 281
页数:16
相关论文
共 50 条
  • [1] Extended k-nearest neighbours based on evidence theory
    Wang, H
    Bell, D
    COMPUTER JOURNAL, 2004, 47 (06): : 662 - 672
  • [2] A K-nearest neighbours method based on imprecise probabilities
    Destercke, Sebastien
    SOFT COMPUTING, 2012, 16 (05) : 833 - 844
  • [3] A K-nearest neighbours method based on imprecise probabilities
    Sebastien Destercke
    Soft Computing, 2012, 16 : 833 - 844
  • [4] Computing Expectiles Using k-Nearest Neighbours Approach
    Farooq, Muhammad
    Sarfraz, Sehrish
    Chesneau, Christophe
    Ul Hassan, Mahmood
    Raza, Muhammad Ali
    Sherwani, Rehan Ahmad Khan
    Jamal, Farrukh
    SYMMETRY-BASEL, 2021, 13 (04):
  • [5] An Occupancy Mapping Method Based on K-Nearest Neighbours
    Miao, Yu
    Hunter, Alan
    Georgilas, Ioannis
    SENSORS, 2022, 22 (01)
  • [6] A k-Nearest Neighbours Based Ensemble via Optimal Model Selection for Regression
    Ali, Amjad
    Hamraz, Muhammad
    Kumam, Poom
    Khan, Dost Muhammad
    Khalil, Umair
    Sulaiman, Muhammad
    Khan, Zardad
    IEEE ACCESS, 2020, 8 (08): : 132095 - 132105
  • [7] Ransomware Detection Based on Opcode Behaviour Using K-Nearest Neighbours Algorithm
    Stiawan, Deris
    Daely, Somame Morianus
    Heryanto, Ahmad
    Afifah, Nurul
    Idris, Mohd Yazid
    Budiarto, Rahmat
    INFORMATION TECHNOLOGY AND CONTROL, 2021, 50 (03): : 495 - 506
  • [8] Defining a novel k-nearest neighbours approach to assess the applicability domain of a QSAR model for reliable predictions
    Faizan Sahigara
    Davide Ballabio
    Roberto Todeschini
    Viviana Consonni
    Journal of Cheminformatics, 5
  • [9] Defining a novel k-nearest neighbours approach to assess the applicability domain of a QSAR model for reliable predictions
    Sahigara, Faizan
    Ballabio, Davide
    Todeschini, Roberto
    Consonni, Viviana
    JOURNAL OF CHEMINFORMATICS, 2013, 5
  • [10] Enhancing EV charging predictions: a comprehensive analysis using K-nearest neighbours and ensemble stack generalization
    Kumar, B. Anil
    Jyothi, B.
    Singh, Arvind R.
    Bajaj, Mohit
    MULTISCALE AND MULTIDISCIPLINARY MODELING EXPERIMENTS AND DESIGN, 2024, 7 (04) : 4011 - 4037