The DOI matches its Crossref record.
Comparison of Descriptor Spaces for Chemical Compound Retrieval and Classification
Abstract
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 has been an active area of research. Many of the best-performing techniques for these tasks utilize a descriptor-based representation of the compound that captures various aspects of the underlying molecular graph's topology. In this paper we compare different set of descriptors that are currently used for chemical compound classification. In this process, we also introduce four different descriptors derived from all connected fragments present in the molecular graphs. In addition, we introduce an extension to existing vector-based kernel functions to take into account the length of the fragments present in the descriptors. We experimentally evaluate the performance of the previously introduced and the new descriptors in the context of SVM-based classification and ranked-retrieval on 28 classification and retrieval problems derived from 18 datasets. Our experiments show that for both these tasks, the new descriptors consistently and statistically outperform previously developed schemes based on the widely used fingerprint- and Maces keys-based descriptors, as well as recently introduced descriptors obtained by mining and analyzing the structure of the molecular graphs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Graph neural networks: A review of methods and applications
Zhou, J., Cui, G., Hu, S., Zhang, Z., Yang, C., Liu, Z., Wang, L., Li, C., & Sun, M. (2020) · AI Open · doi:10.1016/j.aiopen.2021.01.001 · Cited by 6,880
DeepGCNs: Can GCNs Go As Deep As CNNs?
Li, G., Muller, M., Thabet, A., & Ghanem, B. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00936 · Cited by 1,400
Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs
Simonovsky, M., & Komodakis, N. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.11 · Cited by 1,266
Yanardag, P., & Vishwanathan, S. V. N. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783417 · Cited by 1,021
Managing and Mining Graph Data
(2010) · Advances in Database Systems · doi:10.1007/978-1-4419-6045-0 · Cited by 594
Graph Self-Supervised Learning: A Survey
Liu, Y., Jin, M., Pan, S., Zhou, C., Zheng, Y., Xia, F., & Yu, P. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3172903 · Cited by 510
Comparison of descriptor spaces for chemical compound retrieval and classification
Wale, N., Watson, I. A., & Karypis, G. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0103-5 · Cited by 453
Self-citationSelf-Supervised Learning of Graph Neural Networks: A Unified Review
Xie, Y., Xu, Z., Zhang, J., Wang, Z., & Ji, S. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3170559 · Cited by 389
Kriege, N. M., Johansson, F. D., & Morris, C. (2020) · Applied Network Science · doi:10.1007/s41109-019-0195-3 · Cited by 381
Lee, J., Lee, I., & Kang, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.08082 · Cited by 349
Graph-Based Semi-Supervised Learning: A Comprehensive Review
Song, Z., Yang, X., Xu, Z., & King, I. (2023) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3155478 · Cited by 334
Graph Convolutional Networks with EigenPooling
Ma, Y., Wang, S., Aggarwal, C. C., & Tang, J. (2019) · Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3292500.3330982 · Cited by 320
A gentle introduction to deep learning for graphs
Bacciu, D., Errica, F., Micheli, A., & Podda, M. (2020) · Neural Networks · doi:10.1016/j.neunet.2020.06.006 · Cited by 305
Mining significant graph patterns by leap search
Yan, X., Cheng, H., Han, J., & Yu, P. S. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376662 · Cited by 291
Self-Supervised Learning on Graphs: Contrastive, Generative, or Predictive
Wu, L., Lin, H., Tan, C., Gao, Z., & Li, S. Z. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3131584 · Cited by 290
van Westen, G. J. P., Wegner, J. K., IJzerman, A. P., van Vlijmen, H. W. T., & Bender, A. (2011) · MedChemComm · doi:10.1039/c0md00165a · Cited by 176
Metadata
- Authors
- Wale, N., & Karypis, G.
- Venue
- Sixth International Conference on Data Mining (ICDM'06)
- Publisher
- IEEE
- Published
- 2006-12
- Pages
- 678-689
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W3144386677
- Cited by
- 226
- References
- 0
- FWCI
- 5.74
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.