3 papers
cs.LG2026
Degree-Mass Message Passing for Betweenness Ranking in Directed and Undirected Networks
Justin Dachille, Aurora Rossi, Sunil Kumar Maurya +6
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…
cs.LG2025
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…
cs.LG2025
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…