Abstract
The problem of feature selection in a totally unsupervised, distribution free environment being conceptually ill-defined, the problem has been studied in an artifically evolved pseudosupervised environment. The evolution of such an environment is achieved by formulating a unified approach to the twin problems of feature selection and unsupervised learning. The solution of the latter problem leads to the pseudosupervised environment in which the features are evaluated by employing a multistate-choice automaton model as the feature selector. The methodology developed here is intended to be deployed in conjunction with any one of the numerous recursive schemes of clustering in which the crudely formed initial clusters are refined in a recursive fashion by successively determining the centroids of the different clusters and reallocating the samples to the clusters defined by these centroids. This allocation is carried out on the basis of distance measures (Euclidean or modifications thereof) and is in parallel progress with the feature-evaluation process. The clusters, as formulated at each stage of the recursive process, provide the pseudosupervised environment for the feature selector. The track record of the automaton in terms of probabilities of penalized action provides a measure of the efficiency of the different feature subsets in the unsupervised environment.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
K. Fukunaga,Introduction to Statistical Pattern Recognition (Academic Press, New York, 1972).
IEEE Trans. Comput., “Special Issue on Feature Extraction and Selection in Pattern Recognition,” C-20:965 (1971).
B. V. Dasarathy, “An integrated nonparametric sequential approach to multiclass pattern classification,Int. J. Syst. Sci. 4:449 (1973).
C. Babu, “On the application of divergence for the extraction of features from imperfectly labeled patterns,”IEEE Trans. Syst. Man Cybern. SMC-2:290 (1972).
A. L. LakshminarasimhanAnd B. V. Dasarathy, “A unified approach to feature selection and learning in unsupervised environment,”IEEE Trans. Comput,C-24:948 (1975).
A. K. Agrawala, “Learning with a probabilistic teacher,”IEEE Trans. Inf. Theory IT-16:373 (1970).
K. Shanmugam, “A parametric procedure for learning with an imperfect teacher,”IEEE Trans. Inf. Theory IT-18:300 (1972).
B. V. Dasarathy and A. L. Lakshminarasimhan, “Sequential learning employing unfamiliar teacher hypothesis (SLEUTH) with concurrent estimation of both the parameters and teacher characteristics,”Int. J. Comput. Inf. Sci. 5:1 (1976).
G. H. Ball and D. J. Hall, “ISODATA, An Iterative Method of Multivariate Analysis and Pattern Classification,”International Communication Conference, Philadelphia (1966).
B. V. Dasarathy, “An innovative clustering technique for unsupervised learning in the context of remotely sensed earth resources data analysis,”Int. J. Syst. Sci. 6:23 (1975).
A. L. Lakshminarasimhan and B. V. Dasarathy, “Multi-state-choice automata model for expedient learning in random environment,”Inf. Sci. 9:91 (1975).
K. S. Fu and T. J. Li, “Formulation of learning automata and automata games,”Inf. Sci. 1:237 (1969).
K. S. Fu, P. E. J. Min, and T. J. Li, “Feature selection in pattern recognition,”IEEE Trans. Syst. Sci. Cybern. SSC-6:33 (1970).
K. S. Fu, D. A. Landgrebe, and T. L. Phillips,“Information processing of remotely sensed agricultural data,”Proc. IEEE 57:639 (1969).
Author information
Authors and Affiliations
Additional information
An earlier version of this paper was presented at the Fifth Annual Symposium on Automatic Imagery Pattern Recognition, University of Maryland, College Park, Maryland, April 1975.
Rights and permissions
About this article
Cite this article
Dasarathy, B.V. FEAST: Feature evaluation and selection technique for deployment in unsupervised nonparametric environments. International Journal of Computer and Information Sciences 6, 307–315 (1977). https://doi.org/10.1007/BF00998324
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00998324