Article

Iceberg Cube Query on Heterogeneous Information Networks

Authors:

WASA 2014: Proceedings of the 9th International Conference on Wireless Algorithms, Systems, and Applications - Volume 8491

Pages 740 - 749

https://doi.org/10.1007/978-3-319-07782-6_66

Published: 23 June 2014 Publication History

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.

References

[1]

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)

Digital Library

Google Scholar

[2]

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)

Digital Library

Google Scholar

[3]

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)

Digital Library

Google Scholar

[4]

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)

Digital Library

Google Scholar

[5]

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)

Digital Library

Google Scholar

[6]

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)

Google Scholar

[7]

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)

Digital Library

Google Scholar

[8]

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)

Digital Library

Google Scholar

[9]

Zhang, N., Tian, Y., Pate: Discovery-driven graph summarization. In: Proceeding of IEEE International Conference on Data Engineering, pp. 880—891. IEEE, Piscataway (2010)

Google Scholar

[10]

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)

Digital Library

Google Scholar

Cited By

View all

Queiroz-Sousa PSalgado A(2019)A Review on OLAP Technologies Applied to Information NetworksACM Transactions on Knowledge Discovery from Data10.1145/337091214:1(1-25)Online publication date: 13-Dec-2019
https://dl.acm.org/doi/10.1145/3370912
Yin DGao H(2017)A flexible aggregation framework on large-scale heterogeneous information networksJournal of Information Science10.1177/016555151663023743:2(186-203)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1177/0165551516630237
Yin DGao HZou ZLi J(2017)Minimized-cost cube query on heterogeneous information networksJournal of Combinatorial Optimization10.1007/s10878-015-9967-633:1(339-364)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1007/s10878-015-9967-6

Iceberg Cube Query on Heterogeneous Information Networks
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory

Recommendations

Minimized-cost cube query on heterogeneous information networks

Data cube is the foundation of on-line analytical processing (OLAP), which can provide users with data views from different perspectives and granularities. Heterogeneous information networks consist of multiple types of nodes and edges which represent ...
Bottom-up computation of sparse and Iceberg CUBE

We introduce the Iceberg-CUBE problem as a reformulation of the datacube (CUBE) problem. The Iceberg-CUBE problem is to compute only those group-by partitions with an aggregate value (e.g., count) above some minimum support threshold. The result of ...
Bottom-up computation of sparse and Iceberg CUBE
SIGMOD '99: Proceedings of the 1999 ACM SIGMOD international conference on Management of data

We introduce the Iceberg-CUBE problem as a reformulation of the datacube (CUBE) problem. The Iceberg-CUBE problem is to compute only those group-by partitions with an aggregate value (e.g., count) above some minimum support threshold. The result of ...

Comments

Information & Contributors

Information

Published In

WASA 2014: Proceedings of the 9th International Conference on Wireless Algorithms, Systems, and Applications - Volume 8491

June 2014

803 pages

ISBN:9783319077819

Editors:
Zhipeng Cai
Department of Computer Science, Georgia State University, Atlanta, USA
,
Chaokun Wang
School of Software, Tsinghua University, Beijing, China
,
Siyao Cheng
School of Computer Science and Technology, Harbin Institute of Technology, Harbin, China
,
Hongzhi Wang
School of Computer Science and Technology, Harbin Institute of Technology, Harbin, China
,
Hong Gao
School of Computer Science and Technology, Harbin Institute of Technology, Harbin, China

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 23 June 2014

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 24 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Queiroz-Sousa PSalgado A(2019)A Review on OLAP Technologies Applied to Information NetworksACM Transactions on Knowledge Discovery from Data10.1145/337091214:1(1-25)Online publication date: 13-Dec-2019
https://dl.acm.org/doi/10.1145/3370912
Yin DGao H(2017)A flexible aggregation framework on large-scale heterogeneous information networksJournal of Information Science10.1177/016555151663023743:2(186-203)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1177/0165551516630237
Yin DGao HZou ZLi J(2017)Minimized-cost cube query on heterogeneous information networksJournal of Combinatorial Optimization10.1007/s10878-015-9967-633:1(339-364)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1007/s10878-015-9967-6

Abstract

References

Cited By

Recommendations

Minimized-cost cube query on heterogeneous information networks

Bottom-up computation of sparse and Iceberg CUBE

Bottom-up computation of sparse and Iceberg CUBE

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations