Flexible Pattern Recognition

dc.contributor.authorUhr, Leonarden_US
dc.date.accessioned2012-03-15T16:17:32Z
dc.date.available2012-03-15T16:17:32Z
dc.date.created1969en_US
dc.date.issued1969en
dc.description.abstractThis paper presents and describes a sequence of three computer programs that examine what "flexibility" might mean in the context of pattern recognition. Flexibility is a vague, but important, concept, and it is something that artificial intelligence programs have been accused of being without. Various possible meanings of the concept are discussed and programmed. Essentially, flexibility is taken to point to a rich set of methds, which are decided upon and changed, as appropriate. In pattern recognition, this means making a sequence of parallel characterizations, where the program decides, as a function of what it has learned so far about the pattern instance it is trying to recognize, what might be there, and what characterizers should therefore be applied next, and where.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.citationTR56en
dc.identifier.urihttp://digital.library.wisc.edu/1793/57560
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleFlexible Pattern Recognitionen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TR56.pdf
Size:
1.94 MB
Format:
Adobe Portable Document Format