Pattern classification in dynamical environments
This paper presents a statistic pattern recognition and machine learning based classification system paradigm. It focuses on solving problems underlying environments where the attributes of the system exhibit strong uncertainties. Configurations of classifiers therefore have to undergo continual changes during the running process. The classifier discussed here is characterized by a tagged feature-class representation, a dimension-wise univariate discrimination scheme, a default hierarchy of classification, as well as a logic-based learning strategy. Concepts of distinguishability and univariately distinguishable classes under classification are studied. Procedures developed for forming an univariately distinguishable class-feature space by learning are described.
Key words and PhrasesTagged feature-class space Distinguishability Univariately distinguishable Univariate sequential classifier Logic-based learning Goal-directed induction
Unable to display preview. Download preview PDF.
- Frey, P.W, "A Bit-Mapped Classifier", BYTE, November 1986, pp.161–172Google Scholar
- Duda, R. O, and Hart, P. E, "Pattern Classification and Scene Analysis", John Wiley & Sons, 1973Google Scholar
- Fukunaga, K., "Introduction to Statistical Pattern Recognition", Academic Press, 1972Google Scholar
- Fu, K. S., "Sequential Methods in Pattern Recognition and Machine Learning", Academic Press, New York, 1968Google Scholar
- Holland, J.H., "Escaping Brittleness: The Possibilities of General-purpose Learning Algorithms Applied to Parallel Rule-Based Systems", "Machine Learning II" Morgan Kaufmann Publishers, Los Altos, Ca, 1986, pp.593–623Google Scholar
- Thathachar, M.A.L, and P.S. Sastry, "Learning Optimal Discriminant Functions Through a Cooperative Game of Automata", IEEE Transactions on Systems, Man, and Cybernetics, Vol. SMC-17, No. 1, January/February 1987, pp.73–85Google Scholar