Massively Parallel Graph Drawing and Representation Learning

11/06/2020
by   Christian Böhm, et al.
0

To fully exploit the performance potential of modern multi-core processors, machine learning and data mining algorithms for big data must be parallelized in multiple ways. Today's CPUs consist of multiple cores, each following an independent thread of control, and each equipped with multiple arithmetic units which can perform the same operation on a vector of multiple data objects. Graph embedding, i.e. converting the vertices of a graph into numerical vectors is a data mining task of high importance and is useful for graph drawing (low-dimensional vectors) and graph representation learning (high-dimensional vectors). In this paper, we propose MulticoreGEMPE (Graph Embedding by Minimizing the Predictive Entropy), an information-theoretic method which can generate low and high-dimensional vectors. MulticoreGEMPE applies MIMD (Multiple Instructions Multiple Data, using OpenMP) and SIMD (Single Instructions Multiple Data, using AVX-512) parallelism. We propose general ideas applicable in other graph-based algorithms like vectorized hashing and vectorized reduction. Our experimental evaluation demonstrates the superiority of our approach.

READ FULL TEXT

page 1

page 8

page 9

research
03/02/2021

DM algorithms in healthindustry

This survey reviews several approaches of data mining (DM) in healthindu...
research
09/29/2020

EEMC: Embedding Enhanced Multi-tag Classification

The recently occurred representation learning make an attractive perform...
research
04/19/2021

Algoritmos de minería de datos en la industria sanitaria

In this paper, we review data mining approaches for health applications....
research
09/03/2019

Graph Representation Learning: A Survey

Research on graph representation learning has received a lot of attentio...
research
03/20/2019

Efficient Inner Product Approximation in Hybrid Spaces

Many emerging use cases of data mining and machine learning operate on l...
research
09/20/2022

Streaming Encoding Algorithms for Scalable Hyperdimensional Computing

Hyperdimensional computing (HDC) is a paradigm for data representation a...
research
03/02/2020

Semiparametric Nonlinear Bipartite Graph Representation Learning with Provable Guarantees

Graph representation learning is a ubiquitous task in machine learning w...

Please sign up or login with your details

Forgot password? Click here to reset