QQ客服 官方微博 反馈留言

	Complex query expansion based on weighted shortest path length in key term concurrence network
	Xiao, Guozheng; Yang, Hua; Zhang, Mingyao; Ji, Donghong
刊名	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
	2013
卷号	8229 LNAI
ISSN号	0302-9743
DOI	10.1007/978-3-642-45185-0_52
URL标识	查看原文
收录类别	EI
语种	英语
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/3734695
专题	武汉大学
推荐引用方式 GB/T 7714	Xiao, Guozheng,Yang, Hua,Zhang, Mingyao,et al. Complex query expansion based on weighted shortest path length in key term concurrence network[J]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),2013,8229 LNAI.
APA	Xiao, Guozheng,Yang, Hua,Zhang, Mingyao,&Ji, Donghong.(2013).Complex query expansion based on weighted shortest path length in key term concurrence network.Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),8229 LNAI.
MLA	Xiao, Guozheng,et al."Complex query expansion based on weighted shortest path length in key term concurrence network".Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 8229 LNAI(2013).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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