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

Shuting Tian

dblp:394/8711 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0006-6152-5590ORCID · reported

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

Software engineering, systems software and programming languages · 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
Recommender systems · 100%
Computer networks
1 paper
Network measurement and analytics · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › graph neural network
graph convolutional network
0.812024
Effective Graph Modeling and Contrastive Learning for Time-Aware QoS Prediction · IEEE Trans. Serv. Comput. 2024
Machine learning › Graph learning
graph representation learning
0.812024
Effective Graph Modeling and Contrastive Learning for Time-Aware QoS Prediction · IEEE Trans. Serv. Comput. 2024
Recommender systems
qos prediction
0.812024
Effective Graph Modeling and Contrastive Learning for Time-Aware QoS Prediction · IEEE Trans. Serv. Comput. 2024

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

graph modeling · 2.3graph convolutional network · 2.3contrastive learning · 2.3
YearPublicationVenuePosition
2024 Effective Graph Modeling and Contrastive Learning for Time-Aware QoS Prediction
abstract
Accurate and reliable service quality prediction has become a key issue in service recommendation and network measurement scenarios. However, traditional methods for time-aware QoS prediction face two main challenges: (I) data sparsity makes it difficult to estimate and recover global information from the limited known data; (II) shallow learning models struggle to represent the intricate relationships between objects, and thus suffer poor prediction performance. To this end, we propose a time-aware QoS prediction framework that combines the merits of graph modeling, graph representation learning, and contrastive learning. First, a novel graph schema is proposed to capture the complex interactions between user-service-slots. Then, a prediction model is developed leveraging a graph convolutional network to learn the node representations by aggregating feature information from neighboring nodes. Finally, a novel contrastive learning strategy is used to improve the robustness of node representation. Experimental results on a large-scale dataset demonstrated that our proposed method significantly outperforms the state-of-the-art prediction methods on response time and throughput prediction tasks.
Hao Wu 0010, Shuting Tian, Binbin Jin, Yiji Zhao, Lei Zhang 0130
IEEE Trans. Serv. Comput.2