Clustering and Closure Coefficient Based on k-CT Components
Real-world networks contain many cliques since they are usually built from them. The analysis that goes behind the cliques is fundamental because it discovers the real structure of the network. This article proposed new high-order closed trail clustering and closure coefficients for evaluation of th...
Main Authors: | Petr Prokop, Vaclav Snasel, Pavla Drazdilova, Jan Platos |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9103498/ |
Similar Items
-
Cliques Are Bricks for k-CT Graphs
by: Václav Snášel, et al.
Published: (2021-05-01) -
Statistical analysis of the phytocoenose homogeneity. V. Frequency distributions of similarity and distance coefficients as a function of the area size
by: Anna J. Kwiatkowska, et al.
Published: (2014-01-01) -
Closed trail distance in a biconnected graph.
by: Vaclav Snasel, et al.
Published: (2018-01-01) -
Numerical Simulation And Experimental Correlation Of Crack Closure Phenomenon Under Cyclic Loading
by: Seshadri, B R
Published: (2013) -
Temporal and spatial variation of refractive index structure coefficient over South China sea
by: Shiyong Shao, et al.
Published: (2021-03-01)