3 papers
cs.DS2026
From Enumeration to Covering: Near-Optimal Densest P-Partite Subgraph Search over Large Heterogeneous Information Networks
Lu Chen, Chengfei Liu, Rui Zhou +2
Given a heterogeneous information network (HIN) and a query meta-path P of length i, the densest P-partite subgraph problem finds the subgraph, spanning the i typed layers of P, th…
cs.IR2026
Federated Learning and Unlearning for Recommendation with Personalized Data Sharing
Liang Qu, Jianxin Li, Wei Yuan +4
Federated recommender systems (FedRS) have emerged as a paradigm for protecting user privacy by keeping interaction data on local devices while coordinating model training through…
cs.DB2025
Efficient Size Constraint Community Search over Heterogeneous Information Networks
Xinjian Zhang, Lu Chen, Chengfei Liu +2
The goal of community search in heterogeneous information networks (HINs) is to identify a set of closely related target nodes that includes a query target node. In practice, a siz…