Journal
IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING
Volume 9, Issue 4, Pages 1987-2003Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TETC.2019.2952765
Keywords
Big scholarly data; knowledge graphs; semantic network mining; community mining
Ask authors/readers for more resources
The framework proposed in this article, named DICO, identifies overlapped communities of authors from Big Scholarly Data by modeling authors' interactions. DICO has three distinctive characteristics: a novel approach for building coauthorship network, a new community detection algorithm based on Node Location Analysis, and provided built-in queries.
The widespread use of online social networks has also involved the scientific field in which researchers interact each other by publishing or citing a given paper. The huge amount of information about scientific research documents has been described through the term Big Scholarly Data. In this article we propose a framework, namely Discovery Information using COmmunity detection (DICO), for identifying overlapped communities of authors from Big Scholarly Data by modeling authors' interactions through a novel graph-based data model combining jointly document metadata with semantic information. In particular, DICO presents three distinctive characteristics: i) the coauthorship network has been built from publication records using a novel approach for estimating relationships weight between users; ii) a new community detection algorithm based on Node Location Analysis has been developed to identify overlapped communities; iii) some built-in queries are provided to browse the generated network, though any graph-traversal query can be implemented through the Cypher query language. The experimental evaluation has been carried out to evaluate the efficacy of the proposed community detection algorithm on benchmark networks. Finally, DICO has been tested on a real-world Big Scholarly Dataset to show its usefulness working on the DBLP+AMiner dataset, that contains 1.7M+ distinct authors, 3M+ papers, handling 25M+ citation relationships.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available