779 search results - page 1 / 156 » Algorithms for the Sample Mean of Graphs |
CAIP
2009
Springer
13 years 11 months ago
2009
Springer
Measures of central tendency for graphs are important for protoype construction, frequent substructure mining, and multiple alignment of protein structures. This contribution propo...
IJCNN
2008
IEEE
13 years 11 months ago
2008
IEEE
— 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 ...
IWANN
2007
Springer
13 years 10 months ago
2007
Springer
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...
ICLP
2010
Springer
13 years 8 months ago
2010
Springer
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 ...
ICDM
2008
IEEE
13 years 11 months ago
2008
IEEE
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....