OPAL: A new algorithm for optimal partitioning and learning in non parametric unsupervised environments

B. V. Sheela1, Belur V. Dasarathy2
1ISRO Satellite Center, Bangalore, India
2M & S Computing, Inc., Huntsville

Tóm tắt

Từ khóa


Tài liệu tham khảo

R. L. Kashyap, ?Algorithms for Pattern Classification,? inAdaptive Learning and Pattern Recognition Systems, Fu and Mendel, Eds. (Academic Press, New York, 1970), pp. 81?112.

Y. C. Ho and R. L. Kashyap, ?A class of iterative procedures for linear inequalities,? ?SIAMJ. Control 4:112?115 (1966).

R. E. Warmack and R. C. Gonzalez, ?An algorithm for the optimal solution of linear inequalities and its application to pattern recognition,?IEEE Trans. Comput. C-22:1065?1075 (December 1973).

G. Nagaraja and G. Krishna, ?An algorithm for the solution of linear inequalities,?IEEE Trans. Comput. C-23:421?427 (April 1974).

B. V. Dasarathy, ?DHARMA:Discriminant hyperplane abstracting residuals minimization algorithm for separating clusters with fuzzy boundaries,?Proc. IEEE 64:823?824 (May 1976).

D. W. Peterson and R. L. Mattson, ?A method for finding linear discriminant functions for a class of performance criteria,?IEEE Trans. Inf. Theory IT-12(3):380?387 (July 1966).

K. Fukunaga and W. L. G. Koontz, ?A criterion and an algorithm for grouping data,?IEEE Trans. Comput. C-19(10):917?923 (October 1970).

M. R. Anderberg,Cluster Analysis for Application (Academic Press, New York, 1973).

J. B. MacQueen, ?Some Methods for Classification and Analysis of Multivariate Observations,?Proceedings of the Fifth Symposium on Mathematical Statistics and Probability (University of California Press, Berkeley, 1967), pp. 281?197.

D. J. McRae, ?MIKCA: A Fortran IV iterativeK means cluster analysis program,?Behav. Sci. 16(4):423?426 (1971).

E. W. Forgy, ?Cluster analysis of multivariate data: Efficiency vs interpretability of classifications,? Paper presented at Biometric Society Meetings, Riverside, California; abstracted inBiometrics 21(3):768 (1965).

M. M. Astrahan, ?Speech Analysis by Clustering or the Hyperphone Method,? Stanford Artificial Intelligence Project Memo AIM-124, AD 70967, Stanford, California.

J. J. Freeman, ?Experiments in discrimination and classification,?Pattern Recognition 1:207?218 (1969).

R. G. Casey and G. Nagy, ?An autonomous reading machine,?IEEE Trans. Comput. C-17:492?503 (May 1968).

W. D. Fisher, ?On grouping for maximum homogenity,?Am. Stat. Assoc. J. 53:789?798 (1958).

P. Ramamoorthy and B. V. Sheela, ?Modification of the Flexible Polyhedron Method for Function Minimization,? National Aeronautical Laboratory, NAL AE-TM-4-73, Bangalore, India (1973).

B. V. Sheela, ?Development of Optimization Techniques and Their Application to Aeronautical Problems,? Ph.D thesis, Bangalore University, Bangalore, India (December 1976).

J. A. Neider and R. Mead, ?A simplex method for function minimization,?Comput. J. 7:308?313 (1965).

B. V. Dasarathy, ?A new clustering approach for pattern recognition in unsupervised environments,?J. Indian Inst. Sci. 56(5):202?208 (May 1974).

B. V. Dasarathy, ?HINDU: Histogram Inspired Neighborhood Discerning Unsupervised Pattern Recognition System,?Proceedings of the Symposium on Machine Processing of Remotely Sensed Data, Purdue University (June 1975), pp. 2A?43. (Detailed report available from author on request).