Scalable Motif-aware Graph Clustering-Reference-Cited by-同舟云学术

Scalable Motif-aware Graph Clustering

Published:2017-04-03 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 26th International Conference on World Wide Web
language:
Short-container-title:

Author:

Tsourakakis Charalampos E.¹,Pachocki Jakub²,Mitzenmacher Michael²

Affiliation:

1. Harvard University & Boston University, Cambridge, MA, USA

2. Harvard University, Cambridge, MA, USA

Funder

NSF

ONR

Publisher

International World Wide Web Conferences Steering Committee

Link

https://dl.acm.org/doi/pdf/10.1145/3038912.3052653

Reference43 articles.

1. Mace. http://research.nii.ac.jp/~uno/codes.htm. Mace. http://research.nii.ac.jp/~uno/codes.htm.

2. Stanford network analysis project. http://snap.stanford.edu/data/index.html. Stanford network analysis project. http://snap.stanford.edu/data/index.html.

3. On the separability of structural classes of communities

4. CFinder: locating cliques and overlapping modules in biological networks

5. Better expanders and superconcentrators

Cited by 111 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Multi-order graph clustering with adaptive node-level weight learning;Pattern Recognition;2024-12

2. Motif-Based Contrastive Learning for Community Detection;IEEE Transactions on Neural Networks and Learning Systems;2024-09

3. PSMC: Provable and Scalable Algorithms for Motif Conductance Based Graph Clustering;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

4. An Elemental Decomposition of DNS Name-to-IP Graphs;IEEE INFOCOM 2024 - IEEE Conference on Computer Communications;2024-05-20

5. From Motif to Path: Connectivity and Homophily;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13