#' Loftsgaarden-Quesenberry kth nearest neighbor bandwidths
#'
#' \code{bw_balloon_LQ} looks for the bandwidth following the
#' Loftsgaarden-Quesenberry algorithm. The bandwidth depends on the point of
#' estimation.
#'
#' These are the details of the function.
#'
#' @param tdat a vector containing the training dataset.
#' @param k specifying the order of the neighbor.
#' @return a vector of bandwidths (one bandwidth per evaluation data point)
#' @examples
#' bw_sampleSmoothing(tdat = 1:10,k = 3)
#' bw_sampleSmoothing(tdat = (1:10)^2,k = 3)
#' @export
bw_sampleSmoothing = function(tdat,k){
# if tdat is vector change to array
tdat <- vectToArray(tdat)
# sanity checks
# check that k is smaller than the number of training data points
if(k >= dim(tdat)[2]){
stop(paste0('k should be strictly lower than the length of the training dataset.',
'\nHere k=',k,' and length(tdat)=',dim(tdat)[2],'.'))
}
h = sample_dist_to_knn(sampleDat = tdat,k)
return(h)
}
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.