Cited by 63Computational Drug Discovery MethodsMachine Learning in Materials ScienceHistory and advancements in chemistry

Support-Vector-Machine-Based Ranking Significantly Improves the Effectiveness of Similarity Searching Using 2D Fingerprints and Multiple Reference Compounds

Geppert, Hanna, Horváth, Tamás, Gärtner, Thomas, Wrobel, Stefan, Bajorath, Jürgen·2008·Journal of Chemical Information and Modeling

Abstract

Similarity searching using molecular fingerprints is computationally efficient and a surprisingly effective virtual screening tool. In this study, we have compared ranking methods for similarity searching using multiple active reference molecules. Different 2D fingerprints were used as search tools and also as descriptors for a support vector machine (SVM) algorithm. In systematic database search calculations, a SVM-based ranking scheme consistently outperformed nearest neighbor and centroid approaches, regardless of the fingerprints that were tested, even if only very small training sets were used for SVM learning. The superiority of SVM-based ranking over conventional fingerprint methods is ascribed to the fact that SVM makes use of information about database molecules, in addition to known active compounds, during the learning phase.

Integrity signals

Registry

Crossref · 10.1021/ci700461s

Cites

27 of 27 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Many other ML methods used in QSAR modeling include k-nearest neighbors, partial least squares, support vector machines, relevance vector machines, random forest, Gaussian processes, and boosting.

    “To put DNNs into context for QSAR, there are many other ML methods used in QSAR modeling including k-nearest neighbors (kNN),53 partial least squares (PLS)54, support vector machines (SVM),55 relevance vector machines, (RVM),56 random forest (RF),57 Gaussian processes (GP),58 and boosting59.”

    From QSAR without borders (2020) · cites this paper as [55]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Geppert, H., Horváth, T., Gärtner, T., Wrobel, S., & Bajorath, J.
Affiliations
University of Bonn (DE)
Corresponding author
Bajorath, Jürgen
Venue
Journal of Chemical Information and Modeling
Published
2008-03-05
Volume
48
Issue
4
Pages
742-746
ISSN
  • 1549-9596 (ISSN-L)
  • 1549-960X
OpenAlex
W2024224430
Cited by
63
References
27
Citations by year
2026: 2 · 2024: 1 · 2023: 1 · 2022: 4 · 2021: 3 · 2020: 3 · 2019: 3 · 2018: 1 · 2017: 4 · 2016: 3 · 2015: 2 · 2014: 1 · 2013: 6 · 2012: 5
FWCI
10.55
Type
journal article
Language
en
Open access
closed
Locations
  • Journal of Chemical Information and Modeling (publishedVersion)
  • PubMed (publishedVersion)
  • Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) (submittedVersion)
  • Fraunhofer-Publica (Fraunhofer-Gesellschaft) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Computational Drug Discovery Methods
  • Physical Sciences › Materials Science › Materials Chemistry › Machine Learning in Materials Science
  • Physical Sciences › Chemistry › Physical and Theoretical Chemistry › History and advancements in chemistry
Keywords
similarity search, support vector machine, ranking algorithms, virtual screening, nearest neighbor search, limited training data

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