Readable representations for large-scale bipartite graphs

Shuji Sato, Kazuo Misue, Jiro Tanaka

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationKnowledge-Based Intelligent Information and Engineering Systems - 12th International Conference, KES 2008, Proceedings
Pages831-838
Number of pages8
EditionPART 2
DOIs
Publication statusPublished - 2008 Dec 24
Externally publishedYes
Event12th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2008 - Zagreb, Croatia
Duration: 2008 Sep 32008 Sep 5

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume5178 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

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

Keywords

  • Anchored map
  • Bipartite graph
  • Clustering
  • Graph drawing
  • Information visualization

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Readable representations for large-scale bipartite graphs'. Together they form a unique fingerprint.

  • Cite this

    Sato, S., Misue, K., & Tanaka, J. (2008). Readable representations for large-scale bipartite graphs. In Knowledge-Based Intelligent Information and Engineering Systems - 12th International Conference, KES 2008, Proceedings (PART 2 ed., pp. 831-838). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5178 LNAI, No. PART 2). https://doi.org/10.1007/978-3-540-85565-1-103