A Simple Visualization Method for Three-Dimensional (3D) Network
The network is a concept that can be seen a lot in many areas of research. It is used to describe and interpret datasets in various fields such as social network, biological network, and metabolic regulation network. As a result, network diagrams appeared in various forms, and methods for visualizin...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2021/1426212 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832568547668131840 |
|---|---|
| author | Sangkwon Kim Chaeyoung Lee Jintae Park Sungha Yoon Yongho Choi Junseok Kim |
| author_facet | Sangkwon Kim Chaeyoung Lee Jintae Park Sungha Yoon Yongho Choi Junseok Kim |
| author_sort | Sangkwon Kim |
| collection | DOAJ |
| description | The network is a concept that can be seen a lot in many areas of research. It is used to describe and interpret datasets in various fields such as social network, biological network, and metabolic regulation network. As a result, network diagrams appeared in various forms, and methods for visualizing the network information are being developed. In this article, we present a simple method with a weight of information data to visualize the network diagram for the three-dimensional (3D) network. The generic method of network visualization is a circular representation with many intersections. When dealing with a lot of data, the three-dimensional network graphics, which can be rotated, are easier to analyze than the two-dimensional (2D) network. The proposed algorithm focuses on visualizing three factors: the position and size of the nodes and the thickness of the edge between linked nodes. In the proposed method, an objective function is defined, which consists of two parts to locate the nodes: (i) a constraint for given distance, which is the weight of the relationship among all the data, and (ii) the mutual repulsive force among the given nodes. We apply the gradient descent method to minimize the objective function. The size of the nodes and the thickness of the edges are defined by using the weight of each node and the weight between other nodes associated with it, respectively. To demonstrate the performance of the proposed algorithm, the relationships of the characters in the two novels are visualized using 3D network diagram. |
| format | Article |
| id | doaj-art-13476845de274874a49833335913a501 |
| institution | Kabale University |
| issn | 1026-0226 1607-887X |
| language | English |
| publishDate | 2021-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Discrete Dynamics in Nature and Society |
| spelling | doaj-art-13476845de274874a49833335913a5012025-02-03T00:58:47ZengWileyDiscrete Dynamics in Nature and Society1026-02261607-887X2021-01-01202110.1155/2021/14262121426212A Simple Visualization Method for Three-Dimensional (3D) NetworkSangkwon Kim0Chaeyoung Lee1Jintae Park2Sungha Yoon3Yongho Choi4Junseok Kim5Department of Mathematics, Korea University, Seoul 02841, Republic of KoreaDepartment of Mathematics, Korea University, Seoul 02841, Republic of KoreaDepartment of Mathematics, Korea University, Seoul 02841, Republic of KoreaDivision of Applied Mathematical Sciences, Korea University, Sejong 30019, Republic of KoreaDepartment of Mathematics and Big Data, Daegu University, Gyeongsan-si, Gyeongsangbuk-do 38453, Republic of KoreaDepartment of Mathematics, Korea University, Seoul 02841, Republic of KoreaThe network is a concept that can be seen a lot in many areas of research. It is used to describe and interpret datasets in various fields such as social network, biological network, and metabolic regulation network. As a result, network diagrams appeared in various forms, and methods for visualizing the network information are being developed. In this article, we present a simple method with a weight of information data to visualize the network diagram for the three-dimensional (3D) network. The generic method of network visualization is a circular representation with many intersections. When dealing with a lot of data, the three-dimensional network graphics, which can be rotated, are easier to analyze than the two-dimensional (2D) network. The proposed algorithm focuses on visualizing three factors: the position and size of the nodes and the thickness of the edge between linked nodes. In the proposed method, an objective function is defined, which consists of two parts to locate the nodes: (i) a constraint for given distance, which is the weight of the relationship among all the data, and (ii) the mutual repulsive force among the given nodes. We apply the gradient descent method to minimize the objective function. The size of the nodes and the thickness of the edges are defined by using the weight of each node and the weight between other nodes associated with it, respectively. To demonstrate the performance of the proposed algorithm, the relationships of the characters in the two novels are visualized using 3D network diagram.http://dx.doi.org/10.1155/2021/1426212 |
| spellingShingle | Sangkwon Kim Chaeyoung Lee Jintae Park Sungha Yoon Yongho Choi Junseok Kim A Simple Visualization Method for Three-Dimensional (3D) Network Discrete Dynamics in Nature and Society |
| title | A Simple Visualization Method for Three-Dimensional (3D) Network |
| title_full | A Simple Visualization Method for Three-Dimensional (3D) Network |
| title_fullStr | A Simple Visualization Method for Three-Dimensional (3D) Network |
| title_full_unstemmed | A Simple Visualization Method for Three-Dimensional (3D) Network |
| title_short | A Simple Visualization Method for Three-Dimensional (3D) Network |
| title_sort | simple visualization method for three dimensional 3d network |
| url | http://dx.doi.org/10.1155/2021/1426212 |
| work_keys_str_mv | AT sangkwonkim asimplevisualizationmethodforthreedimensional3dnetwork AT chaeyounglee asimplevisualizationmethodforthreedimensional3dnetwork AT jintaepark asimplevisualizationmethodforthreedimensional3dnetwork AT sunghayoon asimplevisualizationmethodforthreedimensional3dnetwork AT yonghochoi asimplevisualizationmethodforthreedimensional3dnetwork AT junseokkim asimplevisualizationmethodforthreedimensional3dnetwork AT sangkwonkim simplevisualizationmethodforthreedimensional3dnetwork AT chaeyounglee simplevisualizationmethodforthreedimensional3dnetwork AT jintaepark simplevisualizationmethodforthreedimensional3dnetwork AT sunghayoon simplevisualizationmethodforthreedimensional3dnetwork AT yonghochoi simplevisualizationmethodforthreedimensional3dnetwork AT junseokkim simplevisualizationmethodforthreedimensional3dnetwork |