Literature DB >> 28344853

SNAP: A General Purpose Network Analysis and Graph Mining Library.

Jure Leskovec1, Rok Sosič1.   

Abstract

Large networks are becoming a widely used abstraction for studying complex systems in a broad set of disciplines, ranging from social network analysis to molecular biology and neuroscience. Despite an increasing need to analyze and manipulate large networks, only a limited number of tools are available for this task. Here, we describe Stanford Network Analysis Platform (SNAP), a general-purpose, high-performance system that provides easy to use, high-level operations for analysis and manipulation of large networks. We present SNAP functionality, describe its implementational details, and give performance benchmarks. SNAP has been developed for single big-memory machines and it balances the trade-off between maximum performance, compact in-memory graph representation, and the ability to handle dynamic graphs where nodes and edges are being added or removed over time. SNAP can process massive networks with hundreds of millions of nodes and billions of edges. SNAP offers over 140 different graph algorithms that can efficiently manipulate large graphs, calculate structural properties, generate regular and random graphs, and handle attributes and meta-data on nodes and edges. Besides being able to handle large graphs, an additional strength of SNAP is that networks and their attributes are fully dynamic, they can be modified during the computation at low cost. SNAP is provided as an open source library in C++ as well as a module in Python. We also describe the Stanford Large Network Dataset, a set of social and information real-world networks and datasets, which we make publicly available. The collection is a complementary resource to our SNAP software and is widely used for development and benchmarking of graph analytics algorithms.

Entities:  

Keywords:  Computing platforms; Data Mining; Data mining; Graph Analytics; Graphs; Information systems → Data management systems; Main memory engines; Networks; Open-Source Software

Year:  2016        PMID: 28344853      PMCID: PMC5361061          DOI: 10.1145/2898361

Source DB:  PubMed          Journal:  ACM Trans Intell Syst Technol        ISSN: 2157-6904            Impact factor:   4.654


  5 in total

1.  Emergence of scaling in random networks

Authors: 
Journal:  Science       Date:  1999-10-15       Impact factor: 47.728

2.  Hierarchical organization in complex networks.

Authors:  Erzsébet Ravasz; Albert-László Barabási
Journal:  Phys Rev E Stat Nonlin Soft Matter Phys       Date:  2003-02-14

3.  Network Lasso: Clustering and Optimization in Large Graphs.

Authors:  David Hallac; Jure Leskovec; Stephen Boyd
Journal:  KDD       Date:  2015-08

4.  Collective dynamics of 'small-world' networks.

Authors:  D J Watts; S H Strogatz
Journal:  Nature       Date:  1998-06-04       Impact factor: 49.962

5.  Ringo: Interactive Graph Analytics on Big-Memory Machines.

Authors:  Yonathan Perez; Rok Sosič; Arijit Banerjee; Rohan Puttagunta; Martin Raison; Pararth Shah; Jure Leskovec
Journal:  Proc ACM SIGMOD Int Conf Manag Data       Date:  2015 May-Jun
  5 in total
  45 in total

1.  Maximizing multiple influences and fair seed allocation on multilayer social networks.

Authors:  Yu Chen; Wei Wang; Jinping Feng; Ying Lu; Xinqi Gong
Journal:  PLoS One       Date:  2020-03-12       Impact factor: 3.240

2.  A Data Structure for Real-Time Aggregation Queries of Big Brain Networks.

Authors:  Florian Johann Ganglberger; Joanna Kaczanowska; Wulf Haubensak; Katja Bühler
Journal:  Neuroinformatics       Date:  2020-01

3.  A stochastic generative model for citation networks among academic papers.

Authors:  Yuichiro Yasui; Junji Nakano
Journal:  PLoS One       Date:  2022-06-29       Impact factor: 3.752

4.  Integrated querying and version control of context-specific biological networks.

Authors:  Tyler Cowman; Mustafa Coşkun; Ananth Grama; Mehmet Koyutürk
Journal:  Database (Oxford)       Date:  2020-01-01       Impact factor: 3.451

5.  Clustering 1-dimensional periodic network using betweenness centrality.

Authors:  Norie Fu; Vorapong Suppakitpaisarn
Journal:  Comput Soc Netw       Date:  2016-10-21

6.  LinkPred: a high performance library for link prediction in complex networks.

Authors:  Said Kerrache
Journal:  PeerJ Comput Sci       Date:  2021-05-21

7.  Universal Constraints on Protein Evolution in the Long-Term Evolution Experiment with Escherichia coli.

Authors:  Rohan Maddamsetti
Journal:  Genome Biol Evol       Date:  2021-06-08       Impact factor: 3.416

8.  Leveraging network analysis to evaluate biomedical named entity recognition tools.

Authors:  Eduardo P García Del Valle; Gerardo Lagunes García; Lucía Prieto Santamaría; Massimiliano Zanin; Ernestina Menasalvas Ruiz; Alejandro Rodríguez-González
Journal:  Sci Rep       Date:  2021-06-29       Impact factor: 4.379

9.  Hybrid harmony search algorithm for social network contact tracing of COVID-19.

Authors:  Ala'a Al-Shaikh; Basel A Mahafzah; Mohammad Alshraideh
Journal:  Soft comput       Date:  2021-06-28       Impact factor: 3.732

10.  Maximally selective single-cell target for circuit control in epilepsy models.

Authors:  Darian Hadjiabadi; Matthew Lovett-Barron; Ivan Georgiev Raikov; Fraser T Sparks; Zhenrui Liao; Scott C Baraban; Jure Leskovec; Attila Losonczy; Karl Deisseroth; Ivan Soltesz
Journal:  Neuron       Date:  2021-06-30       Impact factor: 18.688

View more

北京卡尤迪生物科技股份有限公司 © 2022-2023.