Comparing search and estimation performances of designs based on a compound criterion

Since the introduction of the search design by Srivastava [Designs for searching non-negligible effects. In: Srivastava, editor. A survey of statistical design and linear models. Amsterdam: North-Holland, Elsevier; 1975. p. 507–519], construction of such designs has been considered by many researchers. The efficient performances of constructed search designs in terms of parameter estimation and search ability of parameters have also been investigated by several authors. They have proposed suitable optimality measures such as DD- and AD-optimality for estimation in the early stage of search design construction. Moreover, since 1990s, some criteria have been developed to evaluate search performance of a design. Although these criteria are useful none of them is able to evaluate both estimation and search efficiency of a design simultaneously. In this paper, we propose dual-task criteria to deal with searching and estimating performances of search designs. These compound criteria are weighted multiplication of estimation and search suitable criteria. They will be used for design comparison and the results will be presented.     

Weighted Searching Probability for Classes of Equivalent Search Designs Comparison

Search design is searching and estimating for a few non zero effects in a large set of effects along with estimation of elements in a set of unknown parameters. In presence of noise, the probability of discrimination between the true non zero effect from an alternative one depends on the design and an unknown parameter, say ρ. We develop a new criterion for design comparison which is independent of ρ and for a family density weight function show that it discriminates and ranks the designs precisely. This criterion is invariance to the variable noise which may be present between designs due to noise factors. This allows us to extend the design comparison to classes of equivalent designs.     

Using orthogonal array for constructing three-level search designs

We consider the problem of constructing search designs for 3^m factorial designs. By using projection properties of some three-level orthogonal arrays, some search designs are obtained for 3 ? m ? 11. The new obtained orthogonal search designs are capable of searching and identifying up to four two-factor interactions and estimating them along with the general mean and main effects. The resulted designs have very high searching probabilities; it means that besides the well-known orthogonal structure, they have high ability in searching the true effects.