An optimal strategy for sequential classification on partially ordered sets
A decision-theoretic framework is described for sequential classification when the parameter space is a finite partially ordered set. An example of an optimal strategy is then presented. This example establishes that an asymptotically optimal class of experiment selection rules is not necessarily optimal in the given decision-theoretic setting.
Volume (Year): 68 (2004)
Issue (Month): 2 (June)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Curtis Tatsuoka & Thomas Ferguson, 2003. "Sequential classification on partially ordered sets," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 65(1), pages 143-157.
- Curtis Tatsuoka, 2002. "Data analytic methods for latent partially ordered classification models," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 51(3), pages 337-350.
When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:68:y:2004:i:2:p:161-168. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.