Motif adjacency matrix and spectral clustering of directed weighted networks
In the spectral clustering methods, different from the network division based on edges, some research has begun to divide the network based on network motifs; the corresponding objective function of partition also becomes related to the motif information. But, the related research on the directed we...
Main Authors: | Yike Wang, Gaoxia Wang, Ximei Hou, Fan Yang |
---|---|
Format: | Article |
Language: | English |
Published: |
AIMS Press
2023-04-01
|
Series: | AIMS Mathematics |
Subjects: | |
Online Access: | https://www.aimspress.com/article/doi/10.3934/math.2023706?viewType=HTML |
Similar Items
-
Motif-based spectral clustering of weighted directed networks
by: William G. Underwood, et al.
Published: (2020-09-01) -
Comparison of discriminative motif optimization using matrix and DNA shape-based models
by: Shuxiang Ruan, et al.
Published: (2018-03-01) -
Clustering Based on Eigenvectors of the Adjacency Matrix
by: Lucińska Małgorzata, et al.
Published: (2018-12-01) -
MODSIDE: a motif discovery pipeline and similarity detector
by: Ngoc Tam L. Tran, et al.
Published: (2018-10-01) -
A Survey of Measures for Network Motifs
by: Feng Xia, et al.
Published: (2019-01-01)