IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v416y2022ics0096300321008304.html
   My bibliography  Save this article

Topological indices based on 2- or 3-eccentricity to predict anti-HIV activity

Author

Listed:
  • Yu, Guihai
  • Li, Xingfu
  • He, Deyan

Abstract

As molecular descriptors, topological indices based on k-eccentricity of a graph are introduced. Firstly we devise an algorithm for these indices based on 3-eccentricity and analyze the computing complexity. As their applications, we employ the topological indcies based on 2- and 3-eccentricity as the feature vectors to predict anti-HIV activity by devising machine learning predicting models with the help of Support Vector Machine (SVM), K Nearest Neighbor (KNN) and Decision Tree (DecTree), respectively. Experiment results show that the highest accuracy is 99.7%, while the lowest is 97.7% except the special cases. The special cases are that the experiments are with the single 2-CEI or 3-CEI as the feature vector, respectively. Through these experiments, we find that these topological indices based on the k-eccentricity (k=2,3) have good applications in predicting anti-HIV activity. But not every feature vector is generally applicable. Different feature vectors may be used to different models. Furthermore, there is no clear relationship between the dimension of feature vectors and the accuracy of prediction.

Suggested Citation

  • Yu, Guihai & Li, Xingfu & He, Deyan, 2022. "Topological indices based on 2- or 3-eccentricity to predict anti-HIV activity," Applied Mathematics and Computation, Elsevier, vol. 416(C).
    • Handle: RePEc:eee:apmaco:v:416:y:2022:i:c:s0096300321008304
    DOI: 10.1016/j.amc.2021.126748
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300321008304
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2021.126748?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sun, Daoqiang & Li, Long & Liu, Kai & Wang, Hua & Yang, Yu, 2022. "Enumeration of subtrees of planar two-tree networks," Applied Mathematics and Computation, Elsevier, vol. 434(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:416:y:2022:i:c:s0096300321008304. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.