Maximum quasilikelihood estimation for a simplified NEAR(1) model
β Scribed by Subashan Perera
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 112 KB
- Volume
- 58
- Category
- Article
- ISSN
- 0167-7152
No coin nor oath required. For personal study only.
β¦ Synopsis
As alternatives to maximum likelihood estimation, conditional least squares (CLS) and maximum quasilikelihood estimation, with asymptotic properties, are investigated using a simpliΓΏed NEAR(1) model. The maximum quasilikelihood estimator seems to perform better than the CLS estimator in simulations.
π SIMILAR VOLUMES
A parallel algorithm based on the neural network model for finding a near-maximum clique is presented in this paper. A maximum clique of a graph G is a maximum complete subgraph of G where any two vertices are adjacent. The problem of finding a maximum clique is NP-complete. The parallel algorithm r
## Abstract The problem of obtaining fieldβscale surface response to rainfall events is complicated by the spatial variability of infiltration characteristics of the soil and rainfall. In this paper, we develop and test a simplified model for generating surface runoff over fields with spatial varia