Readable representations for large-scale bipartite graphs

Shuji Sato*, Kazuo Misue, Jiro Tanaka

*この研究の対応する著者

研究成果: Conference contribution

4 被引用数 (Scopus)

抄録

Bipartite graphs appear in various scenes in the real world, and visualizing these graphs helps improve our understanding of network structures. The amount of information that is available to us has increased dramatically in recent years, and it is therefore necessary to develop a drawing technique that corresponds to large-scale graphs. In this paper, we describe drawing methods to make large-scale bipartite graphs easy to read. We propose two techniques: "node contraction drawing," which involves collecting similar nodes and drawing them as one node, and "isosimilarity contour drawing," which puts clusters into an outlined area. We developed interactive user interfaces for the drawing methods and conducted an evaluation experiment to demonstrate the effectiveness of the proposed techniques.

本文言語English
ホスト出版物のタイトルKnowledge-Based Intelligent Information and Engineering Systems - 12th International Conference, KES 2008, Proceedings
出版社Springer Verlag
ページ831-838
ページ数8
PART 2
ISBN(印刷版)3540855645, 9783540855644
DOI
出版ステータスPublished - 2008
外部発表はい
イベント12th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2008 - Zagreb, Croatia
継続期間: 2008 9月 32008 9月 5

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
番号PART 2
5178 LNAI
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Conference

Conference12th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2008
国/地域Croatia
CityZagreb
Period08/9/308/9/5

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Readable representations for large-scale bipartite graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル