Predicting activities without computing descriptors: graph machines for QSAR.
We describe graph machines, an alternative approach to traditional machine-learning-based QSAR, which circumvents the problem of designing, computing and selecting molecular descriptors. In that approach, which is similar in spirit to recursive networks, molecules are considered as structured data, represented as graphs. For each example of the data set, a mathematical function (graph machine) is built, whose structure reflects the structure of the molecule under consideration; it is the combination of identical parameterised functions, called "node functions" (e.g. a feedforward neural network). The parameters of the node functions, shared both within and across the graph machines, are adjusted during training with the "shared weights" technique. Model selection is then performed by traditional cross-validation. Therefore, the designer's main task consists in finding the optimal complexity for the node function. The efficiency of this new approach has been demonstrated in many QSAR or QSPR tasks, as well as in modelling the activities of complex chemicals (e.g. the toxicity of a family of phenols or the anti-HIV activities of HEPT derivatives). It generally outperforms traditional techniques without requiring the selection and computation of descriptors.
Goulon
A
A
Laboratoire d'Electronique, Ecole Supérieure de Physique et de Chimie Industrielles de la Ville de Paris (ESPCI-ParisTech), 10 rue Vauquelin, 75005 Paris, France.
Picot
T
T
Duprat
A
A
Dreyfus
G
G
D019380:Anti-HIV Agents / Q000494:pharmacology; D015197:Carcinogenicity Tests / Q000379:methods; D003196:Computer Graphics; D003198:Computer Simulation; D016571:Neural Networks, Computer; D010636:Phenols / Q000633:toxicity; D021281:Quantitative Structure-Activity Relationship
D019380:Anti-HIV Agents; D010636:Phenols