Implementation of Vocabulary Based Summarization of Graph (VoG) on the Web Graph

Increasing data of the web graph make it difficult to identify the data structure and get the information from that large graph. To identify the structure and get the information, some method needed to summarize the large graph into smaller subgraphs, so data structure identification can be conducted on the subgraph. This will make structure identification easier. Vocabulary based Summarization of Graph (VoG) is a method that can be used to summarize the large graph and identify the subgraph structure. In the process of structure identification, a maximum number of node in GCC (k) affects the generated subgraph. More and more k generates less of subgraph with clique and star structures but generates more subgraphs with chain structures. The k also affects the execution time of VoG. More and more k make the execution time of VoG faster. From generated and identified subgraph structure, information that can be obtained is clique subgraph represent there is a user network that polls on a question link and star subgraph represent there is one user contribute an answer on some question link on quora.com.