Abstract
One challenge in bridging the gap between structural and statistical pattern recognition consists in studying combinatorial structures like graphs using probabilistic methods. This contribution presents the structural counterparts of the first and second fundamental theorem in probability, (1) the law of large numbers and (2) the central limit theorem. In addition, we derive characterizations and uniqueness conditions for the mean of graphs. As a special case, we investigate the weighted mean of two graphs. The proposed results establish a sound statistical foundation for unsupervised structural pattern recognition methods.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bhattacharya, R., Bhattacharya, A.: Statistics on Manifolds with Applications to Shape Spaces. In: Perspectives in Mathematical Sciences, ISI, Bangalore (2008)
Caetano, T.S., et al.: Learning graph matching. In: ICCV 2007 Conf. Proc., pp. 1–8 (2007)
Cour, T., et al.: Balanced graph matching. In: NIPS 2006 Conf. Proc. (2006)
Ferrer, M.: Theory and algorithms on the median graph. application to graph-based classification and clustering, PhD Thesis, Univ. Aut‘onoma de Barcelona (2007)
Ferrer, M., et al.: Graph-Based k-Means Clustering: A Comparison of the Set Median versus the Generalized Median Graph. In: Jiang, X., Petkov, N. (eds.) CAIP 2009. LNCS, vol. 5702, pp. 342–350. Springer, Heidelberg (2009)
Ferrer, M., Valveny, E., Serratosa, F.: Median graphs: A genetic approach based on new theoretical properties. Pattern Recognition 42(9), 2003–2012 (2009)
Fréchet, M.: Les éléments aléatoires de nature quelconque dans un espace distancié. Annales de l’Institut Henri Poincaré 10(3), 215–310 (1948)
Gold, S., Rangarajan, A.: Graduated Assignment Algorithm for Graph Matching. IEEE Trans. PAMI 18, 377–388 (1996)
Gold, S., et al.: Learning with preknowledge: clustering with point and graph matching distance measures. Neural Comp. 8(4), 787–804 (1996)
Günter, S., Bunke, H.: Self-organizing map for clustering in the graph domain. Pattern Recognition Letters 23(4), 405–417 (2002)
Jain, B., Wysotzki, F.: Central Clustering of Attributed Graphs. Machine Learning 56, 169–207 (2004)
Jain, B., Obermayer, K.: On the sample mean of graphs. In: IJCNN 2008 Conf. Proc., pp. 993–1000 (2008)
Jain, B., Obermayer, K.: Graph Quantization, arXiv:1001.0921v1 [cs.AI] (2009)
Jain, B., et al.: Multiple alignment of contact maps. In: IJCNN 2009 Conf. Proc. (2009)
Jain, B., Obermayer, K.: Consistent Estimators of Median and Mean Graph. In: ICPR 2010 Conf. Proc. (2010)
Jain, B., Obermayer, K.: Supplementary material for the paper Large Sample Statistics in the Domain of Graphs (2010), http://user.cs.tu-berlin.de/~jbj/publication.html
Jiang, X., Munger, A., Bunke, H.: On Median Graphs: Properties, Algorithms, and Applications. IEEE Trans. PAMI 23(10), 1144–1151 (2001)
Mukherjee, L., et al.: Generalized median graphs and applications. Journal of Combinatorial Optimization 17, 21–44 (2009)
Schenker, A., et al.: Clustering of web documents using a graph model. In: Web Document Analysis: Challenges and Opportunities, pp. 1–16 (2003)
Umeyama, S.: An eigendecomposition approach to weighted graph matching problems. IEEE Trans. PAMI 10(5), 695–703 (1988)
van der Vaart, A.W.: Asymptotic Statistics. Cambridge University Press, Cambridge (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jain, B.J., Obermayer, K. (2010). Large Sample Statistics in the Domain of Graphs. In: Hancock, E.R., Wilson, R.C., Windeatt, T., Ulusoy, I., Escolano, F. (eds) Structural, Syntactic, and Statistical Pattern Recognition. SSPR /SPR 2010. Lecture Notes in Computer Science, vol 6218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14980-1_68
Download citation
DOI: https://doi.org/10.1007/978-3-642-14980-1_68
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14979-5
Online ISBN: 978-3-642-14980-1
eBook Packages: Computer ScienceComputer Science (R0)