138 search results - page 28 / 28 » Graph Laplacians and their convergence on random neighborhoo... |
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...
AMAI
2004
Springer
13 years 10 months ago
2004
Springer
Learning the parameters (conditional and marginal probabilities) from a data set is a common method of building a belief network. Consider the situation where we have known graph s...
ICCV
2003
IEEE
14 years 6 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...