gephi-教程.pdf

发布时间：2022-06-10 发布人：admin 分类：说明书资料大小：1.76M 资料格式：pdf 举报版权申诉

ZAICHENMO-3076750-4744302542976621638.pdf-第1页.png

第1页 / 共32页

ZAICHENMO-3076750-4744302542976621638.pdf-第2页.png

第2页 / 共32页

ZAICHENMO-3076750-4744302542976621638.pdf-第3页.png

第3页 / 共32页

ZAICHENMO-3076750-4744302542976621638.pdf-第4页.png

第4页 / 共32页

ZAICHENMO-3076750-4744302542976621638.pdf-第5页.png

第5页 / 共32页

ZAICHENMO-3076750-4744302542976621638.pdf-第6页.png

第6页 / 共32页

ZAICHENMO-3076750-4744302542976621638.pdf-第7页.png

第7页 / 共32页

ZAICHENMO-3076750-4744302542976621638.pdf-第8页.png

第8页 / 共32页

文本预览

Tutorial Quick Start Gephi Tutorial Quick Start * Introduction * Import file * Visualization * Layout * Ranking (color) * Metrics * Ranking (size) * Layout again * Show labels * Community-detection * Partition * Filter * Preview * Export * Save * Conclusion Welcome to this introduction tutorial. It will guide you to the basic steps of network visualization and manipulation in Gephi. Gephi version 0.7alpha2 was used to do this tutorial. Get Gephi Last updated March 05th, 2010

Tutorial Quick Start * Introduction * Import file * Visualization * Layout * Ranking (color) * Metrics * Ranking (size) * Layout again * Show labels * Community-detection * Partition * Filter * Preview * Export * Save * Conclusion Open Graph File • Download the file LesMiserables.gexf • In the menubar, go to File Menu and Open... Graph Format - GEXF - GraphML - Pajek NET - GDF - GML - Tulip TLP - CSV - Compressed ZIP

Tutorial Quick Start * Introduction * Import file * Visualization * Layout * Ranking (color) * Metrics * Ranking (size) * Layout again * Show labels * Community-detection * Partition * Filter * Preview * Export * Save * Conclusion Import Report • When your filed is opened, the report sum up data found and issues. - Number of nodes - Number of edges - Type of graph • Click on OK to validate and see the graph

Tutorial Quick Start * Introduction * Import file * Visualization * Layout * Ranking (color) * Metrics * Ranking (size) * Layout again * Show labels * Community-detection * Partition * Filter * Preview * Export * Save * Conclusion You should now see a graph We imported “Les Miserables” dataset1. Coappearance weighted network of characters in the novel “Les Miserables” from Victor Hugo. Nodes position is random at first, so you may see a slighty different representation. 1 D. E. Knuth, The Stanford GraphBase: A Platform for Combinatorial Computing, Addison-Wesley, Reading, MA (1993).

Tutorial Quick Start * Introduction * Import file * Visualization * Layout * Ranking (color) * Metrics * Ranking (size) * Layout again * Show labels * Community-detection * Partition * Filter * Preview * Export * Save * Conclusion Graph Visualization • Use your mouse to move and scale the visualization - Zoom: Mouse Wheel - Pan: Right Mouse Drag • Locate the “Edge Thickness” slider on the bottom • If you loose your graph, reset the position Zoom Drag

Tutorial Quick Start * Introduction * Import file * Visualization * Layout * Ranking (color) * Metrics * Ranking (size) * Layout again * Show labels * Community-detection * Partition * Filter * Preview * Export * Save * Conclusion Layout the graph Layout algorithms sets the graph shape, it is the most essential action. • Locate the Layout module, on the left panel. • Choose “Force Atlas” You can see the layout properties below, leave default values. • Click on to launch the algorithm Layout algorithms Graphs are usually layouted with “Force-based” algorithms. Their principle is easy, linked nodes attract each other and non-linked nodes are pushed apart.

Tutorial Quick Start * Introduction * Import file * Visualization * Layout * Ranking (color) * Metrics * Ranking (size) * Layout again * Show labels * Community-detection * Partition * Filter * Preview * Export * Save * Conclusion Control the layout The purpose of Layout Properties is to let you control the algorithm in order to make a aesthetically pleasing representation. • Set the “Repulsion strengh” at 10 000 to expand the graph. • Type “Enter” to validate the changed value. • And now the algorithm.

You should now see a layouted graph Tutorial Quick Start * Introduction * Import file * Visualization * Layout * Ranking (color) * Metrics * Ranking (size) * Layout again * Show labels * Community-detection * Partition * Filter * Preview * Export * Save * Conclusion

分享到：

赞收藏

资料库

gephi-教程.pdf

相关推荐

网络技术

热门标签

最新资料