Multiple kernel self-organizing maps

ESANN 2013 proceedings, 21st European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning

Volumn , Issue , 2013, Pages 83-88

  Olteanu, Madalina ^a   Villa Vialaneix, Nathalie ^b   Cierco Ayrolles, Christine ^b  

^a UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

^b INRA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMBINATION; MULTIPLE KERNELS; NUMERICAL VARIABLES; REAL-LIFE APPLICATIONS; SOURCES OF INFORMATIONS;

LEARNING SYSTEMS; NEURAL NETWORKS;

CONFORMAL MAPPING;

EID: 84887066582     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. T. Kohohen and P.J. Somervuo. Self-organizing maps of symbol strings. Neurocomputing, 21:19-30, 1998.
2. B. Conan-Guez, F. Rossi, and A. El Golli. Fast algorithm and implementation of dissimilarity self-organizing maps. Neural Networks, 19(6-7):855-863, 2006.
3. B. Hammer, A. Hasenfuss, F. Rossi, and M. Strickert. Topographic processing of relational data. In Bielefeld University Neuroinformatics Group, editor, Proceedings of the 6th Workshop on Self-Organizing Maps (WSOM 07), Bielefeld, Germany, September 2007.
4. B. Hammer, A. Gisbrecht, A. Hasenfuss, B. Mokbel, F.M. Schleif, and X. Zhu. Topographic mapping of dissimilarity data. In J. Laaksonen and T. Honkela, editors, Advances in Self-Organizing Maps (Proceedings of the 8th Workshop on Self-Organizing Maps, WSOM 2011), volume 6731 of Lecture Notes in Computer Science, pages 1-15, Espoo, Finland, 2011. Springer.
5. M. Olteanu, N. Villa-Vialaneix, and M. Cottrell. On-line relational som for dissimilarity data. In P.A. Estevez, J. Principe, P. Zegers, and G. Barreto, editors, Advances in Self-Organizing Maps (Proceedings of WSOM 2012), volume 198 of AISC (Advances in Intelligent Systems and Computing), pages 13-22, Santiago, Chile, 2012. Springer Verlag, Berlin, Heidelberg.
6. D. Mac Donald and C. Fyfe. The kernel self organising map. In Proceedings of 4th International Conference on knowledge-based intelligence engineering systems and applied technologies, pages 317-320, 2000.
7. P. Andras. Kernel-Kohonen networks. International Journal of Neural Systems, 12:117-135, 2002.
8. R. Boulet, B. Jouve, F. Rossi, and N. Villa. Batch kernel SOM and related laplacian methods for social network analysis. Neurocomputing, 71(7-9):1257-1273, 2008.
9. T. Gärtner. Kernel for Structured Data. World Scientific, 2008.
10. R.I. Kondor and J. Lafferty. Diffusion kernels on graphs and other discrete structures. In Proceedings of the 19th International Conference on Machine Learning, pages 315-322, 2002.
11. F. Fouss, A. Pirotte, J.M. Renders, and M. Saerens. Random-walk computation of similarities between nodes of a graph, with application to collaborative recommendation. IEEE Transactions on Knowledge and Data Engineering, 19(3):355-369, 2007.
12. A.J. Smola and R. Kondor. Kernels and regularization on graphs. In M. Warmuth and B. Schölkopf, editors, Proceedings of the Conference on Learning Theory (COLT) and Kernel Workshop, Lecture Notes in Computer Science, pages 144-158, 2003.
13. C. Watkins. Dynamic alignment kernels. In A. Smola, P. Bartlett, B. Schölkopf, and D. Schuurmans, editors, Advances in Large Margin Classifiers, pages 39-50, Cambridge, MA, USA, 2000. MIT P.
14. N. Aronszajn. Theory of reproducing kernels. Transactions of the American Mathematical Society, 68(3):337-404, 1950.
15. N. Villa and F. Rossi. A comparison between dissimilarity SOM and kernel SOM for clustering the vertices of a graph. In 6th International Workshop on Self-Organizing Maps (WSOM), Bielefield, Germany, 2007. Neuroinformatics Group, Bielefield University.
16. A. Rakotomamonjy, F.R. Bach, S. Canu, and Y. Grandvalet. SimpleMKL. Journal of Machine Learning Research, 9:2491-2521, 2008.
17. D. Luenberger. Linear and Nonlinear Programming. Addison-Wesley, 1984.
18. F. Bonnans. Optimisation Continue. Dunod, 2006.
19. M. Olteanu, S. Massoni, and N. Villa-Vialaneix. Which distance use when extracting typologies in sequence analysis? An application to school to work transitions. Submitted for publication.
20. A. Abbott and Tsay. Sequence analysis and optimal matching methods in sociology. Review and Prospect. Sociological Methods and Research, 29(1):3-33, 2000.
21. L. Wu. Some comments on "Sequence analysis and optimal matching methods in sociology, review and prospect". Sociological Methods and Research, 29(1):41-64, 2000.
22. A. Condon and R.M. Karp. Algorithms for graph partitioning on the planted partition model. Random Structures and Algorithms, 18(2):116-140, 2001.
23. L. Danon, A. Diaz-Guilera, J. Duch, and A. Arenas. Comparing community structure identification. Journal of Statistical Mechanics, page P09008, 2005.