Understanding graph-based trust evaluation in online social networks: Methodologies and challenges

W Jiang, G Wang, MZA Bhuiyan, J Wu - Acm Computing Surveys (Csur), 2016 - dl.acm.org
Online Social Networks (OSNs) are becoming a popular method of meeting people and
keeping in touch with friends. OSNs resort to trust evaluation models and algorithms to …

Deep representation learning for social network analysis

Q Tan, N Liu, X Hu - Frontiers in big Data, 2019 - frontiersin.org
Social network analysis is an important problem in data mining. A fundamental step for
analyzing social networks is to encode network data into low-dimensional representations …

Deep graph representation learning and optimization for influence maximization

C Ling, J Jiang, J Wang, MT Thai… - International …, 2023 - proceedings.mlr.press
Influence maximization (IM) is formulated as selecting a set of initial users from a social
network to maximize the expected number of influenced users. Researchers have made …

Influence maximization on social graphs: A survey

Y Li, J Fan, Y Wang, KL Tan - IEEE Transactions on Knowledge …, 2018 - ieeexplore.ieee.org
Influence Maximization (IM), which selects a set of k users (called seed set) from a social
network to maximize the expected number of influenced users (called influence spread), is a …

[图书][B] Recommender systems

CC Aggarwal - 2016 - Springer
“Nature shows us only the tail of the lion. But I do not doubt that the lion belongs to it even
though he cannot at once reveal himself because of his enormous size.”–Albert Einstein The …

Social big data: Recent achievements and new challenges

G Bello-Orgaz, JJ Jung, D Camacho - Information Fusion, 2016 - Elsevier
Big data has become an important issue for a large number of research areas such as data
mining, machine learning, computational intelligence, information fusion, the semantic Web …

Influence maximization in near-linear time: A martingale approach

Y Tang, Y Shi, X Xiao - Proceedings of the 2015 ACM SIGMOD …, 2015 - dl.acm.org
Given a social network G and a positive integer k, the influence maximization problem asks
for k nodes (in G) whose adoptions of a certain idea or product can trigger the largest …

Community-diversified influence maximization in social networks

J Li, T Cai, K Deng, X Wang, T Sellis, F Xia - Information Systems, 2020 - Elsevier
To meet the requirement of social influence analytics in various applications, the problem of
influence maximization has been studied in recent years. The aim is to find a limited number …

Influence maximization: Near-optimal time complexity meets practical efficiency

Y Tang, X Xiao, Y Shi - Proceedings of the 2014 ACM SIGMOD …, 2014 - dl.acm.org
Given a social network G and a constant k, the influence maximization problem asks for k
nodes in G that (directly and indirectly) influence the largest number of nodes under a pre …

Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks

HT Nguyen, MT Thai, TN Dinh - … of the 2016 international conference on …, 2016 - dl.acm.org
Influence Maximization (IM), that seeks a small set of key users who spread the influence
widely into the network, is a core problem in multiple domains. It finds applications in viral …