Motif-Based Spectral Clustering of Weighted Directed Networks

2020-04-02 · William George Underwood, Andrew Elliott, Mihai Cucuringu

Clustering is an essential technique for network analysis, with applications in a diverse range of fields. Although spectral clustering is a popular and effective method, it fails to consider higher-order structure and can perform poorly on directed networks. One approach is to capture and cluster higher-order structures using motif adjacency matrices. However, current formulations fail to take edge weights into account, and thus are somewhat limited when weight is a key component of the network under study. We address these shortcomings by exploring motif-based weighted spectral clustering methods. We present new and computationally useful matrix formulae for motif adjacency matrices on weighted networks, which can be used to construct efficient algorithms for any anchored or non-anchored motif on three nodes. In a very sparse regime, our proposed method can handle graphs with a million nodes and tens of millions of edges. We further use our framework to construct a motif-based approach for clustering bipartite networks. We provide comprehensive experimental results, demonstrating (i) the scalability of our approach, (ii) advantages of higher-order clustering on synthetic examples, and (iii) the effectiveness of our techniques on a variety of real world data sets; and compare against several techniques from the literature. We conclude that motif-based spectral clustering is a valuable tool for analysis of directed and bipartite weighted networks, which is also scalable and easy to implement.

📄 PDF Abstract BibTeX arXiv:2004.01293

Code (3)

WGUNDERWOOD/motifcluster 공식 구현

wgunderwood/motif-based-clustering 공식 구현

cran/motifcluster

Tasks

Clustering

Methods 이 논문이 사용한 방법론

Spectral Clustering Spectral clustering has attracted increasing attention due to the promising ability in dealing with nonlinearly separable datasets [15], [16]. In spectral clustering, the…

MotifNet: a motif-based Graph Convolutional Network for directed graphs

2018-02-04 · Federico Monti, Karl Otness, Michael M. Bronstein

Deep learning on graphs and in particular, graph convolutional neural networks, have recently attracted significant attention in the machine learning community. Many of such techniques explore the analogy between the gra…

BIG-bench Machine Learning

KCoreMotif: An Efficient Graph Clustering Algorithm for Large Networks by Exploiting k-core Decomposition and Motifs

2020-08-21 · Gang Mei, Jingzhi Tu, Lei Xiao, Francesco Piccialli

Clustering analysis has been widely used in trust evaluation on various complex networks such as wireless sensors networks and online social networks. Spectral clustering is one of the most commonly used algorithms for g…

Clustering Graph Clustering

Higher-Order Spectral Clustering under Superimposed Stochastic Block Model

2018-12-16 · Subhadeep Paul, Olgica Milenkovic, Yuguo Chen

Higher-order motif structures and multi-vertex interactions are becoming increasingly important in studies that aim to improve our understanding of functionalities and evolution patterns of networks. To elucidate the rol…

Clustering Community Detection Stochastic Block Model

Motivic clustering schemes for directed graphs

2020-01-01 · Facundo Mémoli, Guilherme Vituri F. Pinto

Motivated by the concept of network motifs we construct certain clustering methods (functors) which are parametrized by a given collection of motifs (or representers).