Skip to main content
SpringerLink
Log in

A visualization method for multi-relation in dataset

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

To express the multi-relation in complex dataset, proposed a fast visualization method based on the continuous Catmull–Rom curve. The method expresses the entity data and the taxonomic relation in dataset using the hypergraph. The nodes are designed to represent the entity data in dataset. The hyperedge is introduced to link all the relative nodes in one multi-relation. The hyperedge can be visualized by the curve style or the regional style according to different requirements. The nodes in one hyperedge are linked by a continuous curve in curve style, while all the nodes are surrounded by one closed region in regional style. The Catmull–Rom algorithm is adopted to produce the continuous curve between the adjacent nodes in curve style. The nodes are regarded as the control points in the interpolating processing of Catmull–Rom algorithm. The peripheral points are obtained by extending along the tendency line of the hyperedge in regional style. The closed curve connecting these peripheral points forms a closed region expressing the hyperedge. The color selected to stain the hyperedge based on color wheel. The selected colors for each hyperedge can maximize the visual differentiation in the processing of coloring each hyperedge. The experimental results denoted that the method can achieve the intuitive and accurate expression for the multi-relation in complex dataset. The method can visualize the common scale dataset the in real time.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21

Similar content being viewed by others

References

  1. Sun, L.Y., Peng, S.P., Zhang, D.Z.: Spatial data mining based on hypergraph model. Comput. Eng. Appl. 11, 30–34 (2002)

    Google Scholar 

  2. Qian, R., Zhang, K.J., Zhao, G.: Hypergraph partitioning for community discovery in complex network, 2009 International Conference on Web Information Systems and Mining, vol. 21, pp. 64–68 (2009)

  3. Zhaoa, J., Zhou, Y.-W., Wahabd, M.I.M.: Joint optimization models for shelf display and inventory control considering the impact of spatial relationship on demand. Eur. J. Oper. Res. 255(3), 797–808 (2016). doi:10.1016/j.ejor.2016.05.025

    Article  MathSciNet  Google Scholar 

  4. Rendle S, Schmidt-Thieme L.: Pairwise interaction tensor factorization for personalized tag recommendation[C]//Proceedings of the 3rd ACM International Conference on Web Search and Data Mining. pp. 81–90. ACM, New York (2010)

  5. Prakash, B.A., Sridharan, A., Seshadri, M., et al.: Eigenspokes: surprising patterns and scalable community chipping in large graphs. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds.) Advances in Knowledge Discovery and Data Mining. Lecture Notes in Computer Science. Springer, Berlin (2010)

    Google Scholar 

  6. Wang, B., Wu, W., Xu, C.O., Wu, B.: A survey on visualization of complex network. Comput. Sci. 34(4), 17–23 (2007)

    Google Scholar 

  7. Alper, B., Riche, N.H., Ramos, G., et al.: Design study of linesets, a novel set visualization technique[J]. IEEE Trans. Vis. Comput. Graph. 17(12), 2259–2267 (2011)

    Article  Google Scholar 

  8. Jing, X., Zhen, L., Yueqi, H., et al.: Hypergraph-based bone dataset visualizatio[J]. J. Comput.-Aided Des. Comput. Graph. 23(12), 2040–2045 (2011). (in Chinese)

    Google Scholar 

  9. Sawilla, R.: A survey of data mining of graphs using spectral graph theory. Technical Memorandum DRDC Ottawa TM 2008–317, 12 (2008)

    Google Scholar 

  10. Chimani, M., Gutwenger, C.: Algorithms for the hypergraph and the minor crossing number problems, 18th International Symposium, ISAAC, pp. 184–195 (2007)

  11. Bertault, F., Eades, P.: Drawing hypergraphs in the subset standard. In: GD 2000.LNCS, vol. 1984, pp. 164–169. Springer, Heidelberg (2000)

  12. Walsh, T.: Hypermaps versus bipartite maps. J. Comb. Theory 18, 155–163 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  13. Brandes, U., Cornelsen, S., Pampel, B., Sallaberry, A.: Blocks of hypergraphs-applied to hypergraphs and outerplanarity.In: Proceeding of the 21st International Workshop on Combinatorial Algorithms (IWOCA 2010), LNCS, vol. 6460, pp. 201–211. Springer (2011)

  14. Brandes, U., Cornelsen, S., Pampel, B., Sallaberry, A.: Path-based supports for hypergraphs. In: Proceeding of the 21st International Workshop on Combinatorial Algorithms (IWOCA 2010), LNCS, vol. 6460, pp. 20–33. Springer (2011)

  15. Buchin, K., Kreveld, M., Meijer, H., Speckmann, B., Verbeek, K.: On planar supports for hypergraphs. In: Proceeding of the 17th International Symposium on Graph Drawing (GD 2009), Lecture Notes in Computer Science, vol. 5849, pp. 345–356, Springer (2009)

  16. Landrum, M.J., Lee, J.M., Riley, G.R.: ClinVar: public archive of relationships among sequence variation and human phenotype. Nucleic Acids Res. 42(1), D980–D985 (2014). doi:10.1093/nar/gkt1113

    Article  Google Scholar 

  17. Kaufmann, M., van Kreveld, M., Speckmann, B.: Subdivision drawings of hypergraphs. In: Proceeding of the 16th International Symposium on Graph Drawing (GD 08), LNCS, vol. 5417, pp. 396–407. Springer (2009)

  18. Zhou, Q., Luo, J.: Artificial neural network based grid computing of E-government scheduling for emergency management. Comput. Syst. Sci. Eng. 30(5), 327–335 (2015)

    Google Scholar 

  19. Zhou, Q., Luo, J.: The study on evaluation method of urban network security in the big data era. Intell. Autom. Soft Comput. (2017). Doi:10.1080/10798587.2016.1267444

Download references

Acknowledgements

This work was supported by Beijing Natural Science Foundation (9164028), Beijing Natural Science Foundation (4154066), Science and Technology Plan Project of Beijing Municipal Commission of Education (PXM2014-014213-000004), Beijing Outstanding Personnel Training Program (2014000020124G029).

Author information

Authors and Affiliations

  1. College of Management, Beijing Union University, Beijing, 100101, China

    Hui Li, Qin He, Liyi Ma & Shuang Dong

  2. School of Computer and Information Technology, Beijing Technology and Business University, Beijing, 100048, China

    Hongqian Chen

Authors
  1. Hui Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hongqian Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Qin He
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Liyi Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Shuang Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hongqian Chen.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, H., Chen, H., He, Q. et al. A visualization method for multi-relation in dataset. Cluster Comput 20, 225–237 (2017). https://doi.org/10.1007/s10586-017-0780-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-017-0780-0

Keywords

Search

Navigation