4 citations · 4 across the 5 of their papers we have counts for
5 papers
Degree-Mass Message Passing for Betweenness Ranking in Directed and Undirected Networks
Justin Dachille, Aurora Rossi, Sunil Kumar Maurya +5
Computing the importance of nodes in networks is a long-standing fundamental problem that has driven extensive study of various centrality measures. A particularly well-known centr…
Oldie but Goodie: Re-illuminating Label Propagation on Graphs with Partially Observed Features
Sukwon Yun, Xin Liu, Yunhak Oh +4
In real-world graphs, we often encounter missing feature situations where a few or the majority of node features, e.g., sensitive information, are missed. In such scenarios, direct…
Towards Personalized Federated Multi-Scenario Multi-Task Recommendation
Yue Ding, Yanbiao Ji, Xun Cai +7
In modern recommender systems, especially in e-commerce, predicting multiple targets such as click-through rate (CTR) and post-view conversion rate (CTCVR) is common. Multi-task re…
DEGNN: Dual Experts Graph Neural Network Handling Both Edge and Node Feature Noise
Tai Hasegawa, Sukwon Yun, Xin Liu +2
Graph Neural Networks (GNNs) have achieved notable success in various applications over graph data. However, recent research has revealed that real-world graphs often contain noise…
Future-Proofing Class-Incremental Learning
Quentin Jodelet, Xin Liu, Yin Jun Phua +1
Exemplar-Free Class Incremental Learning is a highly challenging setting where replay memory is unavailable. Methods relying on frozen feature extractors have drawn attention recen…