CSpace  > 中国科学院计算技术研究所期刊论文  > 英文
Semantic profile-based document logistics for cooperative research
Hai, ZG; Li, YY
2004
发表期刊FUTURE GENERATION COMPUTER SYSTEMS
ISSN0167-739X
卷号20期号:1页码:47-60
摘要This paper proposes a document logistics approach for cooperative research based on the Web and Knowledge Grid. The approach realizes effective research document collection, organization and provision as well as knowledge sharing by incorporating the following functions: construction of semantic profiles representing interests, continuous discovery and collection of potentially relevant documents, synthesis of evaluation feedbacks, and support of flexible management operations and document recommendation services. The prototype has been implemented and is available for use online. Experiments show that the proposed approach is feasible and effective. (C) 2003 Elsevier B.V. All rights reserved.
关键词feedback synthesis knowledge grid logistics profile teamwork
DOI10.1016/S0167-739X(03)00164-X
收录类别SCI
语种英语
WOS研究方向Computer Science
WOS类目Computer Science, Theory & Methods
WOS记录号WOS:000188388900005
出版者ELSEVIER SCIENCE BV
引用统计
被引频次:1[WOS]   [WOS记录]     [WOS相关记录]
文献类型期刊论文
条目标识符http://119.78.100.204/handle/2XEOYT63/13893
专题中国科学院计算技术研究所期刊论文_英文
通讯作者Hai, ZG
作者单位Chinese Acad Sci, Inst Comp Technol, Key Lab Intelligent Informat Proc, Knowledge Grid Res Grp, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Hai, ZG,Li, YY. Semantic profile-based document logistics for cooperative research[J]. FUTURE GENERATION COMPUTER SYSTEMS,2004,20(1):47-60.
APA Hai, ZG,&Li, YY.(2004).Semantic profile-based document logistics for cooperative research.FUTURE GENERATION COMPUTER SYSTEMS,20(1),47-60.
MLA Hai, ZG,et al."Semantic profile-based document logistics for cooperative research".FUTURE GENERATION COMPUTER SYSTEMS 20.1(2004):47-60.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Hai, ZG]的文章
[Li, YY]的文章
百度学术
百度学术中相似的文章
[Hai, ZG]的文章
[Li, YY]的文章
必应学术
必应学术中相似的文章
[Hai, ZG]的文章
[Li, YY]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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