Motif-based embedding for graph clustering

DOI10.1088/1742-5468/2016/12/123401zbMath1456.68154OpenAlexW2558884239MaRDI QIDQ3302499

Sungsu Lim, Jae-Gil Lee

Publication date: 11 August 2020

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/1742-5468/2016/12/123401

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

On the analysis of fitness change: fitness-popularity dynamic network model with varying fitness ⋮ Comparison of fitness and popularity: fitness-popularity dynamic network model ⋮ On the effects of capability and popularity on network dynamics with applications to YouTube and Twitch networks

Uses Software

• GVF
• DBpedia

Cites Work

• Graph clustering
• Empirical Analysis of an Evolving Social Network
• Motif-based communities in complex networks
• Random graph models of social networks
• Fast unfolding of communities in large networks
• Energy Models for Graph Clustering

This page was built for publication: Motif-based embedding for graph clustering