An algorithm to identify the appropriate size of a neighbourhood when analysing spatially distributed field experiments by local cokriging.
K. Shuvo BakarHuidong JinBrent HendersonRobert G. V. BramleyDavid L. GobbettChristina E. M. RatcliffPublished in: Comput. Electron. Agric. (2021)
Keyphrases
- computational complexity
- learning algorithm
- spatially distributed
- space complexity
- search space
- selection algorithm
- matching algorithm
- detection algorithm
- image processing
- scales linearly
- single pass
- improved algorithm
- memory requirements
- theoretical analysis
- computationally efficient
- linear programming
- preprocessing
- evolutionary algorithm
- experimental evaluation
- dynamic programming
- times faster
- worst case time complexity
- k means
- multi objective
- np hard
- optimization algorithm
- probabilistic model
- computational cost
- lower bound
- expectation maximization
- video sequences
- similarity measure
- input data