Rdocumentation
powered by
Learn R Programming
edesign (version 1.0-13)
Maximum Entropy Sampling
Description
An implementation of maximum entropy sampling for spatial data is provided. An exact branch-and-bound algorithm as well as greedy and dual greedy heuristics are included.
Copy Link
Link to current version
Version
Version
1.0-13
1.0-12
1.0-11
1.0-10
1.0-9
1.0-7
Install
install.packages('edesign')
Monthly Downloads
73
Version
1.0-13
License
GPL (>= 2.0)
Maintainer
Claudia Gebhardt
Last Published
September 4th, 2015
Functions in edesign (1.0-13)
Search all functions
interchange
Interchange algorithm for maximum entropy sampling
monet.selected
extract the selected station indices from a
monet
object
print.monet
Print a monet (monitoring network) object
makematrix
Covariance matrix
edesign-internal
Internal functions of library edsign
monet
Monet (Monitoring Network) object
greedy
Greedy algorithm for maximum entropy sampling
maxentropy
Maximum entropy sampling
dualgreedy
Dual-greedy algorithm for maximum entropy sampling