IDEAS home Printed from https://ideas.repec.org/a/hin/complx/8839563.html
   My bibliography  Save this article

Algorithm and Simulation of Association Rules of Drug Relationship Based on Network Model

Author

Listed:
  • Hui Teng
  • Yukun Ma
  • Di Teng

Abstract

Studying drug relationships can provide deeper information for the construction and maintenance of biomedical databases and provide more important references for disease treatment and drug development. The research model has expanded from the previous focus on a certain drug to the systematic analysis of the pharmaceutical network formed between drugs. Network model is suitable for the study of the nonlinear relationship of the pharmaceutical relationship by modeling the data learning. Association rule mining is used to find the potential correlations between the various sets of massive data. Therefore, based on the network model, this research proposed an algorithm for drug interaction under improved association rules, which achieved accurate analysis and decision-making of drug relationship. Meanwhile, this research applied the established association rule algorithm to discuss the relationship between Chinese medicine and mental illness medicine and conducted the algorithm research and simulation analysis of the association relationship. The results showed the association rule algorithm based on the network model constructed was better than other association algorithms. It had reliability and superiority in decision-making in improving the drug-drug relationship. It also promoted the rational use of medicines and played a guiding role in pharmaceutical research. This provides scientific research personnel with research basis and research ideas for disease-related diagnosis.

Suggested Citation

  • Hui Teng & Yukun Ma & Di Teng, 2020. "Algorithm and Simulation of Association Rules of Drug Relationship Based on Network Model," Complexity, Hindawi, vol. 2020, pages 1-14, November.
  • Handle: RePEc:hin:complx:8839563
    DOI: 10.1155/2020/8839563
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2020/8839563.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/8503/2020/8839563.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2020/8839563?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:complx:8839563. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.