An innovative kernel-based recursive time-series learning algorithm with applications to improvements of beehive management practices Online publication date: Tue, 22-Jan-2008
by Jack Penm
International Journal of Innovation and Learning (IJIL), Vol. 5, No. 2, 2008
Abstract: In this paper, we propose an innovative kernel-based learning algorithm to sequentially estimate subset vector autoregressive models (including full-order models). To demonstrate the effectiveness of the proposed recursive algorithm, we apply this algorithm to test the direct causal relationships between the population of honeybee foragers and foraging types gathering nectar, pollen or water. We have found that under certain conditions, nectar foraging may be improved by the changes in the proportions of other foraging bees, such as pollen foragers. This suggests that we may be able to predict the optimal conditions at any time to maximise the honey yield of colonies.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Innovation and Learning (IJIL):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com