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

Version

Install

install.packages('edesign')

Monthly Downloads

61

Version

1.0-13

License

GPL (>= 2.0)

Last Published

September 4th, 2015

Functions in edesign (1.0-13)

interchange

Interchange algorithm for maximum entropy sampling
monet.selected

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