An optimal strategy for sequential classification on partially ordered sets
AbstractA 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Statistics & Probability Letters.
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
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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.