Arid
DOI10.1080/15659801.2013.820391
A Bayesian approach to finding groups in a food web
Solow, Andrew R.; Beet, Andrew R.
通讯作者Solow, Andrew R.
来源期刊ISRAEL JOURNAL OF ECOLOGY & EVOLUTION
ISSN1565-9801
EISSN2224-4662
出版年2013
卷号59期号:1页码:37-41
英文摘要

A food web describes the feeding links between species in a community. The species in many food webs are organized into groups of highly linked species that are weakly linked to species in other groups. A Bayesian approach to identifying such groups in an observed food web is described. This approach extends a previous non-Bayesian one that does not exploit information about the relatively high density of links within groups and relatively low density between groups. Under the new approach, this information is encoded through prior distributions for within- and between-group link densities. The approach is shown to work well on simulated food webs. Results are presented of the application of the method to the Coachella Valley desert food web.


英文关键词Bayesian analysis Coachella Valley desert food web food web structure model selection prior distribution
类型Article
语种英语
国家USA
收录类别SCI-E
WOS记录号WOS:000327389000005
WOS类目Ecology ; Evolutionary Biology
WOS研究方向Environmental Sciences & Ecology ; Evolutionary Biology
资源类型期刊论文
条目标识符http://119.78.100.177/qdio/handle/2XILL650/177859
作者单位Woods Hole Oceanog Inst, Woods Hole, MA 02543 USA
推荐引用方式
GB/T 7714
Solow, Andrew R.,Beet, Andrew R.. A Bayesian approach to finding groups in a food web[J],2013,59(1):37-41.
APA Solow, Andrew R.,&Beet, Andrew R..(2013).A Bayesian approach to finding groups in a food web.ISRAEL JOURNAL OF ECOLOGY & EVOLUTION,59(1),37-41.
MLA Solow, Andrew R.,et al."A Bayesian approach to finding groups in a food web".ISRAEL JOURNAL OF ECOLOGY & EVOLUTION 59.1(2013):37-41.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Solow, Andrew R.]的文章
[Beet, Andrew R.]的文章
百度学术
百度学术中相似的文章
[Solow, Andrew R.]的文章
[Beet, Andrew R.]的文章
必应学术
必应学术中相似的文章
[Solow, Andrew R.]的文章
[Beet, Andrew R.]的文章
相关权益政策
暂无数据
收藏/分享

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。