Tiantian Chen

Tiantian Chen

Auto-generated profile, based on publicly available information

Tiantian Chen

Department of Mathematics and Computer Science, Santa Clara University, Santa Clara, CA, USA

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 May 2023 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
TCTiantian Chen
Tiantian Chen
SYSiwen Yan
Siwen Yan
JGJianxiong Guo
Jianxiong Guo
WWWeili Wu
Weili Wu
Aiming at selecting a small subset of nodes with maximum influence on networks, the influence maximization (IM) problem has been extensively studied. Since it is #P-hard to compute the influence spread given a seed set, the state-of-the-art methods, including heuristic and approximation algorithms, are faced with great difficulties such as theoretical guarantee, time efficiency, generalization, and so on. This makes it unable to adapt to large-scale networks and more complex applications. On the other side, with the latest achievements of deep reinforcement learning (DRL) in artificial intelligence and other fields, lots of work have been focused on exploiting DRL to solve combinatorial optimization (CO) problems. Inspired by this, we propose a novel end-to-end DRL framework, ToupleGDD, to address the IM problem in this article, which incorporates three coupled graph neural networks (GNNs) for network embedding and double deep $Q$ -networks (DQNs) for parameters learning. Previous efforts to solve the IM problem with DRL trained their models on subgraphs of the whole network and then tested them on the whole graph, which makes the performance of their models unstable among different networks. However, our model is trained on several small randomly generated graphs with a small budget and tested on completely different networks under various large budgets, which can obtain results very close to IMM and better results than OPIM-C on several datasets and shows strong generalization ability. Finally, we conduct a large number of experiments on synthetic and realistic datasets and experimental results prove the effectiveness and superiority of our model.

29 October 2020 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
JGJianxiong Guo
Jianxiong Guo
TCTiantian Chen
Tiantian Chen
WWWeili Wu
Weili Wu
Online social networks provide a convenient platform for the spread of rumors, which could lead to serious aftermaths such as economic losses and public panic. The classical rumor blocking problem aims to launch a set of nodes as a positive cascade to compete with misinformation in order to limit the spread of rumors. However, most of the related researches were based on a one-dimensional diffusion model. In reality, there is more than one feature associated with an object. A user's impression on this object is determined not just by one feature but by her overall evaluation of all features associated with it. Thus, the influence spread of this object can be decomposed into the spread of multiple features. Based on that, we design a multi-feature diffusion model (MF-model) in this paper and formulate a multi-feature rumor blocking (MFRB) problem on a multi-layer network structure according to this model. To solve the MFRB problem, we design a creative sampling method called Multi-Sampling, which can be applied to this multi-layer network structure. Then, we propose a Revised-IMM algorithm and obtain a satisfactory approximate solution to MFRB. Finally, we evaluate our proposed algorithm by conducting experiments on real datasets, which shows the effectiveness of our Revised-IMM and its advantage to their baseline algorithms.

28 October 2019 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
TCTiantian Chen
Tiantian Chen
WLWenjing Liu
Wenjing Liu
QFQizhi Fang
Qizhi Fang
JGJianxiong Guo
Jianxiong Guo
DDDing-Zhu Du
Ding-Zhu Du
The widespread and effective online social networks may cause misinformation to diffuse in the networks, which could lead to public panic and even serious economic consequences. The classical misinformation containment (MC) problem aims to select a small node set as positive seeds to compete against the misinformation and limit the influence of misinformation as much as possible, where the misinformation seed set is given. Most of the prior works concentrate on either minimizing the number of users infected by misinformation or maximizing the number of users protected by the positive cascade. That is, they only concentrate on optimizing the number of nodes. However, the interaction effects between nodes differ from user to user and the related profit obtained from interaction activities may also be different. This article proposes a novel problem, called profit minimization of misinformation (PMM), which is the first to analyze the profit of activity in the MC problem. Given a misinformation seed set, the PMM problem aims at selecting a node set satisfying the cardinality constraint to minimize the profit of edges starting from infected nodes but ending at infected or protected nodes. Based on the sandwich method, we design a data-dependent approximation scheme for the PMM problem. We approximate the upper and lower bounds of the objective in the equivalent problem by the reverse influence sampling technique. Our algorithm is verified on realistic data sets, which demonstrate the superiority of our method.

8 January 2020 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
JGJianxiong Guo
Jianxiong Guo
TCTiantian Chen
Tiantian Chen
WWWeili Wu
Weili Wu
A problem, Budget Profit Maximization with Coupon Advertisement, is formulated in this paper, which is a branch of classical profit maximization problem in social networks. Learned from the lastest results, we proposed the B-Framework, which combines the ideas of Random Greedy and Continuous Double Greedy to obtain a more acceptable approximation ratio for this problem. For Continuous Double Greedy, it can be implemented by multilinear extension and discretized techniques. In addition, most of existing researches consider only maximizing total profit, however, in real scenarios, the diffusion probability is hard to determine due to the uncertainty. Then, we study the robustness for budgeted profit maximization, which can be used as a general strategy to analyze the robustness of non-monotone submodular function. It aims to obtain the best solution maximizing the ratio between the profit of any feasible seed set and the optimal seed set. We design LU-B-Framework first, and then we apply the method of uniform sampling to improve the robustness by reducing the uncertainty. The effectiveness and correctness of our algorithms are evaluated by heavily simulation on real-world social networks eventually.

1 January 2020 in Theoretical Computer Science
Verified
Journal Article
Closed access
TCTiantian Chen
Tiantian Chen
BLBin Liu
Bin Liu
WLWenjing Liu
Wenjing Liu
QFQizhi Fang
Qizhi Fang
JYJing Yuan
Jing Yuan
WWWeili Wu
Weili Wu

7 May 2020 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
JGJianxiong Guo
Jianxiong Guo
TCTiantian Chen
Tiantian Chen
WWWeili Wu
Weili Wu
In this paper, we extend activity maximization problem to that under the general marketing strategy χ, which is a d-dimensional vector from a lattice space and has probability $h_u(\vec{x})$ to activate a node u as a seed. Based on that, we propose the continuous activity maximization (CAM) problem, where the domain is continuous and the seed set we select conforms to a certain probability distribution. It is a new topic to study the problem about information diffusion under the lattice constraint, thus, we address the problem systematically here. First, we analyze the hardness of CAM and how to compute the objective function of CAM accurately and effectively. We prove this objective function is monotone, but not DR-submodular and not DR-supermodular. Then, we develop a monotone and DR-submodular lower bound and upper bound of CAM, and apply sampling techniques to design three unbiased estimators for CAM, its lower bound and upper bound. Next, adapted from IMM algorithm and sandwich approximation framework, we obtain a data-dependent approximation ratio. This process can be considered as a general method to solve those maximization problem on lattice but not DR-submodular.