{"title":"A Set-Medoids Vector Batch SOM Algorithm Based on Multiple Dissimilarity Matrices","authors":"F. D. Carvalho, Eduardo C. Simões","doi":"10.1109/BRACIS.2015.13","DOIUrl":null,"url":null,"abstract":"This paper gives a batch SOM algorithm that is able to training a Kohonen map taking into account simultaneously several dissimilarity matrices, that are obtained using different sets of variables and dissimilarity functions. This algorithm is designed to provide a partition and a set-medoids vector representative for each cluster, and learn a relevance weight on the training for each dissimilarity matrix by optimizing an objective function. These relevance weights change at each algorithm's iteration and are different from one cluster to another. The proposed algorithm provides a collaborative role of the different dissimilarity matrices, aiming to cluster and visualizing the data while preserving their topology. Several examples illustrate the usefulness of the proposed algorithm.","PeriodicalId":416771,"journal":{"name":"2015 Brazilian Conference on Intelligent Systems (BRACIS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Brazilian Conference on Intelligent Systems (BRACIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BRACIS.2015.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
This paper gives a batch SOM algorithm that is able to training a Kohonen map taking into account simultaneously several dissimilarity matrices, that are obtained using different sets of variables and dissimilarity functions. This algorithm is designed to provide a partition and a set-medoids vector representative for each cluster, and learn a relevance weight on the training for each dissimilarity matrix by optimizing an objective function. These relevance weights change at each algorithm's iteration and are different from one cluster to another. The proposed algorithm provides a collaborative role of the different dissimilarity matrices, aiming to cluster and visualizing the data while preserving their topology. Several examples illustrate the usefulness of the proposed algorithm.