0% found this document useful (0 votes)
38 views

V V, V V, V V, V, V E) E Density W W V V Entropy (A, V

The document presents mathematical formulas for calculating graph density, weighted density, and entropy for a set of graphs. The density of a graph is defined as the number of edges divided by the total possible number of edges. The weighted density takes into account weights for each vertex. The entropy formula measures the uncertainty in a vertex belonging to a particular cluster based on the probability distribution of vertices among clusters.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
38 views

V V, V V, V V, V, V E) E Density W W V V Entropy (A, V

The document presents mathematical formulas for calculating graph density, weighted density, and entropy for a set of graphs. The density of a graph is defined as the number of edges divided by the total possible number of edges. The weighted density takes into account weights for each vertex. The entropy formula measures the uncertainty in a vertex belonging to a particular cluster based on the probability distribution of vertices among clusters.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

k

|{(v p , v q )|v p , v q V i , ( v p , v q ) E }|

i=1

|E|

k
{V i } i=1 =

density
m
k
{V i } i=1 =
i=1

wi
m

wp

|V |

|V j| entropy (ai , V i)
j=1

p=1

ent r opy
ni

ent r opy ( a i , V i )= Pi jn log 2 P i jn


n=1

You might also like