Scalable Node Embedding Algorithms Using Distributed Sparse Matrix Operations

We introduce a distributed memory parallel algorithm for force-directed node embedding that places vertices of a graph into a low-dimensional vector space based on the interplay of attraction among neighboring vertices and repulsion among distant vertices. We develop our algorithms using two sparse...

Full description

Bibliographic Details

Published in:	2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) pp. 1199 - 1201
Main Authors:	Ranawaka, Isuru, Azad, Ariful
Format:	Conference Proceeding
Language:	English
Published:	IEEE 27.05.2024
Subjects:	Conferences Data transfer Distributed processing Embedding Parallel algorithms SDDMM Sparse matrices Sparse Matrix Computation SpMM Supercomputers Vectors
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!