Flexible Aggregation on Heterogeneous Information Networks
With the advent of heterogeneous information networks that consist of multi-type, interconnected nodes, such as bibliographic networks and knowledge graphs, it is important to study flexible aggregation in such networks. In this paper, we investigate the flexible aggregation problem on heterogeneous information networks, which is defined on multi-type of nodes and relations. We develop an efficient heuristic algorithm for aggregation in two phases: informational aggregation and structural aggregation. Extensive experiments on real world data sets demonstrate the effectiveness and efficiency of the proposed algorithm.
KeywordsNode Type Structural Aggregation Aggregation Algorithm Aggregate Function Cite Relation
This work is supported by the National Grand Fundamental Research 973 Program of China under grant 2012CB316200, the Key Program of National Natural Science Foundation of China under grant 60933001, the Major Program of National Natural Science Foundation of China under grant 61190115, the General Program of National Natural Science Foundation of China under grant 61173023.
- 1.Shetty, J., Adibi, J.: Discovering important nodes through graph entropy the case of enron email database. In: Proceedings of the 3rd International Workshop on Link Discovery, pp. 74–81. ACM (2005)Google Scholar
- 2.Zhao, P., Li, X., Xin, D., Han, J.: Graph cube: on warehousing and olap multidimensional networks. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of data, pp. 853–864. ACM (2011)Google Scholar