CTAGE: Curvature-Based Topology-Aware Graph Embedding for Learning Molecular Representations
AI-driven drug design relies significantly on predicting molecular properties, which is a complex task. In current approaches, the most commonly used feature representations for training deep neural network models are based on SMILES and molecular graphs. While these methods are concise and efficient, they have limitations in capturing complex spatial information. Recently, researchers have recognized the importance of incorporating three-dimensional information of molecular structures into models. However, capturing spatial information requires the introduction of additional units in the generator, bringing additional design and computational costs. Therefore, it is necessary to develop a method for predicting molecular properties that effectively combines spatial structural information while maintaining the simplicity and efficiency of graph neural networks. In this work, we propose an embedding approach CTAGE, utilizing $k$-hop discrete Ricci curvature to extract structural insights from molecular graph data. This effectively integrates spatial structural information while preserving the training complexity of the network. Experimental results indicate that introducing node curvature significantly improves the performance of current graph neural network frameworks, validating that the information from k-hop node curvature effectively reflects the relationship between molecular structure and function.
Code (0)
등록된 구현이 없습니다.
Tasks
Drug DesignGraph EmbeddingGraph Neural NetworkMolecular Property PredictionProperty PredictionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
GraphMoRE: Mitigating Topological Heterogeneity via Mixture of Riemannian Experts
Real-world graphs have inherently complex and diverse topological patterns, known as topological heterogeneity. Most existing works learn graph representation in a single constant curvature space that is insufficient to …
Dynamic Graph Prompting via Topology-Routed Mixed-Curvature Experts
Dynamic graph prompting freezes a pre-trained temporal backbone and adapts it to label-scarce downstream tasks using lightweight prompts. However, existing methods operate within a single, fixed embedding space. In this …
Node ClassificationLink PredictionCurvature Regularization to Prevent Distortion in Graph Embedding
Recent research on graph embedding has achieved success in various applications. Most graph embedding methods preserve the proximity in a graph into a manifold in an embedding space. We argue an important but neglected p…
Graph EmbeddingOver-Squashing in Riemannian Graph Neural Networks
Most graph neural networks (GNNs) are prone to the phenomenon of over-squashing in which node features become insensitive to information from distant nodes in the graph. Recent works have shown that the topology of the g…
Product Manifold Representations for Learning on Biological Pathways
Machine learning models that embed graphs in non-Euclidean spaces have shown substantial benefits in a variety of contexts, but their application has not been studied extensively in the biological domain, particularly wi…
Graph Neural NetworkGraph Representation LearningRepresentation Learning