Skip to main content
SpringerLink
Log in

Relationship Discovery and Navigation in Big Graphs

  • Conference paper
  • First Online:
Intelligent Systems in Science and Information 2014 (SAI 2014)

Part of the book series: Studies in Computational Intelligence ((SCI,volume 591))

Included in the following conference series:

  • 751 Accesses

Abstract

Relationship discovery is a challenging field, especially when handling with big graphs (tenths to hundreds vertices and edges). In this paper, we define a set of rules for relationship discovery. To evaluate them and find connections we implement these rules in Pregel Relationship Discovery (PRD) algorithm and also in our Graph Clutter Removal Tool (AGECRT). Our PRD algorithm is capable of navigation even through the opposite direction of edge, even without additional indexation. Graph visualization is important field in data overview creation. For visualization, we also propose a new edge coloring method based on hash codes obtained from vertices. When edges cross, not color but also a pen style can help to navigate edges. In this paper we join relationship discovery (represented by PRD) and graph visualization (with AGECRT). In order evaluate our rules and work we use PRD and AGECRT to present an experimental results from Freebase dataset.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Melo, C., Le-Grand, B., Aufaure, M., Bezerianos, A.: Extracting and visualising tree-like structures from concept lattices. In: 15th International Conference on Information Visualisation (IV), pp. 261–266. IEEE, Piscataway (2011)

    Google Scholar 

  2. Rusu, A., Fabian, A. J., Jianu, R.: Using the gestalt principle of closure to alleviate the edge crossing problem in graph drawings. In: 15th International Conference on Information Visualisation (IV), pp. 488–493. IEEE, Piscataway (2011)

    Google Scholar 

  3. Miller, G.A.: The magical number seven, plus or minus two: some limits on our capacity for processing information. Psychol. Rev. 63(2), 81 (1956)

    Article  Google Scholar 

  4. Herman, I., Melanon, G., Marshall, M.S.: Graph visualization and navigation in information visualization: a survey. IEEE Trans. Visual. Comput. Graph. 6(1), 24–43 (2000)

    Article  Google Scholar 

  5. Jusufi, I., Dingjie, Y., Kerren, A.: The network lens: Interactive exploration of multivariate networks using visual filtering. In: 14th International Conference on Information Visualisation (IV), pp. 35–42. IEEE, Piscataway (2010)

    Google Scholar 

  6. Kerren, A., Ebert, A., Meyer, J.: Human-Centered Visualization Environments. Springer, Berlin (2006)

    Google Scholar 

  7. Mullen, K.T.: The contrast sensitivity of human colour vision to red-green and blue-yellow chromatic gratings. J. Physiol. 359(1), 381–400 (1985)

    Article  Google Scholar 

  8. Kelly, D.H.: Visual contrast sensitivity. J. Mod. Opt. 24(2), 107–129 (1977)

    Google Scholar 

  9. Czajkowski, G., Dvorský, M., Zhao, J., Conley, M.: Sorting Petabytes with MapReduce—The Next Episode. http://googleresearch.blogspot.sk/2011/09/sorting-petabytes-with-mapreduce-next.html (2014). Google Retrieved 12 Sept 2014

  10. Dayarathna, M., Suzumura, T.: A first view of exedra: a domain-specific language for large graph analytics workflows. In: WWW (Companion Volume), pp. 509–516, (2013)

    Google Scholar 

  11. Quick, L., Wilkinson, P., Hardcastle, D.: Using Pregel-like large scale graph processing frameworks for social network analysis. In: ASONAM, pp. 457–463, (2012)

    Google Scholar 

  12. Malewicz, G. et al.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data. ACM, New York City (2010)

    Google Scholar 

  13. Lumsdaine, A., et al.: Challenges in parallel graph processing. Parallel Process. Lett. 17(1), 5–20 (2007)

    Article  MathSciNet  Google Scholar 

  14. Omote, H., Sugiyama, K.: Method for drawing intersecting clustered graphs and its application to web ontology language. In: Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation, vol. 60, pp. 89–92. Australian Computer Society Inc, Australia (2006)

    Google Scholar 

  15. Jianu, R., Rusu, A., Fabian, A.J., Laidlaw, D.H.: A coloring solution to the edge crossing problem. In: 13th International Conference on Information Visualisation, pp. 691–696. IEEE, Piscataway (2009)

    Google Scholar 

  16. Itoh, T., Muelder, C., Ma, K.L., Sese, J.: A hybrid space-filling and force-directed layout method for visualizing multiple-category graphs. In: Visualization Symposium, 2009. PacificVis’ 09. IEEE Pacific, pp. 121–128. IEEE, Piscataway (2009)

    Google Scholar 

  17. Dudas, P.M., Jongh, M.D., Brusilovsky, P.: A semi-supervised approach to visualizing and manipulating overlapping communities. In: 17th International Conference on Information Visualisation (IV), pp. 180–185. IEEE, Piscataway (2013)

    Google Scholar 

  18. Nguyen, Q.V., Huang, M.L.: EncCon: an approach to constructing interactive visualization of large hierarchical data. Inf. Visual. 4(1), 1–21 (2005)

    Article  Google Scholar 

  19. Misue, K., Zhou, Q.: Drawing semi-bipartite graphs in anchor + matrix style. In: 15th International Conference on Information Visualisation (IV), pp. 26–31. IEEE, Piscataway (2011)

    Google Scholar 

  20. Tejada, E., Minghim, R., Nonato, L.G.: On improved projection techniques to support visual exploration of multi-dimensional data sets. Inf. Visual. 2(4), 218–231 (2003)

    Article  Google Scholar 

  21. Cvek, U., Trutschl, M., Kilgore, P.C., Stone, R., Clifford, J.L.: Multidimensional visualization techniques for microarray data. In: 15th International Conference on Information Visualisation (IV), pp. 241–246. IEEE, Piscataway (2011)

    Google Scholar 

  22. Chalmers, M.: A linear iteration time layout algorithm for visualising high-dimensional data. In: Proceedings of Visualization’96, pp. 127–131. IEEE, Piscataway (1996)

    Google Scholar 

  23. Kienreich, W., Seifert, C.: An application of edge bundling techniques to the visualization of media analysis results. In: 14th International Conference on Information Visualisation (IV), pp. 375–380. IEEE, Piscataway (2010)

    Google Scholar 

  24. Holten, D., Van Wijk, J.J.: Force directed edge bundling for graph visualization. Computer Graphics Forum, vol. 28(3), pp. 983–990. Blackwell Publishing Ltd, Hoboken (2009)

    Google Scholar 

  25. Burch, M., Schmauder, H., Weiskopf, D.: Edge bundling by rapidly-exploring random trees. In: 17th International Conference on Information Visualisation (IV), pp. 28–35. IEEE, Piscataway (2013)

    Google Scholar 

  26. Furnas, G.W.: Generalized Fisheye Views, vol. 17, No. 4, pp. 16–23. ACM, New York City (1986)

    Google Scholar 

  27. Furnas, G.W.: A fisheye follow-up: further reflections on focus + context. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 999–1008. ACM, New York City (2006)

    Google Scholar 

  28. Tominski, C., Abello, J., van Ham, F., Schumann, H.: Fisheye tree views and lenses for graph visualization. In: 10th International Conference on Information Visualization (IV), pp. 17–24. IEEE, Piscataway (2006)

    Google Scholar 

  29. Sarkar, M., Brown, M.H.: Graphical fisheye views. Commun. ACM 37(12), 73–83 (1994)

    Article  Google Scholar 

  30. Bier, E.A., Stone, M.C., Pier, K., Buxton, W., DeRose, T.D.: Tool glass and magic lenses: the see-through interface. In: Proceedings of the 20th Annual Conference on Computer Graphics and Interactive Techniques, pp. 73–80. ACM, New York City (1993)

    Google Scholar 

  31. Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. 4(5), 235–282 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  32. Reingold, E.M., Tilford, J.S.: Tidier drawings of trees. IEEE Trans. Softw. Eng. 2, 223–228 (1981)

    Article  Google Scholar 

  33. Chen, T.T., Hsieh, L.C.: The visualization of relatedness. In: 12th International Conference on Information Visualisation IV’08, pp. 415–420. IEEE, Piscataway (2008)

    Google Scholar 

  34. Bao, N.T., Suzumura, T.: Towards highly scalable pregel-based graph processing platform with x10. In: Proceedings of the 22nd International Conference on World Wide Web Companion, pp. 501–508. International World Wide Web Conferences Steering Committee (2013)

    Google Scholar 

  35. Laclavík, M., Dlugolinsk, Š., Šeleng, M., Ciglan, M., Hluchý, L.: Emails as graph: relation discovery in email archive. In: Proceedings of the 21st International Conference Companion on World Wide Web, pp. 841–846. ACM, New York City (2012)

    Google Scholar 

  36. Ciglan, M., Nø rvȧg, K.: Sgdb—simple graph database optimized for activation spreading computation. In: Database Systems for Advanced Applications, pp. 45–56. Springer, Berlin (2010)

    Google Scholar 

  37. Kyrola, A., Blelloch, G.E., Guestrin, C.: GraphChi: large-scale graph computation on just a PC. OSDI, vol. 12, pp. 31–46. (2012)

    Google Scholar 

