A novel approach to Rank Authors in an Academic Network

Ranking the authors in an academic network is a significant research domain to find the top authors in various domains. We find various links based ranking algorithms and index based approaches to measure the productivity and impact of an author in a social network of authors. The research problem t...

Full description

Saved in:
Bibliographic Details
Published in:International journal of computer science and information security 2016-07, Vol.14 (7), p.617-617
Main Authors: Farooq, Muhammad, Khan, Hikmat Ullah, Malik, Tahir Afzal, Shah, Syed Muhammad Saqlain
Format: Article
Language:English
Subjects:
Algorithms
Bibliographic literature
Citations
Computer information security
Hirsch index
Methods
Networks
Productivity
Quality
Ranking
Ratings & rankings
Researchers
Scholars
Search engines
Social networks
State of the art
Studies
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Ranking the authors in an academic network is a significant research domain to find the top authors in various domains. We find various links based ranking algorithms and index based approaches to measure the productivity and impact of an author in a social network of authors. The research problem to rank the experts has vast applications such as advisor finding, domain expert identification. In this paper, we propose a novel approach to rank the scholars in the academic network of DBLP, a well-known computer science bibliography website. A huge data set is prepared covering the publications of more than 70 years. We propose AuthorRank and Weighted AuthorRank algorithms based on the state of the art ranking algorithms of PageRank and weighted PageRank algorithms respectively. For weighted algorithms, existing methods lack to provide diverse weights. We introduce the novel weights of h-index, g-index and R-index and elaborate their impact to identify the top authors in the scholarly network. The results confirm that the proposed algorithms find the top authors in an effective manner.
ISSN:1947-5500