Anchored Map: Graph Drawing Technique to Support Network Mining
Summary :
Because network diagrams drawn using the spring embedder are not easy to read, this paper proposes the use of "anchored maps" in which some nodes are fixed as anchors. The readability of network diagrams is discussed, anchored maps are proposed, and a method for drawing anchored maps is explained. The method uses indices to decide the orders of anchors because those orders markedly affect the readability of the network diagrams. Examples showing the effectiveness of the anchored maps are also shown.
- Publication
- IEICE TRANSACTIONS on Information Vol.E91-D No.11 pp.2599-2606
- Publication Date
- 2008/11/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1093/ietisy/e91-d.11.2599
- Type of Manuscript
- Special Section PAPER (Special Section on Knowledge, Information and Creativity Support System)
- Category
- Knowledge Discovery and Data Mining
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kazuo MISUE, "Anchored Map: Graph Drawing Technique to Support Network Mining" in IEICE TRANSACTIONS on Information,
vol. E91-D, no. 11, pp. 2599-2606, November 2008, doi: 10.1093/ietisy/e91-d.11.2599.
Abstract: Because network diagrams drawn using the spring embedder are not easy to read, this paper proposes the use of "anchored maps" in which some nodes are fixed as anchors. The readability of network diagrams is discussed, anchored maps are proposed, and a method for drawing anchored maps is explained. The method uses indices to decide the orders of anchors because those orders markedly affect the readability of the network diagrams. Examples showing the effectiveness of the anchored maps are also shown.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e91-d.11.2599/_p
Copy
@ARTICLE{e91-d_11_2599,
author={Kazuo MISUE, },
journal={IEICE TRANSACTIONS on Information},
title={Anchored Map: Graph Drawing Technique to Support Network Mining},
year={2008},
volume={E91-D},
number={11},
pages={2599-2606},
abstract={Because network diagrams drawn using the spring embedder are not easy to read, this paper proposes the use of "anchored maps" in which some nodes are fixed as anchors. The readability of network diagrams is discussed, anchored maps are proposed, and a method for drawing anchored maps is explained. The method uses indices to decide the orders of anchors because those orders markedly affect the readability of the network diagrams. Examples showing the effectiveness of the anchored maps are also shown.},
keywords={},
doi={10.1093/ietisy/e91-d.11.2599},
ISSN={1745-1361},
month={November},}
Copy
TY - JOUR
TI - Anchored Map: Graph Drawing Technique to Support Network Mining
T2 - IEICE TRANSACTIONS on Information
SP - 2599
EP - 2606
AU - Kazuo MISUE
PY - 2008
DO - 10.1093/ietisy/e91-d.11.2599
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E91-D
IS - 11
JA - IEICE TRANSACTIONS on Information
Y1 - November 2008
AB - Because network diagrams drawn using the spring embedder are not easy to read, this paper proposes the use of "anchored maps" in which some nodes are fixed as anchors. The readability of network diagrams is discussed, anchored maps are proposed, and a method for drawing anchored maps is explained. The method uses indices to decide the orders of anchors because those orders markedly affect the readability of the network diagrams. Examples showing the effectiveness of the anchored maps are also shown.
ER -
English
