Email this article 
Open Access
Subscription or Fee Access
Algorithm to Evaluate the Rank of Research Papers using Citation Graph
Abstract
We present a unique approach that uses closed
frequent keyword-set to form topics. Our approach also provides an efficient method to rank the research papers from different area researches published in various conferences time to time This Ranking method is based on Citation Graph. To rank the research papers in the topic , We devise the modified ranking Algorithm that
assigns an authoritative score to each research paper by considering the sub graph in which the research appears. We rank the research papers assigning each of them an authoritative score. We explore the
use of Ranking Algorithm using the citation Graph between papers to create the rating matrix. We have also explored a new metric in the ranking of the research papers to reduce the bias against the different papers published recently which is the result to get less time to study and at
the same time cited by researchers as compared to previously
published papers.
Keywords
References
Brin, S., & Page, L. (1998). The anatomy of a large-scale hypertextual
Web search engine. Proceedings of the seventh international conference
on World Wide Web, 107-117.
Burt, R. S. (2002). The Social Capital of Structural Holes. In M. F.
Guillén, R. Collins, P. England, & M.
Russell (Ed.), New Directions in Economic Sociology (pp. 203-247).
Thousand Oaks, CA: Sage
S. Brin, and L. Page, “The Anatomy of a Large- Scale Hypertextual
Web Search Engine,” Proceedings of the 7th international conference on
World Wide Web (WWW), 1998.
The DBLP Computer Science Bibliography. http://dblp.uni-trier.de/
Y. Ding, E. Yan, A. Frazho, J. Caverlee, “PageRank for Ranking
Authors in Co-citation Networks,” Journal of the American Society for
Information Science and Technology, 2009.
E. Garfield, “The History and Meaning of the Journal Impact Factor,”
Journal of the American Medical Association, 2006.
J. E. Hirsch, “An Index to Quantify an Individual’s Scientific Research
Output,” Proceedings of National Academy of Sciences, 2005.
J. Klienberg, “Authoritative sources in a hyperlinked environment,”
Proceeding of the 9th Annual ACM- SIAM Symposium on Discrete
Algorithms, 1998.
L. Page, S. Brin, R. Motwani, and T. Winograd, “The PageRank Citation
Ranking: Bringing Order to the Web,” Technical Report, Stanford
InfoLab, 1999.
J. Tang, J. Zhang, L. Yao, J. Li, L. Zhang, Z. Su, “Arnetminer:
Extraction and Mining of Academic Social Networks,” Proceedings of 14th ACM SIGKDD International Conference on Knowledge Discovery
and Data Mining, 2008.
Q. Zhao, S. S. Bhowmick, X. Zheng, “Characterizing and Predicting
Community Members from Evolutionary and Heterogeneous Networks,”
Proceedings of the 17th Conference on Knowledge Management, 2008.
Sidiropoulos, A., & Manolopoulos, Y. (2006). A Generalized
comparison of graph-based ranking algorithms for publications and
authors. Journal of Systems and Software, 79(12), 1679-1700.
Small, H. (1973). Cocitation in science literature: New measures of
relationship between two documents. Journal of the American Society
for Information Science, 24(4), 265-269.
White, H. D., & McCain, K. W. (1998). Visualizing a discipline: An
author cocitation analysis of information science 1972-1995. Journal of
the American Society for Information Science, 49, 327-355.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.