2011
DOI: 10.1016/j.csda.2011.05.020
|View full text |Cite
|
Sign up to set email alerts
|

Some variants of adaptive sampling procedures and their applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 31 publications
0
1
0
Order By: Relevance
“…Thus, adaptive spatial sampling provides a viable solution to the longstanding problem of estimating the abundance of rare populations and it has gained rapid acceptance in the natural and social sciences (Seber, 1986;Ramsey and Seber, 1992;Brown, 1994Brown, , 1996Khan and Muttlak, 2002;Stein and Ettema, 2003;Sengupta and Sengupta, 2011;Jain and Chang, 2004;Thompson, 2011;Yu et al, 2012). However, adaptive procedures are more complicated to design and analyze, and computational implementations are few as a results of the complexity of the algorithms for spatial analysis (Thompson, 2011). This implementation requires at least three steps: the development of a computational design for a regular grid; the selection of specific areas of the grid to identify which part of the grid the data are in; and identifying the neighbors of the selected areas: upper, lower, right and left.…”
Section: Introductionmentioning
confidence: 99%
“…Thus, adaptive spatial sampling provides a viable solution to the longstanding problem of estimating the abundance of rare populations and it has gained rapid acceptance in the natural and social sciences (Seber, 1986;Ramsey and Seber, 1992;Brown, 1994Brown, , 1996Khan and Muttlak, 2002;Stein and Ettema, 2003;Sengupta and Sengupta, 2011;Jain and Chang, 2004;Thompson, 2011;Yu et al, 2012). However, adaptive procedures are more complicated to design and analyze, and computational implementations are few as a results of the complexity of the algorithms for spatial analysis (Thompson, 2011). This implementation requires at least three steps: the development of a computational design for a regular grid; the selection of specific areas of the grid to identify which part of the grid the data are in; and identifying the neighbors of the selected areas: upper, lower, right and left.…”
Section: Introductionmentioning
confidence: 99%