Large sample statistics in the domain of graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6218 LNCS, Issue , 2010, Pages 690-697

  Jain, Brijnesh J ^a   Obermayer, Klaus ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CENTRAL LIMIT THEOREM; COMBINATORIAL STRUCTURES; FUNDAMENTAL THEOREMS; LAW OF LARGE NUMBERS; PROBABILISTIC METHODS; SAMPLE STATISTICS; STATISTICAL PATTERN RECOGNITION; STRUCTURAL PATTERN RECOGNITION; TWO-GRAPHS; WEIGHTED MEAN;

GRAPHIC METHODS; PATTERN RECOGNITION; PROBABILITY DENSITY FUNCTION; SYNTACTICS;

STATISTICS;

EID: 77958492382     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14980-1_68     Document Type: Conference Paper

References (21)

1. Bhattacharya, R., Bhattacharya, A.: Statistics on Manifolds with Applications to Shape Spaces. In: Perspectives in Mathematical Sciences, ISI, Bangalore (2008)
2. Caetano, T. S., et al.: Learning graph matching. In: ICCV 2007 Conf. Proc., pp. 1-8 (2007)
3. Cour, T., et al.: Balanced graph matching. In: NIPS 2006 Conf. Proc. (2006)
4. Ferrer, M.: Theory and algorithms on the median graph. application to graph-based classification and clustering, PhD Thesis, Univ. Aut'onoma de Barcelona (2007)
5. 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)
6. Ferrer, M., Valveny, E., Serratosa, F.: Median graphs: A genetic approach based on new theoretical properties. Pattern Recognition 42(9), 2003-2012 (2009)
7. 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)
8. Gold, S., Rangarajan, A.: Graduated Assignment Algorithm for Graph Matching. IEEE Trans. PAMI 18, 377-388 (1996)
9. Gold, S., et al.: Learning with preknowledge: clustering with point and graph matching distance measures. Neural Comp. 8(4), 787-804 (1996)
10. Günter, S., Bunke, H.: Self-organizing map for clustering in the graph domain. Pattern Recognition Letters 23(4), 405-417 (2002)
11. Jain, B., Wysotzki, F.: Central Clustering of Attributed Graphs. Machine Learning 56, 169-207 (2004)
12. Jain, B., Obermayer, K.: On the sample mean of graphs. In: IJCNN 2008 Conf. Proc., pp. 993-1000 (2008)
13. Jain, B., Obermayer, K.: Graph Quantization, arXiv:1001.0921v1 [cs. AI] (2009)
14. Jain, B., et al.: Multiple alignment of contact maps. In: IJCNN 2009 Conf. Proc. (2009)
15. Jain, B., Obermayer, K.: Consistent Estimators of Median and Mean Graph. In: ICPR 2010 Conf. Proc. (2010)
16. 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
17. Jiang, X., Munger, A., Bunke, H.: On Median Graphs: Properties, Algorithms, and Applications. IEEE Trans. PAMI 23(10), 1144-1151 (2001)
18. Mukherjee, L., et al.: Generalized median graphs and applications. Journal of Combinatorial Optimization 17, 21-44 (2009)
19. Schenker, A., et al.: Clustering of web documents using a graph model. In: Web Document Analysis: Challenges and Opportunities, pp. 1-16 (2003)
20. Umeyama, S.: An eigendecomposition approach to weighted graph matching problems. IEEE Trans. PAMI 10(5), 695-703 (1988)
21. van der Vaart, A. W.: Asymptotic Statistics. Cambridge University Press, Cambridge (2000)