Sciweavers

Share
779 search results - page 1 / 156
» Algorithms for the Sample Mean of Graphs
Sort
View
CAIP
2009
Springer
155views Image Analysis» more  CAIP 2009»
10 years 9 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
IJCNN
2008
IEEE
10 years 9 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
IWANN
2007
Springer
10 years 9 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ñ...
ICLP
2010
Springer
10 years 6 months ago
Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program Specialization
Abstract. There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From ...
Daan Fierens
ICDM
2008
IEEE
106views Data Mining» more  ICDM 2008»
10 years 9 months ago
Metropolis Algorithms for Representative Subgraph Sampling
While data mining in chemoinformatics studied graph data with dozens of nodes, systems biology and the Internet are now generating graph data with thousands and millions of nodes....
Christian Hübler, Hans-Peter Kriegel, Karsten...
books