Recognition tasks are imitation games

2Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

There is need for more formal specification of recognition tasks. Currently, it is common to use labeled training samples to illustrate the task to be performed. The mathematical theory of games may provide more formal and complete definitions for recognition tasks. We present an imitation game that describes a wide variety of recognition tasks, including the classification of isolated patterns and structural analysis. In each round of the game, a set of 'players' try to match the interpretation of an input produced by a set of 'experts.' The 'playing field' on which experts and players operate is a set of interpretations generated from legal sequences of 'moves' for a round. The expert and player moves transform interpretations, and select interpretations for output. The distance between interpretations in the playing field is defined by a distance metric for interpretations, and the game outcome by a ranking function on distance values observed for players' interpretations. We demonstrate how this imitation game may be used to define and compare recognition tasks, and clarify the evaluation of proposed solutions. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Zanibbi, R., Blostein, D., & Cordy, J. R. (2005). Recognition tasks are imitation games. In Lecture Notes in Computer Science (Vol. 3686, pp. 209–218). Springer Verlag. https://doi.org/10.1007/11551188_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free