Journal Article10.1002/WICS.1343
Visualizing large graphs
TL;DR: There is a growing need for algorithms and techniques for visualizing very large and complex graphs as mentioned in this paper, and a review of layout algorithms and interactive exploration techniques for large graphs can be found in this article.
read more
Abstract: With the prevalence of big data, there is a growing need for algorithms and techniques for visualizing very large and complex graphs. In this article, we review layout algorithms and interactive exploration techniques for large graphs. In addition, we briefly look at softwares and datasets for visualization graphs, as well as challenges that need to be addressed. WIREs Comput Stat 2015, 7:115-136. doi: 10.1002/wics.1343
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
PAGA: graph abstraction reconciles clustering with trajectory inference through a topology preserving map of single cells
F. Alexander Wolf,Fiona K. Hamey,Mireya Plass,Jordi Solana,Joakim S. Dahlin,Joakim S. Dahlin,Berthold Göttgens,Nikolaus Rajewsky,Lukas M. Simon,Fabian J. Theis +9 more
TL;DR: Partition-based graph abstraction (PAGA) provides an interpretable graph-like map of the arising data manifold, based on estimating connectivity of manifold partitions, which preserves the global topology of data, allow analyzing data at different resolutions, and result in much higher computational efficiency of the typical exploratory data analysis workflow.
The Four Dimensions of Social Network Analysis: An Overview of Research Methods, Applications, and Software Tools
TL;DR: This work proposes the definition of four different dimensions, namely Pattern & Knowledge discovery, Information Fusion & Integration, Scalability, and Visualization, which are used to define a set of new metrics (termed degrees) in order to evaluate the different software tools and frameworks of SNA.
Sybil Defense Techniques in Online Social Networks: A Survey
Muhammad Al-Qurishi,Mabrook Al-Rakhami,Atif Alamri,Majed Alrubaian,Sk. Md. Mizanur Rahman,M. Shamim Hossain +5 more
TL;DR: A comprehensive survey of literature from 2006 to 2016 on Sybil attacks in online social networks and use of social networks as a tool to analyze and prevent these attack types is provided.
119
Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks
TL;DR: Although primarily designed to achieve more informative drawings, the spanning subgraph may also serve as a sparsifier that trims a small-world graph prior to the application of a clustering algorithm.
100
On Proximity and Structural Role-based Embeddings in Networks: Misconceptions, Techniques, and Applications
TL;DR: In this article, the authors formalize the general mechanisms (e.g., random walks and feature diffusion) that give rise to community or role-based structural embeddings, and theoretically prove that embedding methods based on these mechanisms result in either community- or role based structural embedding.
89
References
Collective dynamics of small-world networks
TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
•Book
Data Mining: Concepts and Techniques
Jiawei Han,Micheline Kamber,Jian Pei +2 more
- 08 Sep 2000
TL;DR: This book presents dozens of algorithms and implementation examples, all in pseudo-code and suitable for use in real-world, large-scale data mining projects, and provides a comprehensive, practical look at the concepts and techniques you need to get the most out of real business data.
Modularity and community structure in networks
TL;DR: In this article, the modularity of a network is expressed in terms of the eigenvectors of a characteristic matrix for the network, which is then used for community detection.
Community detection in graphs
TL;DR: A thorough exposition of community structure, or clustering, is attempted, from the definition of the main elements of the problem, to the presentation of most methods developed, with a special focus on techniques designed by statistical physicists.