Consistent estimators of median and mean graph

Proceedings - International Conference on Pattern Recognition

Volumn , Issue , 2010, Pages 1032-1035

  Jain, Brijnesh ^a   Obermayer, Klaus ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BASIC BUILDING BLOCK; CENTRAL POINT; CONSISTENT ESTIMATORS; PATTERN RECOGNITION METHOD; STATISTICAL GRAPHS; SUFFICIENT CONDITIONS;

PATTERN RECOGNITION;

EID: 78149481611     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPR.2010.258     Document Type: Conference Paper

References (23)

1. R. Bhattacharya and A. Bhattacharya. Statistics on Manifolds with Applications to Shape Spaces, Perspectives in Mathematical Sciences, ISI, Bangalore, 2008.
2. J.E. Borzellino. Riemannian geometry of orbifolds, PhD thesis, University of California, Los Angelos, 1992.
3. T.S. Caetano et al. Learning graph matching, ICCV 2007 Conf. Proc., p. 1-8, 2007.
4. T. Cour, P. Srinivasan, and J. Shi. Balanced graph matching, NIPS 2006 Conf. Proc., 2006.
5. 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.
6. M. Ferrer. Theory and algorithms on the median graph. application to graph-based classification and clustering, PhD Thesis, Univ. Aut'onoma de Barcelona, 2007.
7. M. Ferrer et al.. Graph-Based k-Means Clustering: A Comparison of the Set Median versus the Generalized Median Graph CAIP 2009 Conf. Proc., 2009.
8. M. Ferrer, E. Valveny and F. Serratosa. Median graphs: A genetic approach based on new theoretical properties Pattern Recognition, 42(9) 2003-2012
9. M. Fréchet. Les éléments aléatoires de nature quelconque dans un espace distancié, Annales de l'Institut Henri Poincaré, 10(3):215-310, 1948.
10. S. Gold and A. Rangarajan. Graduated Assignment Algorithm for Graph Matching, IEEE Trans. PAMI, 18:377-388, 1996. (Pubitemid 126771701)
11. S. Gold, A. Rangarajan, and E. Mjolsness. Learning with preknowledge: clustering with point and graph matching distance measures, Neural Comp., 8(4):787-804, 1996.
12. S. Günter and H. Bunke. Self-organizing map for clustering in the graph domain, Pattern Recognition Letters, 23(4):405-417, 2002.
13. B. Jain and F.Wysotzki. Central Clustering of Attributed Graphs, Machine Learning, 56, 169-207, 2004.
14. B. Jain and K. Obermayer. On the sample mean of graphs, IJCNN 2008 Conf. Proc., p. 993-1000, 2008.
15. B. Jain and K. Obermayer. Structure Spaces, Journal of Machine Learning Research, 10:2667-2714, 2009.
16. B. Jain and K. Obermayer. Graph Quantization, arXiv:1001.0921v1 [cs.AI], 2009.
17. B. Jain et al. Multiple alignment of contact maps, IJCNN 2009 Conf. Proc., 2009.
18. X. Jiang, X., A. Munger, and H. Bunke. On Median Graphs: Properties, Algorithms, and Applications, IEEE Trans. PAMI, 23(10):1144-1151, 2001.
19. H. Karcher. Riemannian center of mass and mollifier smoothing. Communications in Pure and Applied Mathematics, 30:509-541, 1977.
20. L. Mukherjee et al. Generalized median graphs and applications, Journal of Combinatorial Optimization, 17:21-44, 2009.
21. V.I. Norkin. Stochastic generalized-differentiable functions in the problem of nonconvex nonsmooth stochastic optimization, Cybernetics, 22(6), 804-809, 1986.
22. A. Schenker et al.. Clustering of web documents using a graph model, Web Document Analysis: Challenges and Opportunities, p. 1-16, 2003.
23. S. Umeyama. An eigendecomposition approach to weighted graph matching problems, IEEE Trans. PAMI, 10(5):695-703, 1988