Proceedings Article10.1109/WISA.2013.46
Trust Network Visualization Based on Force-Directed Layout
Zaobin Gan,Na Li,Yao Ma,Hongwei Lu +3 more
- 10 Nov 2013
- pp 199-204
5
TL;DR: The public influence weight, the trust strength and the trust distance are defined in this paper and the force-directed visualization algorithm for trust network is proposed and the experimental results show that it can reveal the nature of communities better.
read more
Abstract: As a formal description approach, the trust network can intuitively describe trust relationships among entities in virtual communities and attracts great attentions. The trust network visualization is a key to explore the mechanism of trust propagation and study the trust evaluation. Most existing network visualization approaches only take into account the undirected and unweighted graphs, which cannot illustrate the asymmetry and the discreteness of trust relationships. To solve this issue, we define the public influence weight, the trust strength and the trust distance in this paper and propose the force-directed visualization algorithm for trust network. In the visualization algorithm, the desirable length between two nodes is determined by the trust strength so as to cluster trusted entities, and the forces between two different nodes are determined by their public influence weights so as to center on the heavyweight entities. Finally, the visualization experiments are carried out on the Epinions data set and the performance of the proposed algorithm is compared with the classical force-directed layout algorithm. The experimental results show that it can reveal the nature of communities better.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Force-directed algorithms as a tool to support community detection
Alessandra M. M. M. Gouvêa,Tiago Silva da Silva,Elbert E. N. Macau,Elbert E. N. Macau,Marcos G. Quiles +4 more
TL;DR: This paper explores the use of force-directed algorithms as a tool to solve the community detection problem and revisits the works proposed and points out the similarities, but mainly highlights the particularities of such a problem concerning the draw of a general graph.
7
A Generalized Force-Directed Layout for Multiplex Sociograms.
Zahra Fatemi,Mostafa Salehi,Matteo Magnani +2 more
- 25 Sep 2018
TL;DR: This paper introduces multiforce, a force-directed layout for multiplex networks where both intra-layer and inter-layer relationships among nodes are used to compute node coordinates, and can reproduce the main existing approaches to draw multiplex sociograms, and also supports a new intermediate type of layout.
3
•Posted Content
A simple multiforce layout for multiplex networks
TL;DR: This work introduces multiforce, a force-directed layout for multiplex networks, where the nodes of the network are organized into multiple layers and both in-layer and inter-layer relationships among nodes are used to compute node coordinates.
1
A Visualization Method for Hierarchical Structure Information of the Food Inspection Data Based on Force-Directed Model
Qiang Cai,Qiang Li,Haisheng Li,Dianhui Mao +3 more
- 14 Oct 2017
TL;DR: This paper extracted a hierarchical and high-dimensional dataset from the food inspection data for visualization, and proposed a method based on the force-directed model, and applied an optimized method to design the interactive mode.
Rhizosphere Microbiome Co-Occurrence Network Analysis across a Tomato Domestication Gradient
Mary Dixon,Antisar Afkairin,Daniel K. Manter,Jorge M. Vivanco +3 more
TL;DR: This study analyzes rhizosphere microbiome co-occurrence networks in tomatoes across a domestication gradient, revealing increased complexity in low-P conditions and varying responsiveness to P fertilizer among wild, traditional, and modern tomato varieties.
References
Multilevel agglomerative edge bundling for visualizing large graphs
Emden R. Gansner,Yifan Hu,Stephen C. North,Carlos Scheidegger +3 more
- 01 Mar 2011
TL;DR: This work proposes a multilevel agglomerative edge bundling method based on a principled approach of minimizing ink needed to represent edges, with additional constraints on the curvature of the resulting splines.