Search Results for author: Md. Khaledur Rahman

Found 6 papers, 3 papers with code

Triple Sparsification of Graph Convolutional Networks without Sacrificing the Accuracy

no code implementations6 Aug 2022 Md. Khaledur Rahman, Ariful Azad

Thus, without sacrificing accuracy, graph sparsification, or model compression becomes a viable approach for graph learning tasks.

Graph Learning Model Compression

MarkovGNN: Graph Neural Networks on Markov Diffusion

1 code implementation5 Feb 2022 Md. Khaledur Rahman, Abhigya Agrawal, Ariful Azad

Most real-world networks contain well-defined community structures where nodes are densely connected internally within communities.

Clustering Node Classification

A Comprehensive Analytical Survey on Unsupervised and Semi-Supervised Graph Representation Learning Methods

no code implementations20 Dec 2021 Md. Khaledur Rahman, Ariful Azad

The learned embeddings have been successfully applied to perform various prediction tasks, such as link prediction, node classification, clustering, and visualization.

Clustering Feature Engineering +5

FusedMM: A Unified SDDMM-SpMM Kernel for Graph Embedding and Graph Neural Networks

1 code implementation7 Nov 2020 Md. Khaledur Rahman, Majedul Haque Sujon, Ariful Azad

We develop a fused matrix multiplication kernel that unifies sampled dense-dense matrix multiplication and sparse-dense matrix multiplication under a single operation called FusedMM.

Graph Embedding

Force2Vec: Parallel force-directed graph embedding

1 code implementation17 Sep 2020 Md. Khaledur Rahman, Majedul Haque Sujon, Ariful Azad

A graph embedding algorithm embeds a graph into a low-dimensional space such that the embedding preserves the inherent properties of the graph.

Clustering Graph Embedding +2

Training Sensitivity in Graph Isomorphism Network

no code implementations19 Aug 2020 Md. Khaledur Rahman

Graph neural network (GNN) is a popular tool to learn the lower-dimensional representation of a graph.

Cannot find the paper you are looking for? You can Submit a new open access paper.