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

Research on the Disease Intelligent Diagnosis Model Based on Linguistic Truth-Valued Concept Lattice

Author

Listed:
  • Li Yang
  • Yuhui Wang
  • Haixia Li
  • Heng Liu

Abstract

Uncertainty natural language processing has always been a research focus in the artificial intelligence field. In this paper, we continue to study the linguistic truth-valued concept lattice and apply it to the disease intelligent diagnosis by building an intelligent model to directly handle natural language. The theoretical bases of this model are the classical concept lattice and the lattice implication algebra with natural language. The model includes the case library formed by patients, attributes matching, and the matching degree calculation about the new patient. According to the characteristics of the patients, the disease attributes are firstly divided into intrinsic invariant attributes and extrinsic variable attributes. The calculation algorithm of the linguistic truth-valued formal concepts and the constructing algorithm of the linguistic truth-valued concept lattice based on the extrinsic attributes are proposed. And the disease bases of the different treatments for different patients with the same disease are established. Secondly, the matching algorithms of intrinsic attributes and extrinsic attributes are given, and all the linguistic truth-valued formal concepts that match the new patient’s extrinsic attributes are found. Lastly, by comparing the similarity between the new patients and the matching formal concepts, we calculate the best treatment options to realize the intelligent diagnosis of the disease.

Suggested Citation

  • Li Yang & Yuhui Wang & Haixia Li & Heng Liu, 2021. "Research on the Disease Intelligent Diagnosis Model Based on Linguistic Truth-Valued Concept Lattice," Complexity, Hindawi, vol. 2021, pages 1-11, May.
  • Handle: RePEc:hin:complx:6630077
    DOI: 10.1155/2021/6630077
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/6630077.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/6630077.xml
    Download Restriction: no

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