Self-organizing maps with non-cooperative strategies (SOM-NC)

2Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The training scheme in self-organizing maps consists of two phases: i) competition, in which all units intend to become the best matching unit (BMU), and ii) cooperation, in which the BMU allows its neighbor units to adapt their weight vector. In order to study the relevance of cooperation, we present a model in which units do not necessarily cooperate with their neighbors, but follow some strategy. The strategy concept is inherited from game theory, and it establishes whether the BMU will allow or not their neighbors to learn the input stimulus. Different strategies are studied, including unconditional cooperation as in the original model, unconditional defection, and several history-based schemes. Each unit is allowed to change its strategy in accordance with some heuristics. We give evidence of the relevance of non-permanent cooperators units in order to achieve good maps, and we show that self-organization is possible when cooperation is not a constraint. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Neme, A., Hernández, S., Neme, O., & Hernández, L. (2009). Self-organizing maps with non-cooperative strategies (SOM-NC). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5629 LNCS, pp. 200–208). https://doi.org/10.1007/978-3-642-02397-2_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free