| 摘要 |
Network graphs are determined using data about the vertices. Vertices are clustered into community of vertices based on maximizing the density of linkages within each community. Vertex properties describing the extent to which each vertex's community has exhibited a particular behavior are determined. Vertex properties describing whether the most important vertex in each community has exhibited a particular behavior are determined. Functions describing the relationship between these two categories of vertex properties and other relevant vertex properties, and a particular behavior are determined. These functions are used to predict the likelihood of each vertex exhibiting the particular behavior.
|
