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

DOI10.1007/BF00977790zbMath0414.68058OpenAlexW2019708817MaRDI QIDQ3049838

B. V. Sheela, B. V. Dasarathy

Publication date: 1979

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00977790

zbMATH Keywords

clusteringunsupervised learningoptimal partitioningnonlinear programming approach to pattern classification

Mathematics Subject Classification ID

Nonlinear programming (90C30) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Algorithm for the Optimal Solution of Linear Inequalities and its Application to Pattern Recognition
• An Algorithm for the Solution of Linear Inequalities
• A Class of Iterative Procedures for Linear Inequalities
• A method of finding linear discriminant functions for a class of performance criteria
• A Criterion and an Algorithm for Grouping Data
• A Simplex Method for Function Minimization

This page was built for publication: OPAL: A new algorithm for optimal partitioning and learning in non parametric unsupervised environments