Readable representations for large-scale bipartite graphs

Shuji Sato; Kazuo Misue; Jiro Tanaka

doi:10.1007/978-3-540-85565-1_103

Readable representations for large-scale bipartite graphs

Shuji Sato, Kazuo Misue, Jiro Tanaka

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Knowledge-Based Intelligent Information and Engineering Systems - 12th International Conference, KES 2008, Proceedings
Publisher	Springer Verlag
Pages	831-838
Number of pages	8
Edition	PART 2
ISBN (Print)	3540855645, 9783540855644
DOIs	https://doi.org/10.1007/978-3-540-85565-1_103
Publication status	Published - 2008
Externally published	Yes
Event	12th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2008 - Zagreb, Croatia Duration: 2008 Sep 3 → 2008 Sep 5

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 2
Volume	5178 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	12th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2008
Country	Croatia
City	Zagreb
Period	08/9/3 → 08/9/5

Keywords

Anchored map
Bipartite graph
Clustering
Graph drawing
Information visualization

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-85565-1_103

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). Springer Verlag. 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. PART 2. ed. Springer Verlag, 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 proceeding › Conference 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, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 5178 LNAI, Springer Verlag, pp. 831-838, 12th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2008, Zagreb, Croatia, 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. Springer Verlag. 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. PART 2. ed. Springer Verlag, 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",

note = "Copyright: Copyright 2021 Elsevier B.V., All rights reserved.; 12th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2008 ; Conference date: 03-09-2008 Through 05-09-2008",

year = "2008",

doi = "10.1007/978-3-540-85565-1_103",

language = "English",

isbn = "3540855645",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

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

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

PB - Springer Verlag

T2 - 12th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2008

Y2 - 3 September 2008 through 5 September 2008

ER -

Readable representations for large-scale bipartite graphs

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this