paper-with-me

Papers

N-Gram Graph: Simple Unsupervised Representation for Graphs, with Applications to Molecules

2018-06-24 · NeurIPS 2019 12 · Shengchao Liu, Mehmet Furkan Demirel, YIngyu Liang

Machine learning techniques have recently been adopted in various applications in medicine, biology, chemistry, and material engineering. An important task is to predict the properties of molecules, which serves as the main subroutine in many downstream applications such as virtual screening and drug design. Despite the increasing interest, the key challenge is to construct proper representations of molecules for learning algorithms. This paper introduces the N-gram graph, a simple unsupervised representation for molecules. The method first embeds the vertices in the molecule graph. It then constructs a compact representation for the graph by assembling the vertex embeddings in short walks in the graph, which we show is equivalent to a simple graph neural network that needs no training. The representations can thus be efficiently computed and then used with supervised learning methods for prediction. Experiments on 60 tasks from 10 benchmark datasets demonstrate its advantages over both popular graph neural networks and traditional representation methods. This is complemented by theoretical analysis showing its strong representation and prediction power.

📄 PDF Abstract BibTeX arXiv:1806.09206

Code (1)

chao1224/n_gram_graph 공식 구현 pytorch

Tasks

Drug DesignGraph Neural NetworkMolecular Property Prediction

Similar Papers 제목 키워드 기반

UNR-Explainer: Counterfactual Explanations for Unsupervised Node Representation Learning Models

2026-05-17 · Hyunju Kang, Geonhee Han, Hogun Park arxiv

Node representation learning, such as Graph Neural Networks (GNNs), has emerged as a pivotal method in machine learning. The demand for reliable explanation generation surges, yet unsupervised models remain underexplored…

Representation LearningExplanation GenerationLink Prediction

subgraph2vec: Learning Distributed Representations of Rooted Sub-graphs from Large Graphs

2016-06-29 · Annamalai Narayanan, Mahinthan Chandramohan, Lihui Chen, Yang Liu 외

In this paper, we present subgraph2vec, a novel approach for learning latent representations of rooted subgraphs from large graphs inspired by recent advancements in Deep Learning and Graph Kernels. These latent represen…

ClusteringCommunity DetectionGraph ClassificationLink Prediction+1

Polynomial Graph Parsing with Non-Structural Reentrancies

2021-05-05 · Johanna Björklund, Frank Drewes, Anna Jonsson

Graph-based semantic representations are valuable in natural language processing, where it is often simple and effective to represent linguistic concepts as nodes, and relations as edges between them. Several attempts ha…

Abstract Meaning Representation

Parsing for Grammatical Relations via Graph Merging

2017-08-01 · CONLL 2017 8 · Weiwei Sun, Yantao Du, Xiaojun Wan

This paper is concerned with building deep grammatical relation (GR) analysis using data-driven approach. To deal with this problem, we propose graph merging, a new perspective, for building flexible dependency graphs: C…

Finding Maximum Independent Sets in Dynamic Graphs using Unsupervised Learning

2025-05-19 · Devendra Parkar, Anya Chaturvedi, Andréa W. Richa, Joshua J. Daymude

We present the first unsupervised learning model for finding Maximum Independent Sets (MaxIS) in dynamic graphs where edges change over time. Our method combines structural learning from graph neural networks (GNNs) with…