Evolutionary Clustering and Analysis of Bibliographic Networks

Manish Gupta, Charu C. Aggarwal, Jiawei Han, Yizhou Sun

Abstract

In this paper, we study the problem of evolutionary clustering of multi-typed objects in a heterogeneous bibliographic network. The traditional methods of homogeneous clustering methods do not result in a good typed-clustering. The design of heterogeneous methods for clustering can help us better understand the evolution of each of the types apart from the evolution of the network as a whole. In fact, the problem of clustering and evolution diagnosis are closely related because of the ability of the clustering process to summarize the network and provide insights into the changes in the objects over time. We present such a tightly integrated method for clustering and evolution diagnosis of heterogeneous bibliographic information networks. We present an algorithm, ENetClus, which performs such an agglomerative evolutionary clustering which is able to show variations in the clusters over time with a temporal smoothness approach. Previous work on clustering networks is either based on homogeneous graphs with evolution, or it does not account for evolution in the process of clustering heterogeneous networks. This paper provides the first framework for evolution-sensitive clustering and diagnosis of heterogeneous information networks. The ENetClus algorithm generates consistent typed clusterings across time, which can be used for further evolution diagnosis and insights. The framework of the algorithm is specifically designed in order to facilitate insights about the evolution process. We use this technique in order to provide novel insights about bibliographic information networks.
BibTeX
@inproceedings{gupta2011evolutionary,
  author = {Manish Gupta and Charu C. Aggarwal and Jiawei Han and Yizhou Sun},
  title = {{Evolutionary Clustering and Analysis of Bibliographic Networks}},
  booktitle = {ASONAM},
  year = {2011},
  doi = {10.1109/asonam.2011.12},
}

Loading related content...

Figure