AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Article Link
Collect
Submit Manuscript
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Regular Paper

Accumulative Time Based Ranking Method to Reputation Evaluation in Information Networks

National Engineering Laboratory on Big Data System Computing Technology, College of Computer Science and Software Engineering, Shenzhen University, Shenzhen 518060, China
Guangdong Province Key Laboratory of Popular High Performance Computers, Shenzhen University Shenzhen 518060, China
Guangdong Province Engineering Center of China-Made High Performance Data Computing System, College of Computer Science and Software Engineering, Shenzhen University, Shenzhen 518060, China
Institute of Big Data Intelligent Management and Decision, Shenzhen University, Shenzhen 518060, China
Department of Science and Environmental Studies, The Education University of Hong Kong, Hong Kong 999077, China
Department of Physics, University of Fribourg, Fribourg 1700, Switzerland
Show Author Information

Abstract

Due to over-abundant information on the Web, information filtering becomes a key task for online users to obtain relevant suggestions and how to extract the most related item is always a key topic for researchers in various fields. In this paper, we adopt tools used to analyze complex networks to evaluate user reputation and item quality. In our proposed Accumulative Time Based Ranking (ATR) algorithm, we take into account the growth record of the network to identify the evolution of the reputation of users and the quality of items, by incorporating two behavior weighting factors which can capture the hidden facts on reputation and quality dynamics for each user and item respectively. Our proposed ATR algorithm mainly combines the iterative approach to rank user reputation and item quality with temporal dependence compared with other reputation evaluation methods. We show that our algorithm outperforms other benchmark ranking algorithms in terms of precision and robustness on empirical datasets from various online retailers and the citation datasets among research publications. Therefore, our proposed method has the capability to effectively evaluate user reputation and item quality.

Electronic Supplementary Material

Download File(s)
0471_ESM.pdf (393.4 KB)

References

【1】
【1】
 
 
Journal of Computer Science and Technology
Pages 960-974

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Liao H, Liu Q-X, Huang Z-C, et al. Accumulative Time Based Ranking Method to Reputation Evaluation in Information Networks. Journal of Computer Science and Technology, 2022, 37(4): 960-974. https://doi.org/10.1007/s11390-021-0471-4

664

Views

8

Crossref

6

Web of Science

6

Scopus

0

CSCD

Received: 27 March 2020
Revised: 28 August 2021
Accepted: 03 December 2021
Published: 25 July 2022
©Institute of Computing Technology, Chinese Academy of Sciences 2022