Improving graph neural network expressivity via subgraph isomorphism counting
While Graph Neural Networks (GNNs) have achieved remarkable results in a variety of
applications, recent studies exposed important shortcomings in their ability to capture the …
applications, recent studies exposed important shortcomings in their ability to capture the …
The journey of graph kernels through two decades
In the real world all events are connected. There is a hidden network of dependencies that
governs behavior of natural processes. Without much argument it can be said that, of all the …
governs behavior of natural processes. Without much argument it can be said that, of all the …
BigSMILES: a structurally-based line notation for describing macromolecules
Having a compact yet robust structurally based identifier or representation system is a key
enabling factor for efficient sharing and dissemination of research results within the …
enabling factor for efficient sharing and dissemination of research results within the …
Comparison of descriptor spaces for chemical compound retrieval and classification
N Wale, IA Watson, G Karypis - Knowledge and Information Systems, 2008 - Springer
In recent years the development of computational techniques that build models to correctly
assign chemical compounds to various classes or to retrieve potential drug-like compounds …
assign chemical compounds to various classes or to retrieve potential drug-like compounds …
Efficiently mining frequent trees in a forest
MJ Zaki - Proceedings of the eighth ACM SIGKDD international …, 2002 - dl.acm.org
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining
semistructured data, and so on. We formulate the problem of mining (embedded) subtrees in …
semistructured data, and so on. We formulate the problem of mining (embedded) subtrees in …
Frequent substructure-based approaches for classifying chemical compounds
M Deshpande, M Kuramochi, N Wale… - IEEE Transactions on …, 2005 - ieeexplore.ieee.org
Computational techniques that build models to correctly assign chemical compounds to
various classes of interest have many applications in pharmaceutical research and are used …
various classes of interest have many applications in pharmaceutical research and are used …
Finding Frequent Patterns in a Large Sparse Graph*
M Kuramochi, G Karypis - Data mining and knowledge discovery, 2005 - Springer
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a
single and unified framework many of the relational, spatial, topological, and other …
single and unified framework many of the relational, spatial, topological, and other …
Mining molecular fragments: Finding relevant substructures of molecules
C Borgelt, MR Berthold - 2002 IEEE International Conference …, 2002 - ieeexplore.ieee.org
We present an algorithm to find fragments in a set of molecules that help to discriminate
between different classes of for instance, activity in a drug discovery context. Instead of …
between different classes of for instance, activity in a drug discovery context. Instead of …
Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication
How can we generate realistic graphs? In addition, how can we do so with a mathematically
tractable model that makes it feasible to analyze their properties rigorously? Real graphs …
tractable model that makes it feasible to analyze their properties rigorously? Real graphs …
Machine Learning Methods for Property Prediction in Chemoinformatics: Quo Vadis?
This paper is focused on modern approaches to machine learning, most of which are as yet
used infrequently or not at all in chemoinformatics. Machine learning methods are …
used infrequently or not at all in chemoinformatics. Machine learning methods are …