CN115630697B - Knowledge graph construction method and system capable of distinguishing single-phase and double-phase affective disorder - Google Patents

Knowledge graph construction method and system capable of distinguishing single-phase and double-phase affective disorder Download PDF

Info

Publication number
CN115630697B
CN115630697B CN202211317234.XA CN202211317234A CN115630697B CN 115630697 B CN115630697 B CN 115630697B CN 202211317234 A CN202211317234 A CN 202211317234A CN 115630697 B CN115630697 B CN 115630697B
Authority
CN
China
Prior art keywords
affective disorder
relation
triples
triple
constructing
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202211317234.XA
Other languages
Chinese (zh)
Other versions
CN115630697A (en
Inventor
汪洋
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Luzhou Vocational and Technical College
Original Assignee
Luzhou Vocational and Technical College
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Luzhou Vocational and Technical College filed Critical Luzhou Vocational and Technical College
Priority to CN202211317234.XA priority Critical patent/CN115630697B/en
Publication of CN115630697A publication Critical patent/CN115630697A/en
Application granted granted Critical
Publication of CN115630697B publication Critical patent/CN115630697B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00Computing arrangements using knowledge-based models
    • G06N5/02Knowledge representation; Symbolic representation
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/36Creation of semantic tools, e.g. ontology or thesauri
    • G06F16/367Ontology
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/02Neural networks
    • G06N3/08Learning methods
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02ATECHNOLOGIES FOR ADAPTATION TO CLIMATE CHANGE
    • Y02A90/00Technologies having an indirect contribution to adaptation to climate change
    • Y02A90/10Information and communication technologies [ICT] supporting adaptation to climate change, e.g. for weather forecasting or climate simulation

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Computational Linguistics (AREA)
  • Data Mining & Analysis (AREA)
  • General Physics & Mathematics (AREA)
  • Software Systems (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Mathematical Physics (AREA)
  • Evolutionary Computation (AREA)
  • Artificial Intelligence (AREA)
  • Computing Systems (AREA)
  • Biomedical Technology (AREA)
  • Health & Medical Sciences (AREA)
  • Biophysics (AREA)
  • General Health & Medical Sciences (AREA)
  • Molecular Biology (AREA)
  • Animal Behavior & Ethology (AREA)
  • Databases & Information Systems (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention relates to the field of construction of an emotional disorder knowledge map, in particular to a method and a system for constructing a knowledge map capable of distinguishing single-phase and double-phase emotional disorders, wherein the method for constructing the knowledge map capable of distinguishing the single-phase and double-phase emotional disorders ensures the comprehensiveness of data by using a multi-source heterogeneous data source, judges the correctness of the data by calculating the credibility of a relation triple, further achieves the purpose of screening and updating the data in an emotional disorder database in real time, and ensures the accuracy and the real-time performance of the knowledge map; the knowledge graph obtained by the method can distinguish monophasic affective disorder and biphasic affective disorder, has fine content, multi-source data and perfect data fusion, and can support patients and family members with affective disorder to realize self-diagnosis and monitoring and assist doctors in making decisions clinically.

Description

Knowledge graph construction method and system capable of distinguishing single-phase and double-phase affective disorder
Technical Field
The invention relates to the field of construction of an emotional disorder knowledge map, in particular to a method and a system for constructing a knowledge map capable of distinguishing single-phase and double-phase emotional disorders.
Background
Affective disorder (depression) is the fourth disease in the world, however, the medical treatment and prevention of affective disorder are still in a state of low recognition rate, and with the increasing degree of social information, affective disorder begins to appear in a low-age trend. Although the technology for constructing the knowledge graph by using the natural language processing and data mining technology is mature day by day, because the affective disorder has the characteristics of multiple symptoms, high complexity, easy misdiagnosis, difficult type identification and the like in clinic, the content of the constructed Chinese medical knowledge graph related to the affective disorder is simple and rough, particularly the two parts of monophasic affective disorder and bidirectional affective disorder which can be distinguished have similar expression symptoms and are difficult to identify, and the affective disorder knowledge graph which is easy to misdiagnose is not enough to support patients and families with affective disorder to realize self-diagnosis and monitoring and assist doctors in making decisions in clinic. At present, no fine knowledge graph capable of distinguishing single-phase and double-phase affective disorder is successfully constructed, and meanwhile, the constructed knowledgegraph of the diseases of the department of pediatrics has the problems of single data source and low persuasion, so that a method for constructing a fine knowledge graph capable of distinguishing the single-phase and double-phase affective disorder and having multiple data sources and a perfect fusion algorithm is urgently needed.
Disclosure of Invention
Aiming at the defects and the actual requirements in the prior art, the invention provides a method for constructing a knowledge graph capable of distinguishing single-phase and double-phase affective disorders, which comprises the following steps: acquiring multisource heterogeneous affective disorder information, and constructing a basic corpus by using the affective disorder information, wherein the affective disorder information comprises monophasic affective disorder information and biphasic affective disorder information; constructing an initial three-tuple set by extracting entity units and entity relations in the basic corpus; integrating the initial three-tuple set to obtain a target three-tuple set; identifying the polarity of the target triple set relationship triples, and calculating the reliability of the relationship triples according to the polarity; according to the credibility of the relation triplets, dynamically updating the target triplets to obtain an affective disorder database; and constructing a knowledge map capable of distinguishing monophasic affective disorder from bipolar affective disorder by using the dynamically updated affective disorder database. The invention discloses a method for constructing a knowledge graph capable of distinguishing single-phase and double-phase affective disorder, which ensures the comprehensiveness of data through a multi-source heterogeneous data source, judges the correctness of the data through calculating the credibility of a relation triple, achieves the aim of screening and updating data in an affective disorder database in real time, and ensures the accuracy and the real-time performance of the knowledge graph; the knowledge graph obtained by the method can distinguish monophasic affective disorder and biphasic affective disorder, has fine content, multi-source data and perfect data fusion, and can support patients and family members with affective disorder to realize self-diagnosis and monitoring and assist doctors in making decisions clinically.
Optionally, the obtaining of the multi-source heterogeneous affective disorder information and the building of the basic corpus by using the affective disorder information include the following steps: acquiring structured, semi-structured and unstructured monophasic affective disorder information and bipolar affective disorder information from medical authoritative books, medical scientific research papers, hospital electronic medical records and internet data resources respectively; performing data cleansing and format processing on the unipolar affective disorder information and the bipolar affective disorder information; and constructing and obtaining a basic corpus by using the monophasic affective disorder information and the biphasic affective disorder information which are subjected to data cleaning and format processing.
Optionally, the constructing an initial three-tuple set by extracting the entity units and the entity relationships in the base corpus includes the following steps: training a maximum entropy Markov model by a gradient descent method and a convolutional neural network by using the basic corpus; extracting entity units in the basic corpus by using the maximum entropy Markov model; extracting entity relations in the basic corpus by using a convolutional neural network based on the maximum entropy Markov model; extracting attribute features in the entity units, and constructing a binary attribute list by using the attribute features and the entity units; matching the entity units through the binary attribute list to obtain an attribute ternary group set; building a relation three-tuple set by using the entity unit and the entity relation; and summarizing the attribute triple set and the relation triple set, and normalizing the attribute triple set and the relation triple set to obtain an initial triple set.
Optionally, the integrating the initial triplet set to obtain a target triplet set includes the following steps: integrating entity units in the initial triples through entity alignment, and eliminating entity naming reference conflicts in the initial triples; and integrating the attribute characteristics in the initial triples through attribute alignment, and eliminating the attribute characteristic reference conflict in the initial triples.
Optionally, the identifying a polarity of a relationship triplet in the target triplet set, and calculating a reliability of the relationship triplet according to the polarity includes the following steps: tracing the data source of the relation triple, and setting the reliability weight of the relation triple according to the data source; classifying the relation triples according to the entity units to obtain a plurality of groups of relation triple subsets, wherein the content of the entity units of all the relation triples in any relation triple subset is the same; dividing elements in the relation triple subset into positive relation triples and negative relation triples according to entity relations in the relation triples; constructing a credibility function of the relationship triples by using the number of the positive relationship triples, the number of the negative relationship triples and the credibility weights of the relationship triples, wherein the credibility function satisfies the following relationship:
Figure 913998DEST_PATH_IMAGE001
wherein the content of the first and second substances,
Figure 362297DEST_PATH_IMAGE002
representing the total number of relation triples in the target triplet set,
Figure 876455DEST_PATH_IMAGE003
denotes the first
Figure 678189DEST_PATH_IMAGE004
A three-way set of relationships,
Figure 289298DEST_PATH_IMAGE005
representing the total number of relational triplets as
Figure 518286DEST_PATH_IMAGE002
In the target triplet set
Figure 519740DEST_PATH_IMAGE004
The trustworthiness of an individual relationship triplet,
Figure 249798DEST_PATH_IMAGE006
Figure 590781DEST_PATH_IMAGE007
is shown as
Figure 318565DEST_PATH_IMAGE004
The number of forward relationship triples in the subset of relationship triples in which the individual relationship triples reside,
Figure 604053DEST_PATH_IMAGE008
is shown as
Figure 13169DEST_PATH_IMAGE004
The first in the relation triple subset of the relation triple
Figure 67713DEST_PATH_IMAGE009
The number of forward-direction relationship triplets is,
Figure 231978DEST_PATH_IMAGE010
to represent
Figure 880128DEST_PATH_IMAGE008
The confidence level of the received signal is determined,
Figure 951989DEST_PATH_IMAGE011
Figure 329881DEST_PATH_IMAGE012
is shown as
Figure 71572DEST_PATH_IMAGE004
The number of negative-going relationship triples in the subset of relationship triples in which the individual relationship triples reside,
Figure 331652DEST_PATH_IMAGE013
is shown as
Figure 82570DEST_PATH_IMAGE004
The first in the relation triple subset of the relation triple
Figure 314969DEST_PATH_IMAGE014
A negative-going relationship triple of the one,
Figure 617774DEST_PATH_IMAGE015
to represent
Figure 240516DEST_PATH_IMAGE013
The confidence weight of (2); according to the reliability function, obtainAnd taking the reliability of the relation triple function.
Optionally, the dynamically updating the target triplet set according to the reliability of the relationship triplets to obtain the affective disorder database includes the following steps: tracing the data source of the relation triple, and setting the credibility threshold of the relation triple according to the data source; acquiring an untrusted relation triple by combining the credibility with the credibility threshold; and rejecting the unreliable relation triples in the target triples set, and dynamically updating the target triples set to obtain the affective disorder database.
Optionally, the confidence threshold satisfies the following formula:
Figure 857442DEST_PATH_IMAGE016
wherein, the first and the second end of the pipe are connected with each other,
Figure 741085DEST_PATH_IMAGE017
is shown as
Figure 107736DEST_PATH_IMAGE004
The confidence threshold of each relationship triplet may be,
Figure 342408DEST_PATH_IMAGE018
denotes the first
Figure 497446DEST_PATH_IMAGE004
The maximum confidence weight of the forward relation triple in the relation triple subset in which the relation triple is located,
Figure 376540DEST_PATH_IMAGE019
denotes the first
Figure 286727DEST_PATH_IMAGE004
And the minimum credibility weight of the negative relation triple in the relation triple subset in which the relation triple is positioned.
Optionally, the obtaining an untrusted relationship triple by using the reliability in combination with the reliability threshold includes: marking the relation triples with the credibility being more than or equal to the credibility threshold as credibility relation triples; and marking the relation triplets with the credibility less than the credibility threshold value as the non-credible relation triplets.
Optionally, the constructing a knowledge map capable of distinguishing monophasic affective disorder from bipolar affective disorder by using the dynamically updated affective disorder database comprises the following steps: tracing the data source of the triples in the dynamically updated affective disorder database; dividing the affective disorder database into a monophasic affective disorder sub-database and a bipolar affective disorder sub-database according to the data source; constructing a single-layer single-phase affective disorder knowledge map by utilizing the single-phase affective disorder sub-database; constructing a single-layer bipolar affective disorder knowledge graph by using the bipolar affective disorder sub-database; extracting common factors in the monophasic affective disorder sub-database and the bipolar affective disorder sub-database, wherein the common factors comprise entity units of the triplets; constructing a middle layer of monophasic affective disorder and biphasic affective disorder through common factors; and constructing a knowledge graph capable of distinguishing monophasic affective disorder from bipolar affective disorder by using the single-layer monophasic affective disorder knowledge graph, the single-layer bipolar affective disorder knowledge graph and the middle layer.
In a second aspect, the present invention further provides a knowledge graph constructing system capable of distinguishing single-phase and double-phase affective disorders, which includes a processor, an input device, an output device and a memory, where the processor, the input device, the output device and the memory are connected to each other, where the memory is used for storing a computer program, and the computer program includes program instructions, and the processor is configured to call the program instructions to execute the method for constructing a knowledge graph capable of distinguishing single-phase and double-phase affective disorders according to the first aspect.
Drawings
FIG. 1 is a flow chart of a method for constructing a knowledge base map capable of distinguishing single-phase and double-phase affective disorders;
FIG. 2 is a partial content schematic diagram of a knowledge-map of the present invention that distinguishes between unipolar and bipolar affective disorders;
FIG. 3 is a diagram of a construction system of a knowledge map for distinguishing single-phase and double-phase affective disorders in accordance with the present invention.
Detailed Description
Specific embodiments of the present invention will be described in detail below, and it should be noted that the embodiments described herein are only for illustration and are not intended to limit the present invention. In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention. However, it will be apparent to one of ordinary skill in the art that: it is not necessary to employ these specific details to practice the present invention. In other instances, well-known circuits, software, or methods have not been described in detail in order to avoid obscuring the present invention.
Throughout the specification, reference to "one embodiment," "an embodiment," "one example" or "an example" means: the particular features, structures, or characteristics described in connection with the embodiment or example are included in at least one embodiment of the invention. Thus, the appearances of the phrases "in one embodiment," "in an embodiment," "one example" or "an example" in various places throughout this specification are not necessarily all referring to the same embodiment or example. Furthermore, the particular features, structures, or characteristics may be combined in any suitable combination and/or sub-combination in one or more embodiments or examples. Further, those of ordinary skill in the art will appreciate that the illustrations provided herein are for illustrative purposes and are not necessarily drawn to scale.
Referring to fig. 1, in one embodiment, the present invention provides a method for constructing a knowledge graph capable of distinguishing single-phase and double-phase affective disorders, comprising the following steps:
s1, obtaining multisource heterogeneous affective disorder information, and building a basic corpus by using the affective disorder information.
The affective disorder information includes unipolar affective disorder information and bipolar affective disorder information. In an optional embodiment, the obtaining of the multi-source heterogeneous affective disorder information and building a basic corpus by using the affective disorder information in step S1 includes the following steps: acquiring structured, semi-structured and unstructured monophasic affective disorder information and bipolar affective disorder information from medical authoritative books, medical scientific research papers, hospital electronic medical records and internet data resources respectively; performing data cleaning and format processing on the monophasic affective disorder information and the biphasic affective disorder information; and constructing and obtaining a basic corpus by using the monophasic affective disorder information and the biphasic affective disorder information which are subjected to data cleaning and format processing.
In this embodiment, the medical authoritative book is selected from textbooks used by the medical college and medical books published by the medical publishing house. The medical scientific research paper is obtained by downloading websites such as the Hopkins, the Uygur Pups, the Wanfang websites and the like; the hospital electronic medical record is obtained by carrying out desensitization treatment on the visit data of the hospital; the desensitization process is a process of transforming the visit data to remove individual privacy information in the visit data, and is intended to protect the security of information such as privacy data. Crawling the internet data resources by using a web crawler, wherein the web crawler is specifically selected as a focused web crawler; the medical or popular science type network related to the affective disorder theme which is defined in advance is selectively crawled by utilizing the focused web crawler, hardware and network resources are greatly saved by utilizing the focused web crawler, meanwhile, the updating is quick, and the requirement on the information in the medical field can be well met. Structured, semi-structured and unstructured monophasic affective disorder information data and biphasic affective disorder information data are obtained through multiple ways, and richness and comprehensiveness of data sources are guaranteed. And the data cleaning represents that the data resources of the monophasic affective disorder information and the biphasic affective disorder information are screened, and wrong data resources are removed. The format processing means that the data resource formats of the unipolar affective disorder information and the bipolar affective disorder information are uniformly formatted. And the multisource heterogeneous affective disorder information is converted into a uniform format by using data cleaning and format processing, and a basic corpus is constructed by using the multisource heterogeneous affective disorder information with the uniform format, so that the subsequent data processing is facilitated, and the efficiency of the subsequent data processing is improved.
In yet another alternative embodiment, the data sources of unipolar affective disorder information and bipolar affective disorder information include, but are not limited to, medical authoritative books, medical research papers, hospital electronic medical records and internet data sources, i.e., the data sources can be adjusted and selected according to actual situations.
And S2, constructing an initial three-tuple set by extracting entity units and entity relations in the basic corpus.
In an optional embodiment, the constructing an initial three-tuple set by extracting entity units and entity relationships in the base corpus in step S2 includes the following steps: training a maximum entropy Markov model by a gradient descent method and a convolutional neural network by utilizing the basic corpus; extracting entity units in the basic corpus by using the maximum entropy Markov model; extracting entity relations in the basic corpus by using a convolutional neural network based on the maximum entropy Markov model; extracting attribute features in the entity units, and constructing a binary attribute list by using the attribute features and the entity units; matching the entity units through the binary attribute list to obtain an attribute ternary group set; constructing a relation three-tuple set by using the entity unit and the entity relation; and summarizing the attribute triple set and the relation triple set, and normalizing the attribute triple set and the relation triple set to obtain an initial triple set.
The maximum entropy Markov model is a model commonly used for extracting part of entity units in the construction of the knowledge graph, but only the maximum entropy Markov model is used for extracting the entity units in the basic corpus, so that the extraction process is long in time consumption, high in cost and poor in expansibility; therefore, the method adopts a convolution neural network which utilizes a gradient descent method and deep learning to combine with a maximum entropy Markov model to realize entity unit extraction, wherein the convolution neural network comprises two hidden convolution layers, a maximum pooling layer and a full-link layer, the convolution layers are used for extracting features in a basic corpus, and the maximum pooling layer is used for reserving main features in the features, so that the purpose of dimension reduction is achieved; the full connection layer is used for classifying the main features. The entity units in the basic corpus are extracted by the maximum entropy Markov model trained continuously by utilizing the gradient descent method and the convolutional neural network, so that the loss in the process of extracting the entity units is greatly reduced, and the generalization capability of the original maximum entropy Markov model is improved by increasing the diversity of the features extracted from the basic corpus.
In this embodiment, the entity unit includes entity terms such as affective disorder type, treatment drug name, clinical symptom name, etc.; the attribute characteristics comprise characteristic attribute vocabularies such as 'caution items', 'adverse reactions', 'contraindications' and the like of the medicine for treating the bidirectional affective disorder; entity relationships include relational terms such as actions, and the like between nouns of entities, for example: "treat", "side effects", "for". The form of the attribute feature may be specifically selected as L = { L1, …, li }, where Li represents a certain attribute feature in the attribute list, and a binary attribute list is constructed by using the attribute feature and the entity unit, that is, the entity unit randomly and any attribute feature select to form a binary attribute group, and the binary attribute list can be obtained by summarizing the binary attribute group. The binary attribute group form in the binary attribute list is selected as < entity, attribute >. And matching the entity units again through the binary attribute list to obtain an attribute ternary group set, wherein the attribute ternary group in the attribute ternary group set is in the form of an entity, an attribute and an entity. The form of the relationship triplet set in the relationship triplet set built by using the entity unit and the entity relationship is < entity, relationship, entity >.
In an alternative embodiment, the notes, adverse reactions, contraindications and the like of the medicine for treating the bidirectional affective disorder are extracted and matched by entity units and attribute features to obtain a corresponding binary attribute list, and the binary attribute list comprises the following binary attribute groups: < drugs for treating bidirectional affective disorder, precautions >, < drugs for treating bidirectional affective disorder, adverse reactions > and < drugs for treating bidirectional affective disorder, contraindications >; and then through the attribute three-tuple set obtained by the binary attribute list matching entity unit, the method comprises the following steps: < drugs for treating bilateral affective disorder, attention points, sleep >, < drugs for treating bilateral affective disorder, adverse reactions, emesis > and < drugs for treating bilateral affective disorder, taboo, alcohol >.
In yet another optional embodiment, the aggregating the attribute triple set and the relationship triple set, and the initial triple set obtained by normalizing the attribute triple set and the relationship triple set includes: (ii) a lithium carbonate tablet, a side effect, diarrhea > and a paroxetine hydrochloride tablet, treatment, major depressive disorder >, wherein the lithium carbonate tablet, side effect, diarrhea > are from a ternary set of attributes; the paroxetine hydrochloride tablet, treatment and major depressive disorder are from the relation triad.
And S3, integrating the initial three-tuple set to obtain a target three-tuple set.
In an optional embodiment, the integrating the initial triplet set to obtain the target triplet set in step S3 includes the following steps: integrating entity units in the initial triples through entity alignment, and eliminating entity naming reference conflicts in the initial triples; and integrating the attribute characteristics in the initial triples through attribute alignment, and eliminating the attribute characteristic reference conflict in the initial triples.
In this embodiment, by aligning the entity units and the attribute features of the triples in the initial triplet set, language expression problems including, but not limited to, entity naming reference conflicts, attribute naming reference conflicts, and the like are eliminated, where the entity naming reference conflicts can be specifically expressed as: the drug Paroxetine hydrochloride tablet for treating major depressive disorder has other names including leter, le You, sultam and pareoxetine. Error data, repeated data, redundant data, ambiguous data and relevance conflict data in the initial triple set are eliminated through alignment operation, the accuracy of the target triple set is guaranteed, and meanwhile noise generated in subsequent operation based on the target triple set is reduced.
And S4, identifying the polarity of the target triple set relationship triples, and calculating the reliability of the relationship triples according to the polarity.
In an optional embodiment, the identifying the polarity of the relationship triplet in the target triplet set and calculating the reliability of the relationship triplet according to the polarity in step S4 includes the following steps: tracing the data source of the relation triple, and setting the reliability weight of the relation triple according to the data source; classifying the relation triples according to the entity units to obtain a plurality of groups of relation triple subsets, wherein the content of the entity units of all the relation triples in any relation triple subset is the same; dividing elements in the relation triple subset into positive relation triples and negative relation triples according to entity relations in the relation triples; constructing a reliability function of the relation triples by using the number of the positive relation triples, the number of the negative relation triples and the reliability weights of the relation triples, wherein the reliability function satisfies the following relations:
Figure 618483DEST_PATH_IMAGE001
wherein, the first and the second end of the pipe are connected with each other,
Figure 577211DEST_PATH_IMAGE002
representing the total number of relation triples in the target triplet set,
Figure 169867DEST_PATH_IMAGE003
is shown as
Figure 126321DEST_PATH_IMAGE004
A three-way set of relationships,
Figure 273269DEST_PATH_IMAGE005
the total number of the relation triplets is represented as
Figure 832426DEST_PATH_IMAGE002
In the target triplet set
Figure 686113DEST_PATH_IMAGE004
The trustworthiness of an individual relationship triplet,
Figure 406944DEST_PATH_IMAGE006
Figure 41188DEST_PATH_IMAGE007
is shown as
Figure 13823DEST_PATH_IMAGE004
The number of forward relationship triples in the subset of relationship triples in which the individual relationship triples reside,
Figure 112229DEST_PATH_IMAGE008
is shown as
Figure 879328DEST_PATH_IMAGE004
The first in the relation triple subset of the relation triple
Figure 868DEST_PATH_IMAGE009
The number of forward-direction relationship triplets is,
Figure 167407DEST_PATH_IMAGE020
Figure 464527DEST_PATH_IMAGE010
represent
Figure 996003DEST_PATH_IMAGE008
The confidence value of (a) is calculated,
Figure 135997DEST_PATH_IMAGE011
Figure 981593DEST_PATH_IMAGE012
is shown as
Figure 523433DEST_PATH_IMAGE004
The number of negative-going relational triples in the subset of relational triples in which the respective relational triples lie,
Figure 225810DEST_PATH_IMAGE013
is shown as
Figure 994046DEST_PATH_IMAGE004
The first in the relation triple subset of the relation triple
Figure 236808DEST_PATH_IMAGE014
A negative-going relationship triple of the one,
Figure 836417DEST_PATH_IMAGE021
Figure 647378DEST_PATH_IMAGE015
to represent
Figure 761964DEST_PATH_IMAGE013
The confidence weight of (2); and acquiring the reliability of the relation triple function according to the reliability function. In this embodiment, the reliability of any relation triple in the target triple set is obtained through the reliability function constructed by the method, and a data basis is provided for removing error data by using the reliability subsequently.
In an alternative embodiment, a relational triple < entity a, relational, entity B > has 2 data sources, one from the medical paper and another from the internet crawl data: the confidence weight of the data source from the medical paper can be set to 1.5, and the confidence weight of the data source on the internet can be set to 1.2.
In an alternative embodiment, a triple of relationship is a positive triple of relationship and a negative triple of relationship, specifically, the positive triple of relationship is < paroxetine hcl, available for treatment, major depressive disorder >; the negative relation triple is < paroxetine hydrochloride tablets, no treatment, major depression >.
And S5, dynamically updating the target ternary group set according to the reliability of the relation ternary group to obtain an affective disorder database.
In an optional embodiment, the step S5 of dynamically updating the target triplet set according to the credibility of the relationship triplets to obtain the dysaffective disorder database includes the following steps: tracing the data source of the relation triple, and setting the credibility threshold of the relation triple according to the data source; acquiring an untrusted relation triple by combining the credibility with the credibility threshold; and rejecting the unreliable relation triples in the target triples set, and dynamically updating the target triples set to obtain the affective disorder database. In this embodiment, the obtaining an untrusted relationship triple by using the reliability in combination with the reliability threshold includes the following steps: the relation triples with the credibility being larger than or equal to the credibility threshold are marked as credibility relation triples; and marking the relation triplets with the credibility less than the credibility threshold value as the non-credible relation triplets. In the invention, each relation triple < entity, relation and entity > needs to be judged to be correct by credibility, and is screened by using credibility, so that the correct credible relation triple is kept to enter map construction, and the accuracy of the knowledge map is further ensured.
In a further alternative embodiment, by the confidence function proposed in an alternative embodiment of step S4:
Figure 418205DEST_PATH_IMAGE001
on the basis, a self-adaptive weighting reliability threshold estimation method related to a data source of a relation triple is designed, namely, for different relation triples, a corresponding reliability threshold can be obtained through a reliability threshold function provided by the method, and the specific reliability threshold function meets the following formula:
Figure 137899DEST_PATH_IMAGE016
wherein the content of the first and second substances,
Figure 244395DEST_PATH_IMAGE017
is shown as
Figure 721644DEST_PATH_IMAGE004
The confidence threshold of each relationship triplet may be,
Figure 509472DEST_PATH_IMAGE018
is shown as
Figure 880410DEST_PATH_IMAGE004
The maximum confidence weight of the forward relation triple in the relation triple subset in which the relation triple is located,
Figure 33174DEST_PATH_IMAGE019
is shown as
Figure 856773DEST_PATH_IMAGE004
And the minimum credibility weight of the negative relation triple in the relation triple subset in which the relation triple is positioned. Because the data source of the invention is dynamically updated, along with the update of the data, the credibility values of different relation triples and the corresponding credibility threshold values are also dynamically updated, namely along with the increase of the data quantity and the credibility of the data, the contents in the dysthymia database for creating the knowledge graph are also continuously updated and iterated, and the accuracy and the real-time performance of the data are ensured.
In yet another alternative embodiment, the operations of aligning, identifying polarity, and the like performed by steps S4 and S5 on the initial triplet set may be implemented by the following codes:
s41, begin; // Start;
s42, initialization; v/initialization;
s43, for Ei ϵ E ← aligned; // physical alignment operation;
s44, for Li ϵ L ← aligned; // attribute alignment operation;
s45, RDG = update (RDF); updating the initial triple to obtain a target triple;
S46、end;
s47, for q in RDG; calculating the polarity of the relationship triples in the updated target triples;
S48、
Figure 448292DEST_PATH_IMAGE001
(ii) a V/calculate relationship triple confidence
Figure 814682DEST_PATH_IMAGE005
A value;
S49、if (
Figure 997402DEST_PATH_IMAGE005
>=
Figure 777139DEST_PATH_IMAGE017
) then//
Figure 844452DEST_PATH_IMAGE005
(ii) a The reliability is greater than or equal to the reliability threshold value
Figure 924404DEST_PATH_IMAGE017
S410, q = 1; the polarity of a relation triple q is set to be 1;
s411, D1 ← q; the/relation triple q is put into a credible library D1;
S412、else if (
Figure 746866DEST_PATH_IMAGE005
<
Figure 414565DEST_PATH_IMAGE017
) then //
Figure 410203DEST_PATH_IMAGE005
(ii) a Confidence level less than a confidence level threshold
Figure 220027DEST_PATH_IMAGE017
S413, q = 0; the polarity of a relation triple q is set to be 0;
s414, D2 ← q; the/relation triple q is put into the untrusted library D2;
S415、end if;
S416、end;
s417, if Normal ← Normal ≦ Nupdate } the n; // dynamically updating the base corpus;
s418, update RDG; // update the target triplet set again;
s419, starting the iteration process; // an iterative process;
s420, update D1 and D2; updating a dynamic trusted library D1 and an untrusted library D2;
S421、end.
the above procedure obtains a trusted library D1 and an untrusted library D2 by inputting an initial triplet set, a confidence threshold and a base corpus. Namely, the relationship triplets in the trusted library D1 are trusted relationship triplets, and the relationship triplets in the untrusted library D1 are untrusted relationship triplets.
And S6, constructing a knowledge map capable of distinguishing monophasic affective disorder from biphasic affective disorder by utilizing the dynamically updated affective disorder database.
In an alternative embodiment, the constructing of the knowledgeable map capable of distinguishing between unipolar affective disorder and bipolar affective disorder using the dynamically updated affective disorder database in step S6 comprises the steps of: tracing the data source of the triples in the dynamically updated affective disorder database; dividing the affective disorder database into a monophasic affective disorder sub-database and a biphasic affective disorder sub-database according to the data source; constructing a single-layer single-phase affective disorder knowledge map by utilizing the single-phase affective disorder sub-database; constructing a single-layer bipolar affective disorder knowledge graph by using the bipolar affective disorder sub-database; extracting common factors in the monophasic affective disorder sub-database and the bipolar affective disorder sub-database, wherein the common factors comprise entity units of the triplets; constructing a middle layer of monophasic affective disorder and biphasic affective disorder through common factors; and constructing a knowledge graph capable of distinguishing monophasic affective disorder from bipolar affective disorder by using the single-layer monophasic affective disorder knowledge graph, the single-layer bipolar affective disorder knowledge graph and the middle layer. In this embodiment, the monophasic affective disorder sub-database, the bipolar affective disorder sub-database, and the sub-database formed by the common factors all adopt the open source graph database Neo4j as a bottom storage structure.
The invention is used for constructing the method of the knowledge graph capable of distinguishing the single-phase and double-phase affective disorder diseases, the comprehensiveness of data is ensured through a multi-source heterogeneous data source, and the correctness of the data is judged by calculating the credibility of the relation triple, so that the purposes of screening and updating the data in the affective disorder disease database in real time are achieved, and the accuracy and the real-time performance of the knowledge graph are ensured; the knowledge graph obtained by the method can be used for distinguishing monophasic affective disorder and biphasic affective disorder, meanwhile, the knowledge graph is fine in content, multi-source in data and complete in data fusion, and can support patients and family members with affective disorder to realize self-diagnosis and monitoring and assist doctors in making clinical decisions.
In an alternative embodiment, the local content of the knowledge graph constructed by the method of the present invention, in which the entity units in the triple data model are represented by different colored geometric figures, is shown in fig. 2, and in detail, in the present embodiment, red circles are used to represent the disease types, specifically including bipolar affective disorder and unipolar depression; blue circles are used for representing clinical psychological conditions corresponding to the disease condition, specifically comprising depression, mania, abnormal mood, depressed mood, thought retardation and somatization symptoms, yellow circles are used for representing therapeutic drugs, specifically comprising lithium carbonate tablets and paroxetine hydrochloride tablets, and green circles are used for representing clinical physiological conditions corresponding to the disease condition, specifically comprising nausea, vomiting and dizziness; in fig. 2, TM represents a therapeutic relationship, SE represents a therapeutic drug side effect relationship, SYM represents a symptom relationship of an entity, and EC represents an confusable relationship between entities. And different entity units are represented by using the graphs with different colors, so that the visual identification degree of the knowledge graph is improved.
Referring to fig. 3, the present invention further provides a system for constructing a knowledge graph capable of distinguishing single-phase and double-phase affective disorders, which includes a processor, an input device, an output device, and a memory, where the processor, the input device, the output device, and the memory are connected to each other, where the memory is used to store a computer program, and the computer program includes program instructions, and the processor is configured to call the program instructions to execute the method for constructing a knowledge graph capable of distinguishing single-phase and double-phase affective disorders according to the present invention. The knowledge graph construction system capable of distinguishing the single-phase and double-phase affective disorder is high in integration level, compact in structure and good in stability, and can efficiently execute the knowledge graph construction method capable of distinguishing the single-phase and double-phase affective disorder, so that the practicability of the knowledge graph construction system is further improved.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; such modifications and substitutions do not depart from the spirit and scope of the present invention, and they should be construed as being included in the following claims and description.

Claims (8)

1. A knowledge graph construction method capable of distinguishing single-phase and double-phase affective disorders is characterized by comprising the following steps:
acquiring multisource heterogeneous affective disorder information, and constructing a basic corpus by using the affective disorder information, wherein the affective disorder information comprises monophasic affective disorder information and biphasic affective disorder information;
constructing an initial three-tuple set by extracting entity units and entity relations in the basic corpus;
integrating the initial three-tuple set to obtain a target three-tuple set;
identifying the polarity of the target triple set relationship triples, and calculating the reliability of the relationship triples according to the polarity;
according to the credibility of the relation triplets, dynamically updating the target triplets to obtain an affective disorder database;
constructing a knowledge graph capable of distinguishing monophasic affective disorder from biphasic affective disorder by utilizing the dynamically updated affective disorder database;
the method for acquiring the multisource heterogeneous affective disorder information and building a basic corpus by utilizing the affective disorder information comprises the following steps:
acquiring structured, semi-structured and unstructured monophasic affective disorder information and bipolar affective disorder information from medical authoritative books, medical scientific research papers, hospital electronic medical records and internet data resources respectively;
performing data cleansing and format processing on the unipolar affective disorder information and the bipolar affective disorder information;
constructing a basic corpus by using the monophasic affective disorder information and the biphasic affective disorder information which are subjected to data cleaning and format processing;
the method for establishing the knowledge graph capable of distinguishing the monophasic affective disorder from the biphasic affective disorder by utilizing the dynamically updated affective disorder database comprises the following steps of:
tracing the data source of the triples in the dynamically updated affective disorder database;
dividing the affective disorder database into a monophasic affective disorder sub-database and a biphasic affective disorder sub-database according to the data source;
constructing a single-layer single-phase affective disorder knowledge graph by using the single-phase affective disorder sub-database;
constructing a single-layer bipolar affective disorder knowledge graph by using the bipolar affective disorder sub-database;
extracting common factors in the monophasic affective disorder sub-database and the bipolar affective disorder sub-database, wherein the common factors comprise entity units of the triples;
constructing a middle layer of monophasic affective disorder and biphasic affective disorder through common factors;
and constructing a knowledge graph capable of distinguishing monophasic affective disorder from bipolar affective disorder by using the single-layer monophasic affective disorder knowledge graph, the single-layer bipolar affective disorder knowledge graph and the middle layer.
2. The method for constructing a knowledge graph of distinguishable unipolar and bipolar affective disorders according to claim 1, wherein the constructing of the initial three-tuple set by extracting entity units and entity relationships in the base corpus comprises the following steps:
training a maximum entropy Markov model by a gradient descent method and a convolutional neural network by using the basic corpus;
extracting entity units in the basic corpus by using the maximum entropy Markov model;
extracting entity relations in the basic corpus by using a convolutional neural network based on the maximum entropy Markov model;
extracting attribute features in the entity units, and constructing a binary attribute list by using the attribute features and the entity units;
matching the entity units through the binary attribute list to obtain an attribute ternary group set;
building a relation three-tuple set by using the entity unit and the entity relation;
and summarizing the attribute triple set and the relation triple set, and normalizing the attribute triple set and the relation triple set to obtain an initial triple set.
3. The method for constructing a knowledge graph of distinguishable unipolar and bipolar affective disorders according to claim 1, wherein said integrating said initial triad set to obtain a target triad set comprises the steps of:
integrating entity units in the initial triples through entity alignment, and eliminating entity naming reference conflicts in the initial triples;
and integrating the attribute characteristics in the initial triples through attribute alignment, and eliminating the attribute characteristic reference conflict in the initial triples.
4. The method for constructing a knowledge graph of distinguishable unipolar and bipolar affective disorders according to claim 1, wherein said identifying the polarity of the relationship triplet in the target triplet set and calculating the confidence level of the relationship triplet according to the polarity comprises the steps of:
tracing the data source of the relation triple, and setting the reliability weight of the relation triple according to the data source;
classifying the relation triples according to the entity units to obtain a plurality of groups of relation triple subsets, wherein the content of the entity units of all the relation triples in any relation triple subset is the same;
dividing elements in the relation triple subset into positive relation triples and negative relation triples according to entity relations in the relation triples;
constructing a reliability function of the relation triples by using the number of the positive relation triples, the number of the negative relation triples and the reliability weights of the relation triples, wherein the reliability function satisfies the following relations:
Figure QLYQS_1
wherein the content of the first and second substances,
Figure QLYQS_8
represents the total number of relation triples in the target triplet set, and is asserted>
Figure QLYQS_5
Indicates the fifth->
Figure QLYQS_16
A relationship triple, <' >>
Figure QLYQS_7
A total number of triples representing a relationship of @>
Figure QLYQS_18
Is selected based on the target triplet set>
Figure QLYQS_9
Confidence of individual relationship triples, <' >>
Figure QLYQS_19
,/>
Figure QLYQS_13
Represents a fifth or fifth party>
Figure QLYQS_20
The number of forward relational triples in the subset of relational triples in which a respective relational triple is located, and/or>
Figure QLYQS_2
Represents a fifth or fifth party>
Figure QLYQS_14
The ^ th or greater than or equal to in the subset of relationship triples in which the respective relationship triple is located>
Figure QLYQS_3
A positive relationship triplet +>
Figure QLYQS_22
Represents->
Figure QLYQS_6
In the value of (1), in conjunction with the confidence value of (4)>
Figure QLYQS_15
,/>
Figure QLYQS_10
Indicates the fifth->
Figure QLYQS_23
The number, of negative-going relationship triples in the subset of relationship triples in which a respective relationship triple is located, is/are asserted>
Figure QLYQS_12
Indicates the fifth->
Figure QLYQS_21
Hydro-based relation triplet in a subset of relation triples in which a plurality of relation triples are located>
Figure QLYQS_4
A negative relationship triplet, <' > asserted>
Figure QLYQS_17
Represents->
Figure QLYQS_11
The confidence weight of (2);
and acquiring the reliability of the relation triple function according to the reliability function.
5. The method for constructing a knowledge graph capable of distinguishing the unipolar and the bipolar affective disorders according to claim 4, wherein the step of dynamically updating the target triad set to obtain the affective disorder database according to the credibility of the relationship triad comprises the following steps:
tracing the data source of the relation triple, and setting the credibility threshold of the relation triple according to the data source;
acquiring an untrusted relation triple by combining the credibility with the credibility threshold;
and rejecting the unreliable relation triples in the target triples set, and dynamically updating the target triples set to obtain the affective disorder database.
6. The method of constructing a knowledge-graph distinguishing between unipolar and bipolar affective disorders according to claim 5, wherein said confidence threshold satisfies the following equation:
Figure QLYQS_24
wherein, the first and the second end of the pipe are connected with each other,
Figure QLYQS_25
indicates the fifth->
Figure QLYQS_26
Individual relationship triple confidence threshold, <' >>
Figure QLYQS_27
Indicates the fifth->
Figure QLYQS_28
The maximum confidence weight of the forward relation triple in the relation triple subset in which each relation triple is positioned is determined by the value of the maximum confidence value of the forward relation triple in the relation triple subset in which each relation triple is positioned>
Figure QLYQS_29
Indicates the fifth->
Figure QLYQS_30
And the minimum credibility weight of the negative relation triple in the relation triple subset in which the relation triple is positioned.
7. The method for constructing a knowledge graph for distinguishing between unipolar and bipolar affective disorders according to claim 5, wherein said obtaining of said triplet of incredible relationships using said confidence level in combination with said confidence level threshold comprises the steps of:
marking the relation triples with the credibility being more than or equal to the credibility threshold as credibility relation triples;
and marking the relation triplets with the credibility less than the credibility threshold value as the non-credible relation triplets.
8. A system for constructing a knowledgeable map capable of distinguishing between single and double phase affective disorders, comprising a processor, an input device, an output device, and a memory, wherein the processor, the input device, the output device, and the memory are connected to each other, wherein the memory is used for storing a computer program, and the computer program comprises program instructions, and the processor is configured to call the program instructions to execute the method for constructing a knowledgeable map capable of distinguishing between single and double phase affective disorders according to any one of claims 1 to 7.
CN202211317234.XA 2022-10-26 2022-10-26 Knowledge graph construction method and system capable of distinguishing single-phase and double-phase affective disorder Active CN115630697B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211317234.XA CN115630697B (en) 2022-10-26 2022-10-26 Knowledge graph construction method and system capable of distinguishing single-phase and double-phase affective disorder

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211317234.XA CN115630697B (en) 2022-10-26 2022-10-26 Knowledge graph construction method and system capable of distinguishing single-phase and double-phase affective disorder

Publications (2)

Publication Number Publication Date
CN115630697A CN115630697A (en) 2023-01-20
CN115630697B true CN115630697B (en) 2023-04-07

Family

ID=84905764

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211317234.XA Active CN115630697B (en) 2022-10-26 2022-10-26 Knowledge graph construction method and system capable of distinguishing single-phase and double-phase affective disorder

Country Status (1)

Country Link
CN (1) CN115630697B (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111950285A (en) * 2020-07-31 2020-11-17 合肥工业大学 Intelligent automatic construction system and method of medical knowledge map based on multi-modal data fusion
WO2021008180A1 (en) * 2019-07-16 2021-01-21 扬州大学 Software defect knowledge-oriented knowledge search method

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108052672B (en) * 2017-12-29 2021-10-26 北京师范大学 System and method for promoting structured knowledge graph construction by utilizing group learning behaviors
CN111506697A (en) * 2019-01-30 2020-08-07 北京入思技术有限公司 Cross-modal emotion knowledge graph construction method and device
CN110277167A (en) * 2019-05-31 2019-09-24 南京邮电大学 The Chronic Non-Communicable Diseases Risk Forecast System of knowledge based map
US20210216887A1 (en) * 2020-01-14 2021-07-15 Nec Laboratories America, Inc. Knowledge graph alignment with entity expansion policy network
CN111462841B (en) * 2020-03-12 2023-06-20 华南理工大学 Intelligent depression diagnosis device and system based on knowledge graph
CN112037920A (en) * 2020-08-31 2020-12-04 康键信息技术(深圳)有限公司 Medical knowledge map construction method, device, equipment and storage medium
CN112163169A (en) * 2020-09-29 2021-01-01 海南大学 Multi-mode user emotion analysis method based on knowledge graph
CN112417314A (en) * 2020-11-26 2021-02-26 清华大学 Social network suicidal ideation detection method and system
CN112541086A (en) * 2020-12-14 2021-03-23 江苏大学 Knowledge graph construction method for cerebral apoplexy
CN112863630A (en) * 2021-01-20 2021-05-28 中国科学院自动化研究所 Personalized accurate medical question-answering system based on data and knowledge
CN112883201B (en) * 2021-03-23 2023-11-21 西安电子科技大学昆山创新研究院 Knowledge graph construction method based on big data of intelligent community
CN113707297B (en) * 2021-08-26 2024-04-05 深圳平安智慧医健科技有限公司 Medical data processing method, device, equipment and storage medium

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021008180A1 (en) * 2019-07-16 2021-01-21 扬州大学 Software defect knowledge-oriented knowledge search method
CN111950285A (en) * 2020-07-31 2020-11-17 合肥工业大学 Intelligent automatic construction system and method of medical knowledge map based on multi-modal data fusion

Also Published As

Publication number Publication date
CN115630697A (en) 2023-01-20

Similar Documents

Publication Publication Date Title
CN113707297B (en) Medical data processing method, device, equipment and storage medium
US10331659B2 (en) Automatic detection and cleansing of erroneous concepts in an aggregated knowledge base
US7249129B2 (en) Correlating genealogy records systems and methods
US11640403B2 (en) Methods and systems for automated analysis of behavior modification data
US20150254308A1 (en) Record linkage algorithm for multi-structured data
CN104199855B (en) A kind of searching system and method for traditional Chinese medicine and pharmacy information
WO2023029506A1 (en) Illness state analysis method and apparatus, electronic device, and storage medium
US20190220474A1 (en) Utilizing multiple knowledge bases to form a query response
CN109935337B (en) Medical record searching method and system based on similarity measurement
Kejriwal et al. An unsupervised instance matcher for schema-free RDF data
Kost et al. Exploring generalized association rule mining for disease co-occurrences
US20190325027A1 (en) Interpreting a meaning of a word string
WO2024008043A1 (en) Automated clinical data generation method and system based on causal relationship mining
CN110600121A (en) Knowledge graph-based primary etiology diagnosis method
Kwon et al. Deep learning algorithm to predict need for critical care in pediatric emergency departments
Muppalaneni et al. Soft computing and medical bioinformatics
US11423221B2 (en) Generating a query response utilizing a knowledge database
CN116910172A (en) Follow-up table generation method and system based on artificial intelligence
Saranya et al. Automatic Ontology Framework for Personal Health Service Using Semantic Web
Sunmoo et al. Applying deep learning to understand predictors of tooth mobility among urban Latinos
CN115630697B (en) Knowledge graph construction method and system capable of distinguishing single-phase and double-phase affective disorder
US11386130B2 (en) Converting content from a first to a second aptitude level
Duster Feedback loops in the politics of knowledge production
Murugesan et al. Various Diseases’ Prediction Based on Symptom by Using Machine Learning
CN114547273A (en) Question answering method and related device, electronic equipment and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant