OverCite: Finding overlapping communities in citation network

Tanmoy Chakraborty, Abhijnan Chakraborty
{"title":"OverCite: Finding overlapping communities in citation network","authors":"Tanmoy Chakraborty, Abhijnan Chakraborty","doi":"10.1145/2492517.2500255","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":442230,"journal":{"name":"2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2492517.2500255","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

Abstract

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:在引文网络中寻找重叠的社区
引文分析是一个热门的研究领域,通常用于对研究论文的作者和发表地点进行排名。由于每年出版的出版物数量巨大,用户很难找到相关的出版物资料。解决这一问题的一个简单方法是从引文网络中检测社区,并根据社区的共同成员资格推荐论文。但是,在当今的研究情况下,许多研究人员感兴趣的领域向多个研究方向扩展,导致跨学科出版物越来越多。因此,有必要检测重叠的社区,以便进行相关的推荐。在本文中,我们将出版信息表示为一个由作者、论文和出版场所(会议/期刊)组成的三方“出版超图”。然后,我们提出了一种名为“OverCite”的算法,该算法可以利用出版超图和引文网络信息同时检测作者、论文和场地的重叠社区。我们将OverCite与现有的两种用于引文网络的重叠社区检测算法Clique per渗法(CPM)和iLCD进行了比较。在大型真实引文数据集上的实验表明,OverCite优于其他两种算法。我们还提出了一个简单的论文搜索和推荐系统。基于用户的相关性判断,我们进一步证明了OverCite优于其他两种算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信