Results 41 to 50 of about 239,550 (307)
The intracluster correlation coefficient in cluster randomisation [PDF]
We have described the calculation of sample size when subjects are randomised in groups or clusters in terms of two variances—the variance of observations taken from individuals in the same cluster, sw 2, and the variance of true cluster means, s c 2.1 We described how such a study could be analysed using the sample cluster means. The variance of such
S M, Kerry, J M, Bland
openaire +2 more sources
An Improved Link Prediction Approach for Directed Complex Networks Using Stochastic Block Modeling
Link prediction finds the future or the missing links in a social–biological complex network such as a friendship network, citation network, or protein network.
Lekshmi S. Nair +2 more
doaj +1 more source
Special identity subgraph in genetic code [PDF]
The genetic code is a series of codons that stores genetic information about protein molecule formation. The identity graph of a group G is a graph in which the vertex set is the set of all elements of the group and two vertices in G are adjacent if a.b =
Birinchi Kumar Boruah, Tazid Ali
doaj
In this paper, we propose a new correlation coefficient between intuitionistic fuzzy sets. We then use this new result to compute some examples through which we find that it benefits from such an outcome with some well-known results in the literature. As
Thao, Nguyen Xuan +2 more
core +1 more source
A local search approach to silhouette-based clustering [PDF]
openClustering aims to split a set of objects into k groups (called clusters), in such a way each cluster contains similar objects and dissimilar objects find place in different clusters.
PERESSONI, DAVIDE
core
Clustering coefficient of the WION over time.
Panel (A) shows the average weighted clustering coefficient of the WION over time. Panel (B) further decomposes the clustering coefficient into domestic clustering coefficient and foreign clustering coefficient.
Alessandro Chessa (321177) +3 more
core +1 more source
Average clustering coefficient for each book & clustering coefficient for a similar random network.
Average clustering coefficient for each book & clustering coefficient for a similar random network.
Michaël C. Waumans (748882) +2 more
core +1 more source
We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
Durer-pentagon-based complex network
A novel Durer-pentagon-based complex network was constructed by adding a centre node. The properties of the complex network including the average degree, clustering coefficient, average path length, and fractal dimension were determined.
Rui Hou, Yuejiana Chang, Yuzhou Chang
doaj +1 more source
A graph clustering algorithm based on a clustering coefficient for weighted graphs [PDF]
Abstract Graph clustering is an important issue for several applications associated with data analysis in graphs. However, the discovery of groups of highly connected nodes that can represent clusters is not an easy task. Many assumptions like the number of clusters and if the clusters are or not balanced, may need to be made before the ...
Mariá Cristina Vasconcelos Nascimento +1 more
openaire +1 more source

