Abstract
With the rapid development of social networks and cyber-physical systems, heterogeneous information networks have become increasingly popular. In many cases, such networks contain multiple types of objects and links. In traditional data warehouses and OLAP technique, iceberg cube are those whose aggregated functions are larger than a specific threshold. However traditional iceberg cube analysis techniques cannot be directly applied to graphs for finding interesting cubes due to the lack of structures in graphs. This paper addresses the interesting problem of iceberg cube query on heterogeneous information networks. Based on the intuition, we proposed a cube model based on attribute consistency and link consistency. And the iceberg cubes computation is realized by pruning on the two parts. And random walk is used to aggregate the nodes in heterogeneous information networks for approximate iceberg cubes. Experiments on real world heterogeneous information networks demonstrate the algorithm effective and efficiency.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chen, C., Yan, X., Zhu, F., Han, J., Yu, P.S.: Graph olap: Towards online analytical processing on graphs. In: Proc. of Int. Conf. on Data Mining, ICDM 2008, pp. 103–112. IEEE, NJ (2008)
Chen, C., Yan, X., Zhu, F., Han, J., Yu, P.S.: Graph olap: a multi-dimensional framework for graph data analysis. Knowledge and Information Systems 21(1), 41–63 (2009)
Ji, M., Han, J., Danilevsky, M.: Ranking-based classification of heterogeneous information networks. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1298–1306. ACM (2011)
Li, N., Guan, Z., Ren, L., Wu, J., Han, J., Yan, X.: giceberg: Towards iceberg analysis in large graphs. In: Proceedings of the 2013 IEEE International Conference on Data Engineering, pp. 1021–1032. IEEE (2013)
Sun, Y., Barber, R., Gupta, M.: Co-author relationship prediction in heterogeneous bibliographic networks. In: International Conference on Advances in Social Networks Analysis and Mining, pp. 121–128. IEEE, NJ (2011)
Sun, Y., Han, J., Yan, X., Yu, P.S., Wu, T.: Pathsim: Meta path-based top-k similarity search in heterogeneous information networks. In: Proc. VLDB Endow., vol. 4(11), pp. 992–1003. ACM, New York (2011)
Sun, Y., Norick, B., Han, J., Yan, X., Yu, P.S., Yu, X.: Integrating meta-path selection with user-guided object clustering in heterogeneous information networks. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2012, pp. 1348–1356. ACM, New York (2012)
Tian, Y., Hankins, R.A., Patel, J.M.: Efficient aggregation for graph summarization. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, pp. 567–580. ACM, New York (2008)
Zhang, N., Tian, Y., Pate: Discovery-driven graph summarization. In: Proceeding of IEEE International Conference on Data Engineering, pp. 880–891. IEEE, Piscataway (2010)
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, SIGMOD 2011, pp. 853–864. ACM, New York (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Yin, D., Gao, H. (2014). Iceberg Cube Query on Heterogeneous Information Networks. In: Cai, Z., Wang, C., Cheng, S., Wang, H., Gao, H. (eds) Wireless Algorithms, Systems, and Applications. WASA 2014. Lecture Notes in Computer Science, vol 8491. Springer, Cham. https://doi.org/10.1007/978-3-319-07782-6_66
Download citation
DOI: https://doi.org/10.1007/978-3-319-07782-6_66
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07781-9
Online ISBN: 978-3-319-07782-6
eBook Packages: Computer ScienceComputer Science (R0)