Evidence map›Paper›PMID 35959292›Full record

ArticleFrontiers in aging neuroscience2022

Alzheimer-Compound Identification Based on Data Fusion and forgeNet_SVM.

Bin Yang, Wenzheng Bao, Shichai Hong

Erratum issuedOpen access · goldAbstract read
In one paragraph

Article in Frontiers in aging neuroscience, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. An erratum has been issued. Cited by 5 papers.

0numbers the graph read from it
0cells of the map it votes in
5citing papers in PubMed
1.2field-weighted citation impact, top 19% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

5 citing papers in PubMed, 9 citations in OpenAlex.

  1. Review
  2. Article
  3. Review
  4. Article
  5. Review
4 · The record

Corrections and comments

5 · Who and what money

Authors and funding

3 authors at 3 institutions in 1 country.

Bin YangSchool of Information Science and Engineering, Zaozhuang University, Zaozhuang, China.
Wenzheng BaoSchool of Information and Electrical Engineering, Xuzhou University of Technology, Xuzhou, China.
Shichai HongDepartment of Vascular Surgery, Zhongshan Hospital, Fudan University, Xiamen, China.
Fudan University · CNXuzhou University of Technology · CNZaozhuang University · CN

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Rapid screening and identification of potential candidate compounds are very important to understand the mechanism of drugs for the treatment of Alzheimer's disease (AD) and greatly promote the development of new drugs. In order to greatly improve the success rate of screening and reduce the cost and workload of research and development, this study proposes a novel Alzheimer-related compound identification algorithm namely forgeNet_SVM. First, Alzheimer related and unrelated compounds are collected using the data mining method from the literature databases. Three molecular descriptors (ECFP6, MACCS, and RDKit) are utilized to obtain the feature sets of compounds, which are fused into the all_feature set. The all_feature set is input to forgeNet_SVM, in which forgeNet is utilized to provide the importance of each feature and select the important features for feature extraction. The selected features are input to support vector machines (SVM) algorithm to identify the new compounds in Traditional Chinese Medicine (TCM) prescription. The experiment results show that the selected feature set performs better than the all_feature set and three single feature sets (ECFP6, MACCS, and RDKit). The performances of TPR, FPR, Precision, Specificity, F1, and AUC reveal that forgeNet_SVM could identify more accurately Alzheimer-related compounds than other classical classifiers.

Indexed as

Alzheimerdata fusionfeature selectionmachine learningnetwork pharmacologyvirtual screening

Identifiers

PMID35959292
PMCPMC9357977
OpenAlexW4287147560

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.