779 search results - page 28 / 156 » Algorithms for the Sample Mean of Graphs |
107
click to vote
NIPS
2008
15 years 1 months ago
2008
Clustering stability is an increasingly popular family of methods for performing model selection in data clustering. The basic idea is that the chosen model should be stable under...
BIOCOMP
2007
15 years 1 months ago
2007
— This paper describes graph-based relational, unsupervised learning algorithm to infer node replacement graph grammar and its application to metabolic pathways. We search for fr...
118
click to vote
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
128
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
CSB
2003
IEEE
15 years 5 months ago
2003
IEEE
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...