TABLE 1.
Features | Description |
---|---|
Clustering coefficient D | Ratio of total number of edges among the neighbors of the node and the node itself to the total number of edges that can exist among the neighbors of the node and the node itself per node |
Giant connected component | Ratio between the number of nodes in the largest connected component in the graph and total the number of nodes |
Average eccentricity | Average of node eccentricities, wherein the eccentricity of a node is the maximum shortest path length from the node to any other node in the graph |
Clustering coefficient C | Ratio between the number of edges between the neighbors of node and the total possible number of edges between the neighbors of node |