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
Volume5178 LNAI
EditionPART 2
DOIs
Publication statusPublished - 2008
Externally publishedYes
Event12th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2008 - Zagreb
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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Bipartite Graph
User interfaces
Experiments
Vertex of a graph
Graph in graph theory
Network Structure
User Interface
Drawing
Contraction
Necessary
Evaluation
Demonstrate
Experiment

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

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., Vol. 5178 LNAI, 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

Readable representations for large-scale bipartite graphs. / Sato, Shuji; Misue, Kazuo; Tanaka, Jiro.

Knowledge-Based Intelligent Information and Engineering Systems - 12th International Conference, KES 2008, Proceedings. Vol. 5178 LNAI PART 2. ed. 2008. p. 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).

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

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 edn, vol. 5178 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 5178 LNAI, pp. 831-838, 12th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2008, Zagreb, 08/9/3. https://doi.org/10.1007/978-3-540-85565-1-103
Sato S, Misue K, Tanaka J. Readable representations for large-scale bipartite graphs. In Knowledge-Based Intelligent Information and Engineering Systems - 12th International Conference, KES 2008, Proceedings. PART 2 ed. Vol. 5178 LNAI. 2008. p. 831-838. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2). https://doi.org/10.1007/978-3-540-85565-1-103
Sato, Shuji ; Misue, Kazuo ; Tanaka, Jiro. / Readable representations for large-scale bipartite graphs. Knowledge-Based Intelligent Information and Engineering Systems - 12th International Conference, KES 2008, Proceedings. Vol. 5178 LNAI PART 2. ed. 2008. pp. 831-838 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).
@inproceedings{4eabd2d68f4d4f9eb12984b3bde944cb,
title = "Readable representations for large-scale bipartite graphs",
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.",
keywords = "Anchored map, Bipartite graph, Clustering, Graph drawing, Information visualization",
author = "Shuji Sato and Kazuo Misue and Jiro Tanaka",
year = "2008",
doi = "10.1007/978-3-540-85565-1-103",
language = "English",
isbn = "3540855645",
volume = "5178 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 2",
pages = "831--838",
booktitle = "Knowledge-Based Intelligent Information and Engineering Systems - 12th International Conference, KES 2008, Proceedings",
edition = "PART 2",

}

TY - GEN

T1 - Readable representations for large-scale bipartite graphs

AU - Sato, Shuji

AU - Misue, Kazuo

AU - Tanaka, Jiro

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

KW - Anchored map

KW - Bipartite graph

KW - Clustering

KW - Graph drawing

KW - Information visualization

UR - http://www.scopus.com/inward/record.url?scp=57749170924&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=57749170924&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-85565-1-103

DO - 10.1007/978-3-540-85565-1-103

M3 - Conference contribution

AN - SCOPUS:57749170924

SN - 3540855645

SN - 9783540855644

VL - 5178 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 831

EP - 838

BT - Knowledge-Based Intelligent Information and Engineering Systems - 12th International Conference, KES 2008, Proceedings

ER -