Skip to Main Content
Sequential decision algorithms with on-line feature ordering and a limited look-ahead approximation are considered. The algorithms can be used with or without contextual constraints for multicategory pattern recognition problems. Computational complexity due to on-line ordering of features is analyzed and related to system performance. Computer simulated results are obtained using a standard data set (Munson's multiauthor handprinted character files) and a careful test procedure.