A new unsupervised learning for clustering using geometric associative memories

Benjamín Cruz, Ricardo Barrón, Humberto Sossa

Producción científica: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

3 Citas (Scopus)

Resumen

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.

Idioma originalInglés
Título de la publicación alojadaProgress in Pattern Recognition, Image Analysis, Computer Vision and Applications - 14th Iberoamerican Conference on Pattern Recognition, CIARP 2009, Proceedings
Páginas239-246
Número de páginas8
DOI
EstadoPublicada - 2009
Evento14th Iberoamerican Conference on Pattern Recognition, CIARP 2009 - Guadalajara, Jalisco, México
Duración: 15 nov. 200918 nov. 2009

Serie de la publicación

NombreLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumen5856 LNCS
ISSN (versión impresa)0302-9743
ISSN (versión digital)1611-3349

Conferencia

Conferencia14th Iberoamerican Conference on Pattern Recognition, CIARP 2009
País/TerritorioMéxico
CiudadGuadalajara, Jalisco
Período15/11/0918/11/09

Huella

Profundice en los temas de investigación de 'A new unsupervised learning for clustering using geometric associative memories'. En conjunto forman una huella única.

Citar esto