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

Caipiao Yang

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

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

Databases, data management, data science and information retrieval · 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.

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

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

TopicWeightPapersLastEvidence papers
Web and social media mining
information diffusion
0.812024
Popularity Prediction via Modeling Temporal Dependencies on Dynamic Evolution Process · IEEE Trans. Knowl. Data Eng. 2024
Web and social media mining
popularity prediction
0.812024
Popularity Prediction via Modeling Temporal Dependencies on Dynamic Evolution Process · IEEE Trans. Knowl. Data Eng. 2024
Machine learning › Graph learning
dynamic graph learning
0.212024
Popularity Prediction via Modeling Temporal Dependencies on Dynamic Evolution Process · IEEE Trans. Knowl. Data Eng. 2024

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

temporal encoder · 1.5sequence modeling · 1.5
YearPublicationVenuePosition
2024 Popularity Prediction via Modeling Temporal Dependencies on Dynamic Evolution Process
abstract
Predicting the future popularity of individual information cascades has attracted much attention in various application fields. It is significantly important for online advertising, viral marketing, rumor detection, and social recommendation. Most approaches target modeling forwarding path or learning important information from discrete static graph. These methods either extract complicated hand-crafted features that rely on domain knowledge and have lower generality, or devote to modeling the arriving intensity function of each message and cannot be optimized for the final popularity. Despite some approaches trying to utilize the underlying structural information in discrete snapshots, they neglect to model the temporal information that implicitly underlying abundant diffusion patterns. Meanwhile, they ignore the inherent dependencies among forwarding behaviors of users. In this paper, we propose a novel learning framework for popularity prediction via modeling temporal dependencies on dynamic evolution process, called TEDDY. Our framework not only models the temporal evolution in a separate snapshot via multiple sequences temporal encoder, but also captures the inherent temporal dependencies among different snapshots. We have conducted extensive experiments on two real-world datasets, i.e. Sina Weibo and American Physical Society. Experimental results demonstrate that our proposed TEDDY significantly improves the prediction accuracy and is superior to the state-of-the-art approaches.
Peng Bao 0003, Caipiao Yang
IEEE Trans. Knowl. Data Eng.3