26 citations · 86 across the 9 of their papers we have counts for
9 papers
Efficient and Effective Algorithms for A Family of Influence Maximization Problems with A Matroid Constraint
Yiqian Huang, Shiqi Zhang, Laks V. S. Lakshmanan +3
Influence maximization (IM) is a classic problem that aims to identify a small group of critical individuals, known as seeds, who can influence the largest number of users in a soc…
Capacity Constrained Influence Maximization in Social Networks
Shiqi Zhang, Yiqian Huang, Jiachen Sun +3
Influence maximization (IM) aims to identify a small number of influential individuals to maximize the information spread and finds applications in various fields. It was first int…
Influence Maximization in Real-World Closed Social Networks
Shixun Huang, Wenqing Lin, Zhifeng Bao +1
In the last few years, many closed social networks such as WhatsAPP and WeChat have emerged to cater for people's growing demand of privacy and independence. In a closed social net…
Measuring Friendship Closeness: A Perspective of Social Identity Theory
Shiqi Zhang, Jiachen Sun, Wenqing Lin +2
Measuring the closeness of friendships is an important problem that finds numerous applications in practice. For example, online gaming platforms often host friendship-enhancing ev…
Large-Scale Network Embedding in Apache Spark
Wenqing Lin
Network embedding has been widely used in social recommendation and network analysis, such as recommendation systems and anomaly detection with graphs. However, most of previous ap…
Efficient Algorithms for Approximate Single-Source Personalized PageRank Queries
Sibo Wang, Renchi Yang, Runhui Wang +5
Given a graph , a source node and a target node , the personalized PageRank (PPR) of with respect to is the probability that a random walk starting from termi…
Initialization for Network Embedding: A Graph Partition Approach
Wenqing Lin, Feng He, Faqiang Zhang +2
Network embedding has been intensively studied in the literature and widely used in various applications, such as link prediction and node classification. While previous work focus…
Distributed Algorithms for Fully Personalized PageRank on Large Graphs
Wenqing Lin
Personalized PageRank (PPR) has enormous applications, such as link prediction and recommendation systems for social networks, which often require the fully PPR to be known. Beside…
Efficient Single-Source Shortest Path and Distance Queries on Large Graphs
Andy Diwen Zhu, Xiaokui Xiao, Sibo Wang +1
This paper investigates two types of graph queries: {\em single source distance (SSD)} queries and {\em single source shortest path (SSSP)} queries. Given a node in a graph …