6. T. Cour, P. Srinivasan, and J. Shi, "Balanced graph matching", *NIPS 2006 Conference Proceedings*, 2006.

7. R.O. Duda, P.E. Hart, and D.G. Stork *Pattern Classification*, Wiley & Sons, 2000.

8. Y.M. Ermoliev and V.I. Norkin, "Normalized convergence in stochastic optimization", *Annals of Operations Research*, 30:187–198, 1991, 9. Y.M. Ermoliev, V.I. Norkin, and R. Wets, "The minimization of discontinuous functions: mollifier subgradients", *SIAM Journal on Control and Optimization*, 33:149–
167, 1995.

10. Y.M. Ermoliev and V.I. Norkin, "On nonsmooth and discontinuous problems of stochastic systems optimization", *European Journal of Operational Research*,
101:230–244, 1997.

11. Y. M. Ermoliev and V.I. Norkin, "Stochastic generalized gradient method for nonconvex nonsmooth stochastic optimization", *Cybernetics and Systems Analysis*, 34(2), 196–215, 1998.

12. M. Ferrer, *Theory and algorithms on the median graph. application to graph-based* classification and clustering, PhD Thesis, Univ. Aut'onoma de Barcelona, 2007.

13. M. Ferrer, E. Valveny, F. Serratosa, I. Bardají, and H. Bunke, "Graph-Based kMeans Clustering: A Comparison of the Set Median versus the Generalized Median Graph" *CAIP 2009 Conference Proceedings*, 2009.

14. A. Gersho and R.M. Gray, *Vector Quantization and Signal Compression*, Kluwer Academic Publishers, 1992.

15. S. Gold and A. Rangarajan, "Graduated Assignment Algorithm for Graph Matching", *IEEE Trans. Pattern Analysis and Machine Intelligence*, 18:377–388, 1996.

16. S. Gold, A. Rangarajan, and E. Mjolsness, "Learning with preknowledge: clustering with point and graph matching distance measures" *Neural Computation*, 8(4):787–
804, 1996.

17. S. Günter and H. Bunke, "Self-organizing map for clustering in the graph domain",
Pattern Recognition Letters, 23(4):405–417, 2002.

18. M. Hagenbuchner, A. Sperduti, and A.C. Tsoi, ÒA Self-Organizing Map for Adaptive Processing of Structured Data,Ó *IEEE Transaction on Neural Networks*, 14:491–505, 2003.

19. B. Jain and F. Wysotzki, "Central Clustering of Attributed Graphs", *Machine* Learning, 56, 169–207, 2004.

20. B. Jain and K. Obermayer, "On the sample mean of graphs", *IJCNN 2008 Conference Proceedings*, p. 993–1000, 2008.

21. B. Jain and K. Obermayer, "Structure Spaces", *Journal of Machine Learning Research*, 10:2667–2714, 2009. 22. B. Jain and K. Obermayer, "Accelerating Competitive Learning Graph Quantization", *Computer Vision and Image Understanding*, 2009 (submitted).

23. B. Jain and K. Obermayer, "Elkan's k-Means for Graphs", arXiv:0912.4598v1
[cs.AI], 2009.

24. Y. Linde, A. Buzo, and R. M. Gray, ÒAn algorithm for vector quantizer design,Ó
IEEE Transactions on Communications, 28:84–95, 1980.

25. S.P. Lloyd, ÒLeast squares quantization in PCMÓ, *IEEE Transactions on Information Theory*, 28:129–137, 1982, reprint of 1957.

26. M.A. Lozano and F. Escolano, "ACM attributed graph clustering for learning classes of images", *Graph Based Representations in Pattern Recognition*, Lecture Notes in Computer Science, 2726:247–258, 2003 27. V.I. Norkin, "Stochastic generalized-differentiable functions in the problem of nonconvex nonsmooth stochastic optimization", *Cybernetics*, 22(6), 804–809, 1986.