ISBN:
9781783987412
Language:
English
Pages:
1 Online-Ressource (1 volume)
Parallel Title:
Erscheint auch als Khokhar, Devangana Gephi Cookbook
DDC:
302.3
Keywords:
Social networks Data processing
;
Information visualization Computer programs
;
Graphic methods Computer programs
;
Charts, diagrams, etc Computer programs
;
PSYCHOLOGY ; Social Psychology
;
Charts, diagrams, etc ; Computer programs
;
Graphic methods ; Computer programs
;
Electronic books
;
Electronic books
Abstract:
Adding nodes and edges to the graphEditing node attributes in the graph; Finding out the shortest path in the graph; Setting the edge and label properties; Setting basic properties for graphs, nodes, edges, and labels; Changing the background color of the graph; Generating a heat map for the graph; Showing convex hulls for the graph where a hierarchy exists; Showing/hiding various parts of the graph; Reverting changes in the graph to the original presets; Creating a PNG file directly from the graph window in user-specified sizes; Chapter 3: Using Graph Layout Algorithms; Introduction.
Abstract:
Cover; Copyright; Credits; About the Author; Acknowledgments; About the Reviewers; www.PacktPub.com; Table of Contents; Preface; Chapter 1: Getting Started with Gephi; Introduction; Installing Gephi; Troubleshooting Gephi installation; Exploring Gephi's graphical user interface; The basics of working in the Overview mode; The basics of working in the Data Laboratory mode; The basics of working in the Preview mode; Chapter 2: Basic Graph Manipulations; Introduction; Generating a random graph; Selecting and highlighting nodes in the graph; Coloring and sizing nodes in the graph.
Abstract:
If you want to learn network analysis and visualization along with graph concepts from scratch, then this book is for you. This is ideal for those of you with little or no understanding of Gephi and this domain, but will also be beneficial for those interested in expanding their knowledge and experience
Abstract:
Partitioning the graph based on node attributesPartitioning the graph based on edge attributes; Configuring node colors in a graph by ranking nodes; Configuring node sizes in a graph by ranking nodes; Configuring node label colors in a graph by ranking nodes; Configuring node label sizes in a graph by ranking nodes; Configuring edge colors in a graph by ranking edges; Configuring the colors of edge labels in a graph by ranking edges; Configuring the size of edge labels in a graph by ranking edges; Chapter 5: Running Metrics, Filters, and Timelines; Introduction.
Abstract:
Selecting a list of metrics for a graphFinding the average degree and average weighted degree of a graph; Finding the network diameter; Finding graph density; Finding the HITS value for a graph; Finding a graph's modularity; Finding a graph's PageRank; Finding connected components in a graph; Getting a node overview of a graph; Getting an edge overview of a graph; Getting dynamic statistics for a graph; Applying individual filters on a graph; Applying a combination of filters on a graph; Filtering dynamic graphs based on time intervals; Chapter 6: Working in the Data Laboratory Mode.
Abstract:
Using the Clockwise Rotate layout algorithmUsing the Counter-Clockwise Rotate layout algorithm; Using the Contraction layout algorithm; Using the Expansion layout algorithm; Using the Force Atlas layout algorithm; Using the Force Atlas 2 layout algorithm; Using the Fruchterman Reingold layout algorithm; Using the Label Adjust layout algorithm; Using the Random Layout algorithm; Using the Yifan Hu layout algorithm; Using the Yifan Hu Proportional layout algorithm; Using the Yifan Hu Multilevel layout algorithm; Chapter 4: Working with Partition and Ranking Algorithms; Introduction.
Note:
"Quick answers to common problems"--Cover
,
Includes index
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
Permalink
