ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Publication Date: 2011-10-01
    Description: Forest tree ingrowth is a highly variable and largely stochastic process. Consequently, predicting occurrence, frequency, and composition of ingrowth is a challenging task but of great importance in long-term forest growth and yield model projections. However, ingrowth data often require different statistical techniques other than traditional Gaussian regression, because these data are often bounded, skewed, and non-normal and commonly contain a large fraction of zeros. This study presents a set of regression models based on discrete Poisson and negative binomial probability distributions for ingrowth data collected from permanent sample plots in the Acadian Forest Region of North America. Models considered here include regular Poisson, zero-inflated Poisson (ZIP), zero-altered Poisson (ZAP; hurdle Poisson), regular negative binomial (NB), zero-inflated negative binomial (ZINB), and zero-altered negative binomial (ZANB; hurdle NB). Plot-level random effects were incorporated into each of these models. The ZINB model with random effects was found to provide the best fit statistics for modeling annualized occurrence and frequency of ingrowth. The key explanatory variables were stand basal area per hectare, percentage of hardwood basal area, number of trees per hectare, a measure of site quality, and the minimum measured diameter at breast height of each plot. A similar model was developed to predict species composition. All models showed logical behavior despite the high variability observed in the original data.
    Print ISSN: 0045-5067
    Electronic ISSN: 1208-6037
    Topics: Agriculture, Forestry, Horticulture, Fishery, Domestic Science, Nutrition
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...