activity
20202026
most citedRandom Walks: A Review of Algorithms and Applications

287 citations · 320 across the 11 of their papers we have counts for

collaborators

12 papers

cs.SI2026

Explaining Synergistic Effects in Social Recommendations

Yicong Li, Shan Jin, Qi Liu +6

In social recommenders, the inherent nonlinearity and opacity of synergistic effects across multiple social networks hinders users from understanding how diverse information is lev…

cs.IR2026

Bridging Semantic Understanding and Popularity Bias with LLMs

Renqiang Luo, Dong Zhang, Yupeng Gao +5

Semantic understanding of popularity bias is a crucial yet underexplored challenge in recommender systems, where popular items are often favored at the expense of niche content. Mo…

cs.CY2024

Algorithmic Fairness: A Tolerance Perspective

Renqiang Luo, Tao Tang, Feng Xia +5

Recent advancements in machine learning and deep learning have brought algorithmic fairness into sharp focus, illuminating concerns over discriminatory decision making that negativ…

cs.SI2022★ 2 cited

How to optimize an academic team when the outlier member is leaving?

Shuo Yu, Jiaying Liu, Feng Xia +2

An academic team is a highly-cohesive collaboration group of scholars, which has been recognized as an effective way to improve scientific output in terms of both quality and quant…

cs.LG2022★ 1 cited

Deep Graph Learning for Anomalous Citation Detection

Jiaying Liu, Feng Xia, Xu Feng +2

Anomaly detection is one of the most active research areas in various critical domains, such as healthcare, fintech, and public security. However, little attention has been paid to…

cs.DL2022★ 3 cited

Web of Scholars: A Scholar Knowledge Graph

Jiaying Liu, Jing Ren, Wenqing Zheng +3

In this work, we demonstrate a novel system, namely Web of Scholars, which integrates state-of-the-art mining techniques to search, mine, and visualize complex networks behind scho…

cs.SI2021★ 8 cited

Turing Number: How Far Are You to A. M. Turing Award?

Feng Xia, Jiaying Liu, Jing Ren +2

The ACM A.M. Turing Award is commonly acknowledged as the highest distinction in the realm of computer science. Since 1960s, it has been awarded to computer scientists who made out…

cs.SI2021★ 8 cited

Matching Algorithms: Fundamentals, Applications and Challenges

Jing Ren, Feng Xia, Xiangtai Chen +5

Matching plays a vital role in the rational allocation of resources in many areas, ranging from market operation to people's daily lives. In economics, the term matching theory is…

cs.LG2021

Graph Force Learning

Ke Sun, Jiaying Liu, Shuo Yu +2

Features representation leverages the great power in network analysis tasks. However, most features are discrete which poses tremendous challenges to effective use. Recently, incre…

cs.LG2020★ 10 cited

Shifu2: A Network Representation Learning Based Model for Advisor-advisee Relationship Mining

Jiaying Liu, Feng Xia, Lei Wang +4

The advisor-advisee relationship represents direct knowledge heritage, and such relationship may not be readily available from academic libraries and search engines. This work aims…

cs.SI2020★ 1 cited

DINE: A Framework for Deep Incomplete Network Embedding

Ke Hou, Jiaying Liu, Yin Peng +3

Network representation learning (NRL) plays a vital role in a variety of tasks such as node classification and link prediction. It aims to learn low-dimensional vector representati…

cs.SI2020★ 287 cited

Random Walks: A Review of Algorithms and Applications

Feng Xia, Jiaying Liu, Hansong Nie +3

A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disc…