首页> 外文会议>International Conference on Advances in Social Networks Analysis and Mining >OverCite: Finding Overlapping Communities in Citation Network
【24h】

OverCite: Finding Overlapping Communities in Citation Network

机译:过度:在引文网络中找到重叠的社区

获取原文

摘要

Citation analysis is a popular area of research, which has been usually used to rank the authors and the publication venues of research papers. With huge number of publications every year, it has become difficult for the users to find relevant publication materials. One simple solution to this problem is to detect communities from the citation network and recommend papers based on the common membership in communities. But, in today's research scenario, many researchers' fields of interest spread into multiple research directions resulting in an increasing number of interdisciplinary publications. Therefore, it is necessary to detect overlapping communities for relevant recommendation. In this paper, we represent publication information as a tripartite 'Publication Hypergraph' consisting of authors, papers and publication venues (conferences/journals) in three partitions. We then propose an algorithm called 'OverCite', which can detect overlapping communities of authors, papers and venues simultaneously using the publication hypergraph and the citation network information. We compare OverCite with two existing overlapping community detection algorithms, Clique Percolation Method (CPM) and iLCD, applied on citation network. The experiments on a large real-world citation dataset show that OverCite outperforms other two algorithms. We also present a simple paper search and recommendation system. Based on the relevance judgements of the users, we further prove the effectiveness of OverCite over other two algorithms.
机译:引文分析是一个流行的研究领域,通常用于对作者和研究论文的出版物的出版物。每年有大量出版物,用户难以找到相关的出版物。对此问题的一个简单解决方案是检测引文网络的社区,并根据社区的共同成员推荐论文。但是,在今天的研究方案中,许多研究人员的兴趣领域传播到多个研究方向导致越来越多的跨学科出版物。因此,有必要检测相关建议的重叠社区。在本文中,我们表示出版物信息作为三个分区由作者,论文和出版物场地(会议/期刊)的三方“公开超图”。然后,我们提出了一种称为“overcite”的算法,它可以使用公开超图和引文信息同时检测作者,论文和场地的重叠社区。我们将过度的超透明与两个现有的重叠群落检测算法,Clique Percolation方法(CPM)和ILCD进行比较,应用于引文网络。大型真实世界引文数据集的实验显示过度概率优于其他两个算法。我们还提供了一个简单的纸张搜索和推荐系统。根据用户的相关性判断,我们进一步证明了过度统计学的效果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号