Download references

Acknowledgment

This work was supported by the Slovak Research and Development Agency project name CLAN, number APVV-0809-11 and by the Scientific Grant Agency of the Ministry of Education, science, research and sport of the Slovak Republic and the Slovak Academy of Sciences, project VEGA, number 2/0185/13.

Author information

Authors and Affiliations

  1. Institute of Informatics, Slovak Academy of Sciences, Bratislava, Slovakia

    Ján Mojžiš & Michal Laclavík

Authors
  1. Ján Mojžiš
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michal Laclavík
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ján Mojžiš .

Editor information

Editors and Affiliations

  1. Graduate School of Science and Engineering, Saga University, Saga, Japan

    Kohei Arai

  2. The Science and Information (SAI) Organization, London, United Kingdom

    Supriya Kapoor

  3. The Science and Information (SAI) Organization, London, United Kingdom

    Rahul Bhatia

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Mojžiš, J., Laclavík, M. (2015). Relationship Discovery and Navigation in Big Graphs. In: Arai, K., Kapoor, S., Bhatia, R. (eds) Intelligent Systems in Science and Information 2014. SAI 2014. Studies in Computational Intelligence, vol 591. Springer, Cham. https://doi.org/10.1007/978-3-319-14654-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-14654-6_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-14653-9

  • Online ISBN: 978-3-319-14654-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation