1023 search results - page 5 / 205 » Graph model selection using maximum likelihood |
ICASSP
2008
IEEE
14 years 1 months ago
2008
IEEE
We propose new algorithms for estimating autoregressive (AR), moving average (MA), and ARMA models in the spectral domain. These algorithms are derived from a maximum likelihood a...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
The use of Bayesian networks for classification problems has received significant recent attention. Although computationally efficient, the standard maximum likelihood learning me...
SIROCCO
2008
13 years 9 months ago
2008
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
How to determine the number of clusters is an intractable problem in clustering analysis. In this paper, we propose a new learning paradigm named Maximum Weighted Likelihood (MwL)...
AAAI
2006
13 years 8 months ago
2006
We present a new method for mapping ontology schemas that address similar domains. The problem of ontology mapping is crucial since we are witnessing a decentralized development a...