Sciweavers

1722 search results - page 1 / 345
» On the sample mean of graphs
Sort
View
IJCNN
2008
IEEE
14 years 5 months ago
On the sample mean of graphs
— We present an analytic and geometric view of the sample mean of graphs. The theoretical framework yields efficient subgradient methods for approximating a structural mean and ...
Brijnesh J. Jain, Klaus Obermayer
CAIP
2009
Springer
155views Image Analysis» more  CAIP 2009»
14 years 5 months ago
Algorithms for the Sample Mean of Graphs
Measures of central tendency for graphs are important for protoype construction, frequent substructure mining, and multiple alignment of protein structures. This contribution propo...
Brijnesh J. Jain, Klaus Obermayer
IWANN
2007
Springer
14 years 5 months ago
A Comparison Between ANN Generation and Training Methods and Their Development by Means of Graph Evolution: 2 Sample Problems
Abstract. This paper presents a study in which a new technique for automatically developing Artificial Neural Networks (ANNs) by means of Evolutionary Computation (EC) tools is com...
Daniel Rivero, Julian Dorado, Juan R. Rabuñ...
CORR
2008
Springer
130views Education» more  CORR 2008»
13 years 11 months ago
A Kernel Method for the Two-Sample Problem
We propose two statistical tests to determine if two samples are from different distributions. Our test statistic is in both cases the distance between the means of the two sample...
Arthur Gretton, Karsten M. Borgwardt, Malte J. Ras...
ICPR
2010
IEEE
13 years 12 months ago
Consistent Estimators of Median and Mean Graph
The median and mean graph are basic building blocks for statistical graph analysis and unsupervised pattern recognition methods such as central clustering and graph quantization. ...
Brijnesh J. Jain, Klaus Obermayer