Skip to main content

Schema Formalism for Semantic Summary Based on Labeled Graph from Heterogeneous Data

  • Conference paper
  • First Online:
Recent Challenges in Intelligent Information and Database Systems (ACIIDS 2022)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1716))

Included in the following conference series:

  • 1002 Accesses

Abstract

Graphs are used in various applications and to model real world objects. To understand the underlying characteristics of large graphs, graph summarization becomes a hot topic aiming to facilitate the identification of structure and meaning in data. The problem of graph summarization has been studied in the literature and many approaches for static contexts are proposed to summarize the graph in terms of its communities. These approaches typically produce groupings of nodes which satisfy or approximate some optimization function. Nevertheless, they fail to characterize the subgraphs and do not summarize both the structure and the content in the same approach. Existing approaches are only suitable for a static context, and do not offer direct dynamic counterparts. This means that there is no framework that provides summarization of mixed-source and information with the goal of creating a dynamic, syntactic, and semantic data summary. In this paper, the main contribution relies on summarizing data into a single graph model for heterogeneous sources. It’s a schema-driven approach based on labeled graph. Our approach allows also to link the graph model to the relevant domain knowledge to find relevant concepts to provide meaningful and concise summary. After extracting relevant domain, we provide a personalized visualization model capable of summarize graphically both the structure and the content of the data from databases, devices, and sensors to reduce cognitive barriers related to the complexity of the information and its interpretation. We illustrate this approach through a case study on the use of E-health domain.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Boldi, P., Rosa, M., Santini, M., Vigna, S.: Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. In: Proceedings of the 20th International Conference on World Wide Web, pp. 587–596, March 2011

    Google Scholar 

  2. Cudré-Mauroux, P., Elnikety, S.: Graph data management systems for new application domains. Proc. VLDB Endowment 4(12), 1510–1511 (2011)

    Article  Google Scholar 

  3. Hooper, S.D., Bork, P.: Medusa: a simple tool for interaction graph analysis. Bioinformatics 21(24), 4432–4433 (2005)

    Article  Google Scholar 

  4. Barceló, P., Pérez, J., Reutter, J.L.: Relative expressiveness of nested regular expressions. AMW 12, 180–195 (2012)

    Google Scholar 

  5. 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, pp. 567–580, June 2008

    Google Scholar 

  6. Tang, N., Chen, Q., Mitra, P.: Graph stream summarization: from big bang to big crunch. In: Proceedings of the 2016 International Conference on Management of Data, pp. 1481–1496, June 2016

    Google Scholar 

  7. Fan, W., Li, J., Wang, X., Wu, Y.: Query preserving graph compression. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, pp. 157–168, May 2012

    Google Scholar 

  8. Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: Graph distances in the data-stream model. SIAM J. Comput. 38(5), 1709–1727 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  9. Han, W., et al.: Chronos: a graph engine for temporal graph analysis. In: Proceedings of the Ninth European Conference on Computer Systems, pp. 1–14, April 2014

    Google Scholar 

  10. Kang, U., Faloutsos, C.: Beyond ‘caveman communities’: hubs and spokes for graph compression and mining. In: 2011 IEEE 11th International Conference on Data Mining, pp. 300–309. IEEE, December 2011

    Google Scholar 

  11. Kang, U., Tong, H., Sun, J., Lin, C.Y., Faloutsos, C.: GBASE: a scalable and general graph management system. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1091–1099, August 2011

    Google Scholar 

  12. Huang, J., Abadi, D.J., Ren, K.: Scalable SPARQL querying of large RDF graphs. Proc. VLDB Endowment 4(11), 1123–1134 (2011)

    Article  Google Scholar 

  13. Khan, K.U., Nawaz, W., Lee, Y.K.: Set-based unified approach for summarization of a multi-attributed graph. World Wide Web 20(3), 543–570 (2017)

    Article  Google Scholar 

  14. Shah, N., Koutra, D., Zou, T., Gallagher, B., Faloutsos, C.: Timecrunch: interpretable dynamic graph summarization. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1055–1064, August 2015

    Google Scholar 

  15. Akoglu, L., Tong, H., Koutra, D.: Graph based anomaly detection and description: a survey. Data Min. Knowl. Discovery 29(3), 626–688 (2015)

    Article  MathSciNet  Google Scholar 

  16. Toivonen, H., Zhou, F., Hartikainen, A., Hinkka, A.: Compression of weighted graphs. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 965–973, August 2011

    Google Scholar 

  17. Mathioudakis, M., Bonchi, F., Castillo, C., Gionis, A., Ukkonen, A.: Sparsification of influence networks. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 529–537, August 2011

    Google Scholar 

  18. Dunne, C., Shneiderman, B.: Motif simplification: improving network visualization readability with fan, connector, and clique glyphs. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 3247–3256, April 2013

    Google Scholar 

  19. Tian, Y., Patel, J.M.: Tale: a tool for approximate large graph matching. In: 2008 IEEE 24th International Conference on Data Engineering, pp. 963–972. IEEE, April 2008

    Google Scholar 

  20. Shen, Z., Ma, K.L., Eliassi-Rad, T.: Visual analysis of large heterogeneous social networks by semantic and structural abstraction. IEEE Trans. Visual Comput. Graphics 12(6), 1427–1439 (2006)

    Article  Google Scholar 

  21. Lebanoff, L., Song, K., Liu, F.: Adapting the neural encoder-decoder framework from single to multi-document summarization. arXiv preprint arXiv:1808.06218 (2018)

  22. Cook, D.J., Holder, L.B.: Graph-based data mining. IEEE Intell. Syst. Their Appl. 15(2), 32–41 (2000)

    Article  Google Scholar 

  23. Raghavan, S., Garcia-Molina, H.: Representing web graphs. In: Proceedings 19th International Conference on Data Engineering (Cat. No. 03CH37405), pp. 405–416. IEEE, March 2003

    Google Scholar 

  24. Zhang, N., Tian, Y., Patel, J.M.: Discovery-driven graph summarization. In: 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), pp. 880–891. IEEE, March 2010

    Google Scholar 

  25. Adhikari, B., Zhang, Y., Amiri, S.E., Bharadwaj, A., Prakash, B.A.: Propagation-based temporal network summarization. IEEE Trans. Knowl. Data Eng. 30(4), 729–742 (2017)

    Article  Google Scholar 

  26. Tan, J., Wan, X., Xiao, J.: Abstractive document summarization with a graph-based attentional neural model. In: Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pp. 1171–1181, July 2017

    Google Scholar 

  27. Maccioni, A., Abadi, D.J.: Scalable pattern matching over compressed graphs via dedensification. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 2016

    Google Scholar 

  28. Shi, L., Tong, H., Tang, J., Lin, C.: Vegas: visual influence graph summarization on citation networks. IEEE Trans. Knowl. Data Eng. 27(12), 3417–3431 (2015)

    Article  Google Scholar 

  29. Fan, W., Li, J., Wang, X., Wu, Y.: Query preserving graph compression. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, pp. 157–168, May 2012

    Google Scholar 

  30. Qu, Q., Liu, S., Jensen, C. S., Zhu, F., Faloutsos, C.: Interestingness-driven diffusion process summarization in dynamic networks. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, September 2014

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Amal Beldi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Beldi, A., Sassi, S., Chbeir, R., Jemai, A. (2022). Schema Formalism for Semantic Summary Based on Labeled Graph from Heterogeneous Data. In: Szczerbicki, E., Wojtkiewicz, K., Nguyen, S.V., Pietranik, M., Krótkiewicz, M. (eds) Recent Challenges in Intelligent Information and Database Systems. ACIIDS 2022. Communications in Computer and Information Science, vol 1716. Springer, Singapore. https://doi.org/10.1007/978-981-19-8234-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-981-19-8234-7_3

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-19-8233-0

  • Online ISBN: 978-981-19-8234-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics