Speeding Up Bipartite Graph Visualization Method

  • Takayasu Fushimi
  • Yamato Kubota
  • Kazumi Saito
  • Masahiro Kimura
  • Kouzou Ohara
  • Hiroshi Motoda
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7106)

Abstract

We address the problem of visualizing structure of bipartite graphs such as relations between pairs of objects and their multi-labeled categories. For this task, the existing spherical embedding method, as well as the other standard graph embedding methods, can be used. However, these existing methods either produce poor visualization results or require extremely large computation time to obtain the final results. In order to overcome these shortcomings, we propose a new spherical embedding method based on a power iteration, which additionally performs two operations on the position vectors: double-centering and normalizing operations. Moreover, we theoretically prove that the proposed method always converges. In our experiments using bipartite graphs constructed from the Japanese sites of Yahoo!Movies and Yahoo!Answers, we show that the proposed method works much faster than these existing methods and still the visualization results are comparable to the best available so far.

Keywords

Bipartite Graph Position Vector Spring Force Visualization Result Embedding Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chung, F.R.K.: Spectral Graph Theory. CBMS Regional Conference Series in Mathematics, vol. (92). American Mathematical Society (February 1997)Google Scholar
  2. 2.
    Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Inf. Process. Lett. 31, 7–15 (1989)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM 46, 604–632 (1999)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Langville, A.N., Meyer, C.D.: Deeper inside pagerank. Internet Mathematics 1 (2004)Google Scholar
  5. 5.
    Naud, A.P., Usui, S., Ueda, N., Taniguchi, T.: Visualization of documents and concepts in neuroinformatics with the 3d-se viewer. Frontiers in Neuroinformatics 1, Article 7 (2007)Google Scholar
  6. 6.
    Torgerson, W.S.: Theory and methods of scaling. John Wiley & Sons Inc. (1958)Google Scholar
  7. 7.
    Yamada, T., Saito, K., Ueda, N.: Cross-entropy directed embedding of network data. In: Proceedings of the 20th International Conference on Machine Learning (ICML 2003), pp. 832–839 (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Takayasu Fushimi
    • 1
  • Yamato Kubota
    • 2
  • Kazumi Saito
    • 1
    • 2
  • Masahiro Kimura
    • 3
  • Kouzou Ohara
    • 4
  • Hiroshi Motoda
    • 5
  1. 1.Graduate School of Management and Information of InnovationUniversity of ShizuokaJapan
  2. 2.School of Management and InformationUniversity of ShizuokaShizuokaJapan
  3. 3.Department of Electronics and InformaticsRyukoku UniversityOtsuJapan
  4. 4.Department of Integrated Information TechnologyAoyama Gakuin UniversityKanagawaJapan
  5. 5.Institute of Scientific and Industrial ResearchOsaka UniversityOsakaJapan

Personalised recommendations