Systems for Scalable Graph Analytics and Machine Learning: Trends and Methods
Graph-theoretic algorithms and graph machine learning models are essential tools for addressing many real-life problems, such as social network analysis and bioinformatics. To support large-scale graph analytics, graph-parallel systems have been actively developed for over one decade, such as Google's Pregel and Spark's GraphX, which (i) promote a think-like-a-vertex computing model and target (ii) iterative algorithms and (iii) those problems that output a value for each vertex. However, this model is too restricted for supporting the rich set of heterogeneous operations for graph analytics and machine learning that many real applications demand.
Authors
- Lyuheng Yuan (ORCID: https://orcid.org/0000-0002-4374-8161)
- Saugat Adhikari (ORCID: https://orcid.org/0000-0002-7846-2200)
- Da Yan (ORCID: https://orcid.org/0000-0002-4653-0408)
- Akhlaque Ahmad (ORCID: https://orcid.org/0000-0001-6988-5335)
Institutions
- Indiana University Bloomington (US)
Publication Details
- Published
- 2024-10-20
- DOI
- https://doi.org/10.1145/3627673.3679101
- Citations
- 1
- Primary Topic
- Graph Theory and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.25
Funders
- National Science Foundation
- U.S. Department of Energy