期刊文献+

基于项目合作的社会关系网络构建 被引量:7

A Construction for Social Network on the Basis of Project Cooperation
下载PDF
导出
摘要 目前,基于论文合作关系的科学研究人员社会关系网络得到了极大的关注,但是存在实体识别不准确、数据更新不及时等数据质量问题.有鉴于此,提出利用历年项目申请书的合作关系,同时将实体识别问题归结为一个聚类问题,证明该问题的计算复杂度,然后提出了算法来解决该问题,最后在真实数据上验证算法的效率. For the time being,the social network based on paper cooperation has gained a great deal of attention,but there exists inaccurate entity recognition,failing to update data in time,and uncertain data quality etc.In view of this,this paper puts forward the cooperation on the basis of the history project application,and the problem of the entity recognition attributes to a clustering problem.The computational complexity of the problem is proved.Then the algorithm is proposed to settle the problem.Finally,the efficiency of the algorithm is verified by the experiments on real data.
出处 《计算机研究与发展》 EI CSCD 北大核心 2016年第4期776-784,共9页 Journal of Computer Research and Development
基金 国家自然科学基金项目(61103244 U1509213) 广东省自然科学基金项目(2015A030313433) 广东省高等学校优秀青年教师培养计划项目(Yq2013074) 广东省普通高校特色创新项目(2015KTSCX036) 广东省高校工程技术研究中心建设项目(GCZXA1306) 信息与通信工程浙江省重中之重学科开放基金项目 中国博士后科学基金项目(2013M540323) 教育部人文社会科学研究项目(15YJA630069) 汕头市科技计划项目(98)~~
关键词 项目合作 社会关系网络 实体识别 聚类 计算几何问题 project cooperation social network entity recognition clustering computational geometry problems
  • 相关文献

参考文献33

  • 1Liu X, Guo Z, Lin Z. A local social network approach for research management [J]. Decision Support Systems, 2013, 56(12) : 427-438.
  • 2Tang J, Zhang J, Yao L, et al. ArnetMiner~ Extraction and mining of academic social networks [C]//Proc of the 14th ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining. NeW York, ACM, 2008:990-998.
  • 3China Computer Federation. CCF Scholar [EB/OL]. [2015- 12-02]. http://www, ccf. org. cn/sitesfecf[eefscholar, jsp (in Chinese).
  • 4计算机学会.CCF学术空间【EB/OL].[2015—12—02].http://www.cd.org.cn/sites/ccf/ccfsch01ar.jsp.
  • 5Erickson J. On the relative complexities of some geometric problems [C/OL] //Proc of Canad Conf Computer Geometry. 2010:85-90. [2015-12-01]. http://cs, utuc. edu/~jeffe/ pubs/pdf/relative, pdf.
  • 6Erickson J. New lower bounds for Hopcroft's problem [J]. Discrete ~ Computational Geometry, 1996, 16(4) :389-418.
  • 7Gan Junhao, Tao Yufei. DBSCAN revisited~ Mis-Claim, un- Fixability, and approximation [C] //Proc of the 2015 ACM SIGMOD Int Conf on Management of Data. New York~ ACM, 2015~519-530.
  • 8Shi L, Tong H, Tang J, et al. VEGAS~ Visual influence graph summarization on citation networks[J]. IEEE Trans on Knowledge ~ Data Engineering, 2015, 27(12): 1-15.
  • 9Zhang J, Fang Z, Chert W, et al. Diffusion of "Following" links in microblogging networks [J]. IEEE Trans on Knowledge ~ Data Engineering, 2015, 27(8): 2093-2106.
  • 10Tang J, Wang B, Yang Y, et al. PatentMiner: Topic-driven patent analysis and mining [C]//Proc of the 18th ACM SIGKDD Int Con{ on Knowledge Discovery and Data Mining. New York~ ACM, 2012:1366-1375.

同被引文献41

引证文献7

二级引证文献39

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部