DocumentCode :
2651061
Title :
Adaptive Batch SOM for Multiple Dissimilarity Data Tables
Author :
Dantas, Anderson B dos S ; de A T de Carvalho, Francisco
Author_Institution :
Center of Inf., Fed. Univ. of Pernambuco, Recife, Brazil
fYear :
2011
fDate :
7-9 Nov. 2011
Firstpage :
575
Lastpage :
578
Abstract :
This paper introduces a clustering algorithm based on batch Self-Organizing Maps to partition objects taking into account their relational descriptions given by multiple dissimilarity matrices. The presented approach provides a partition of the objects and a prototype for each cluster, moreover the method is able to learn relevance weights for each dissimilarity matrix by optimizing an adequacy criterion that measures the fit between clusters and the respective prototypes. These relevance weights change at each iteration and are different from one cluster to another.
Keywords :
iterative methods; learning (artificial intelligence); matrix algebra; optimisation; pattern clustering; self-organising feature maps; adaptive batch SOM; adequacy criterion optimisation; batch self-organizing map; clustering algorithm; multiple dissimilarity data tables; multiple dissimilarity matrices; partition objects; relational descriptions; relevance weights; Clustering algorithms; Equations; Neurons; Partitioning algorithms; Prototypes; Self organizing feature maps; Vectors; Clustering; Multiple dissimilarity matrices; Relational data; Relevance weight; Self-Organizing Maps;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Tools with Artificial Intelligence (ICTAI), 2011 23rd IEEE International Conference on
Conference_Location :
Boca Raton, FL
ISSN :
1082-3409
Print_ISBN :
978-1-4577-2068-0
Electronic_ISBN :
1082-3409
Type :
conf
DOI :
10.1109/ICTAI.2011.92
Filename :
6103382
Link To Document :
بازگشت