AFGen is a program that takes as input a set of chemical compounds and generates their vector-space representation based on the set of fragment-based descriptors they contain. The descriptor space consists of graph fragments that can have three different types of topologies: paths (PF), acyclic subgraphs (AF), and arbitrary topology subgraphs (GF). This vector-based representation can be used for different tasks in cheminformatics including similarity search, virtual screening, and library design. These descriptors are quite effective in capturing the structural characteristics of chemical compounds. Experiments in the context of SVM-based classification and ranked-retrieval show that these descriptors consistently and statistically outperform previously developed schemes based on the widely used fingerprint- and Maccs keys-based descriptors, as well as recently introduced descriptors obtained by mining and analyzing the structure of the molecular graphs.

References in zbMATH (referenced in 17 articles )

Showing results 1 to 17 of 17.
Sorted by year (citations)

  1. Ahmed, Ammar; Hassan, Zohair Raza; Shabbir, Mudassir: Interpretable multi-scale graph descriptors via structural compression (2020)
  2. Kriege, Nils M.; Neumann, Marion; Morris, Christopher; Kersting, Kristian; Mutzel, Petra: A unifying view of explicit and implicit feature maps of graph kernels (2019)
  3. Ghosh, Swarnendu; Das, Nibaran; Gonçalves, Teresa; Quaresma, Paulo; Kundu, Mahantapas: The journey of graph kernels through two decades (2018)
  4. Bai, Lu; Hancock, Edwin R.: Fast depth-based subgraph kernels for unattributed graphs (2016)
  5. Neumann, Marion; Garnett, Roman; Bauckhage, Christian; Kersting, Kristian: Propagation kernels: efficient graph kernels from propagated information (2016)
  6. Gaüzère, Benoit; Grenier, Pierre-Anthony; Brun, Luc; Villemin, Didier: Treelet kernel incorporating cyclic, stereo and inter pattern information in chemoinformatics (2015)
  7. Bai, Lu; Hancock, Edwin R.: Depth-based complexity traces of graphs (2014)
  8. Schietgat, Leander; Ramon, Jan; Bruynooghe, Maurice: A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (2013)
  9. Li, Geng; Semerci, Murat; Yener, Bülent; Zaki, Mohammed J.: Effective graph classification based on topological and label attributes (2012)
  10. Rohban, Mohammad Hossein; Rabiee, Hamid R.: Supervised neighborhood graph construction for semi-supervised classification (2012)
  11. Schietgat, Leander; Costa, Fabrizio; Ramon, Jan; De Raedt, Luc: Effective feature construction by maximum common subgraph sampling (2011)
  12. Chen, You-Shyang; Cheng, Ching-Hsue: Forecasting PGR of the financial industry using a rough sets classifier based on attribute-granularity (2010) ioport
  13. Thoma, Marisa; Cheng, Hong; Gretton, Arthur; Han, Jiawei; Kriegel, Hans-peter; Smola, Alex; Song, Le; Yu, Philip S.; Yan, Xifeng; Borgwardt, Karsten M.: Discriminative frequent subgraph mining with optimality guarantees (2010)
  14. Kamath, Chandrika: Scientific data mining. A practical perspective. (2009)
  15. Saigo, Hiroto; Nowozin, Sebastian; Kadowaki, Tadashi; Kudo, Taku; Tsuda, Koji: gBoost: a mathematical programming approach to graph classification and regression (2009) ioport
  16. Wale, Nikil; Watson, Ian A.; Karypis, George: Comparison of descriptor spaces for chemical compound retrieval and classification (2008) ioport
  17. Wale, Nikil; Watson, Ian A.; Karypis, George: Comparison of descriptor spaces for chemical compound retrieval and classification (2008) ioport

Further publications can be found at: