Associative memories (AMs) have been extensively used during the last 40 years for pattern classification and pattern restoration. A new type of AMs have been developed recently, the so-called Geometric Associative Memories (GAMs), these make use of Conformal Geometric Algebra (CGA) operators and operations for their working. GAM's, at the beginning, were developed for supervised classification, getting good results. In this work an algorithm for unsupervised learning with GAMs will be introduced. This new idea is a variation of the k-means algorithm that takes into account the patterns of the a specific cluster and the patterns of another clusters to generate a separation surface. Numerical examples are presented to show the functioning of the new algorithm. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Cruz, B., Barrón, R., & Sossa, H. (2009). A new unsupervised learning for clustering using geometric associative memories. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5856 LNCS, pp. 239–246). https://doi.org/10.1007/978-3-642-10268-4_28
Mendeley helps you to discover research relevant for your work.