CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 1981 vol.3 Issue No.04 - April
ANDAL: A Nonparametric Discrimination And Learning Algorithm for Recognition in Imperfectly Supervised Environments
Issue No.04 - April (1981 vol.3)
Belur V. Sheela , ISRO Satellite Center, Bangalore, India.
Belur V. Dasarathy , Intergraph Corporation, Huntsville, AL 35805.
The problem of recognition in nonparametric environments under imperfect supervision is not amenable to solution through classical statistical approaches based on identification of finite mixtures, which require an a priori knowledge of the probabilistic descriptions of the classes. Accordingly, the problem is viewed in this study as one of optimal linear/nonlinear partitioning of the imperfectly labeled training sample set. This optimal partitioning is accomplished by defining an appropriate optimality criterion, which takes into account the imperfectness of supervision, and solving the resultant optimization problem through the Improved Flexible Polyhedron Method (IFPM). Possible alternatives to compensate for the inherent bias in this criterion towards equipopulation clusters are developed and evaluated using an illustrative example. Details of the methodology involved in implementing the approach are presented. Results of simulation experiments, which confirm the validity and effectiveness of this new technique in accomplishing optimal, linear/nonlinear discriminant learning in imperfectly supervised, nonparametric environments, are included.
Belur V. Sheela, Belur V. Dasarathy, "ANDAL: A Nonparametric Discrimination And Learning Algorithm for Recognition in Imperfectly Supervised Environments", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.3, no. 4, pp. 469-476, April 1981, doi:10.1109/TPAMI.1981.4767132