Compressed graph representation for scalable molecular graph generation
Abstract Recently, deep learning has been successfully applied to molecular graph generation. Nevertheless, mitigating the computational complexity, which increases with the number of nodes in a graph, has been a major challenge. This has hindered the application of deep learning-based molecular gra...
Main Authors: | Youngchun Kwon, Dongseon Lee, Youn-Suk Choi, Kyoham Shin, Seokho Kang |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2020-09-01
|
Series: | Journal of Cheminformatics |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s13321-020-00463-2 |
Similar Items
-
Efficient learning of non-autoregressive graph variational autoencoders for molecular graph generation
by: Youngchun Kwon, et al.
Published: (2019-11-01) -
Community Detection Based on Graph Representation Learning in Evolutionary Networks
by: Dongming Chen, et al.
Published: (2021-05-01) -
A Deep Graph Structured Clustering Network
by: Xunkai Li, et al.
Published: (2020-01-01) -
GraphZIP: a clique-based sparse graph compression method
by: Ryan A. Rossi, et al.
Published: (2018-03-01) -
Graph automorphisms for compression
by: Čibej Uroš, et al.
Published: (2020-12-01)