Speeding up bipartite graph visualization method

  • Authors:

  • Takayasu Fushimi;Yamato Kubota;Kazumi Saito;Masahiro Kimura;Kouzou Ohara;Hiroshi Motoda

  • Affiliations:

  • Graduate School of Management and Information of Innovation, University of Shizuoka, Japan;School of Management and Information, University of Shizuoka, Shizuoka, Japan;Graduate School of Management and Information of Innovation, University of Shizuoka, Japan;Department of Electronics and Informatics, Ryukoku University, Otsu, Shiga, Japan;Department of Integrated Information Technology, Aoyama Gakuin University, Kanagawa, Japan;Institute of Scientific and Industrial Research, Osaka University, Osaka, Japan

  • Venue:
  • AI'11 Proceedings of the 24th international conference on Advances in Artificial Intelligence
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.