Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ziang Tu

dblp:355/8760 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Graph learning · 100%
Databases, data mining, and information retrieval
1 paper
Web and social media mining · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › graph neural network
dynamic graph neural network
0.712023
DTrust: Toward Dynamic Trust Levels Assessment in Time-Varying Online Social Networks · INFOCOM 2023
Web and social media mining
online social networks
0.212023
DTrust: Toward Dynamic Trust Levels Assessment in Time-Varying Online Social Networks · INFOCOM 2023
Web and social media mining
trust assessment
0.212023
DTrust: Toward Dynamic Trust Levels Assessment in Time-Varying Online Social Networks · INFOCOM 2023

Methods — techniques the papers use, named apart from their topics

gated recurrent unit · 1.3edge-conditioned convolution · 1.3
YearPublicationVenuePosition
2024 RTrust: toward robust trust evaluation framework for fake news detection in online social networks
Nan Jiang 0013, Ziang Tu, Kanglu Pei, Hualin Zhan, Ximeng Liu, Weihao Gu, Sen Qiu
World Wide Web (WWW)2
2023 DTrust: Toward Dynamic Trust Levels Assessment in Time-Varying Online Social Networks
abstract
The social trust assessment can spur extensive applications such as social recommendations, shopping, financial investment strategies, etc, but remain a challenging problem having limited exploration. Such explorations mainly limit their studies to static network topology or simplified dynamic networks, toward the social trust relationship prediction. In contrast, in this paper, we explore the social trust by taking into account the time-varying online social networks whereas the social trust relationship may vary over time. The DTrust, a dynamic graph neural network-based solution, will be proposed for accurate social trust prediction. In particular, DTrust is composed of a static aggregation unit and a dynamic unit, respectively responsible for capturing both the spatial dependence features and temporal dependence features. In the former unit, we stack multiple NNConv layers derived from the edge-conditioned convolution network for capturing the spatial dependence features correlated to the network topology and the observed social relationships. In the latter unit, a gated recurrent unit (GRU) is employed for learning the evolution law of social interaction and social trust relationships. Based on the extracted spatial and temporal features, we then employ a fully connected neural network for learning, able to predict the social trust relationships for both current and future time slots. Extensive experimental results exhibit that our DTrust can outperform the benchmark counterparts on two real-world datasets.
Nan Jiang 0013, Jin Li 0002, Ximeng Liu, Honglong Chen, Yanzhi Ren, Zhaohui Yuan, Ziang Tu
INFOCOM8
2023 NAH: neighbor-aware attention-based heterogeneous relation network model in E-commerce recommendation
Nan Jiang 0013, Zihao Hu, Weihao Gu, Ziang Tu, Ximeng Liu, Jianfei Gong, Fengtao Lin
World Wide Web (WWW)6