DBScholar

Back to papers

Effective Clustering for Large Multi-Relational Graphs

Summary: DEMM and DEMM+: a two-stage MRGC method that (i) learns node features by optimizing multi-relational Dirichlet energy and (ii) clusters by minimizing Dirichlet energy on the affinity graph. DEMM+ adds an efficient solver and a theory-backed transform to enable linear-time clustering without forming the N×N affinity, achieving high-quality, scalable clustering on million-node MRGs. (summarized by gpt-5-mini on Feb 11 2026)

Paper ID
7570
Venue
SIGMOD
Year
2026
Pagerank
-
Overall Rank
13,289 | 8.83%
DOI
10.1145/3769784

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{lin_sigmod26,
        title = {{Effective Clustering for Large Multi-Relational Graphs}},
        author = {Lin, Xiaoyang and Jiang, Runhao and Yang, Renchi},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3769784},
        url = {https://dl.acm.org/doi/10.1145/3769784},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers