6 D Classi cation of Pattern Matching Problems 1
نویسندگان
چکیده
We present our uni ed view to pattern matching problems and their solutions. We classify pattern matching problems by using six criteria and therefore we can locate them into six-dimensional space. We also show basic model of nondeterministic nite automaton that can be used for constructing models for all pattern matching problems.
منابع مشابه
On the proper treatment of context in NL
The proper treatment of quanti cation in Natural Language proposed by Richard Montague some thirty years ago does not do proper justice to the fact that interpretation of texts both uses context and sets up new contexts. The dynamic turn in NL semantics is the attempt to model this basic fact, but the use of dynamically quanti ed variables introduces an undesirable element into this attempt. By...
متن کاملTemplate-based online character recognition
Handwriting is a common, natural form of communication for humans, and therefore it is useful to utilize this modality as a means of input to machines. One well-known method of classifying individual characters or words is template matching. We demonstrate a template-based system for online character recognition where the number of representative templates is determined automatically. These tem...
متن کاملMultiple Attribute Learning with Canonical Correlation Analysis and Em Algorithm
This paper presents a new framework of learning pattern recognition, called \multiple attribute learning". In usual setting of pattern recognition, target patterns have several attribute such as color, size, shape, and we can classify the patterns in several ways by their color, by their size, or by their shape. in normal pattern recognition problem, an attribute or a mode of classi cation is c...
متن کاملReal-time constrained linear discriminant analysis to target detection and classification in hyperspectral imagery
In this paper, we present a constrained linear discriminant analysis (CLDA) approach to hyperspectral image detection and classi cation as well as its real-time implementation. The basic idea of CLDA is to design an optimal transformation matrix which can maximize the ratio of inter-class distance to intra-class distance while imposing the constraint that di2erent class centers after transforma...
متن کاملComparison of algorithms that select features for pattern classi"ers
A comparative study of algorithms for large-scale feature selection (where the number of features is over 50) is carried out. In the study, the goodness of a feature subset is measured by leave-one-out correct-classi"cation rate of a nearestneighbor (1-NN) classi"er and many practical problems are used. A uni"ed way is given to compare algorithms having dissimilar objectives. Based on the resul...
متن کامل