Speeding Up the Dissimilarity Self-Organizing Maps by Branch and Bound

Abstract. This paper proposes to apply the branch and bound principle from combinatorial optimization to the Dissimilarity Self-Organizing Map (DSOM), a variant of the SOM that can handle dissimilarity data. A new reference model optimization method is derived from this principle. Its results are strictly identical to those of the original DSOM algorithm by Kohonen and Somervuo, while its running time is reduced by a factor up to 2.5 compared to the one of the previously proposed optimized implementation.

• Type: Conference
• Year: 2007
• Where: IWANN
• Authors: Brieuc Conan-Guez, Fabrice Rossi
• Keywords: Combinatorial Optimization, Dissimilarity Self-Organizing Map, IWANN 2007, Model Optimization Method