Computational and Mathematical Methods in Medicine
Volume 2020 (2020), Article ID 1862168, 23 pages
https://doi.org/10.1155/2020/1862168

Research Article

A Semantic Analysis and Community Detection-Based Artificial Intelligence Model for Core Herb Discovery from the Literature: Taking Chronic Glomerulonephritis Treatment as a Case Study

Yun Zhang,¹ Yongguo Liu,¹ Jiajing Zhu,¹ Shuangqing Zhai,² Rongjiang Jin,³ and Chuanbiao Wen⁴

¹Knowledge and Data Engineering Laboratory of Chinese Medicine, School of Information and Software Engineering, University of Electronic Science and Technology of China, Chengdu 610054, China
²School of Basic Medical Science, Beijing University of Chinese Medicine, Beijing 100029, China
³College of Health Preservation and Rehabilitation, Chengdu University of Traditional Chinese Medicine, Chengdu 610075, China
⁴College of Medical Information Engineering, Chengdu University of Traditional Chinese Medicine, Chengdu 611137, China

Correspondence should be addressed to Yongguo Liu; liuyg_cn@163.com

Received 11 March 2020; Revised 14 July 2020; Accepted 14 August 2020; Published 1 September 2020

Academic Editor: Lin Lu

Copyright © 2020 Yun Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

The Traditional Chinese Medicine (TCM) formula is the main treatment method of TCM. A formula often contains multiple herbs where core herbs play a critical therapeutic effect for treating diseases. It is of great significance to find out the core herbs in formulae for providing evidences and references for the clinical application of Chinese herbs and formulae. In this paper, we propose a core herb discovery model CHDSC based on semantic analysis and community detection to discover the core herbs for treating a certain disease from large-scale literature, which includes three stages: corpus construction, herb network establishment, and core herb discovery. In CHDSC, two artificial intelligence modules are used, where the Chinese word embedding algorithm ESSP2VEC is designed to analyse the semantics of herbs in Chinese literature based on the stroke, structure, and pinyin features of Chinese characters, and the label propagation-based algorithm LILPA is adopted to detect herb communities and core herbs in the herbal semantic network constructed from large-scale literature. To validate the proposed model, we choose chronic glomerulonephritis (CGN) as an example, search 1126 articles about how to treat CGN in TCM from the China National Knowledge Infrastructure (CNKI), and apply CHDSC to analyse the collected literature. Experimental results reveal that CHDSC discovers three major herb communities and eighteen core herbs for treating different CGN syndromes with high accuracy. The community size, degree, and closeness centrality distributions of the herb network are analysed to mine the laws of core herbs. As a result, we can observe that core herbs mainly exist in the communities with more than 25 herbs. The degree and closeness centrality of core herb nodes concentrate on the range of [15, 40] and [0.25, 0.45], respectively. Thus, semantic analysis and community detection are helpful for mining effective core herbs for treating a certain disease from large-scale literature.

1. Introduction

Artificial intelligence is the general term of the modern technology of computer science [1], including image recognition [2], network analysis [3], and natural language processing [4]. Artificial intelligence technologies have been utilized in various fields of medicine, for example, automatic disease diagnosis [5], pathogenic network analysis [6], and biological text analysis [7] [8]. Meanwhile, Traditional Chinese Medicine (TCM) plays an important role and provides a unique theoretical and practical way to treat diseases for thousands of years in Chinese history. TCM has many treatments, such as acupuncture, medicinal wine, medicinal formula, and medicinal diet [9, 10]. Among them, medicinal formula, also called as the TCM formula, is the frequently used mode and is made up of several Chinese herbs. The TCM formula has many characteristics, such as compatibility combination, efficacy, treatment mechanism, and medication taboo [9, 11]. Compatibility combination can reflect the rationality of herb combination in formulae and guide TCM doctors to make up formulae [12], which mainly contains the “Sovereign-Minister-Assistant-Courier” combination rule and herb pair combination rule [13] [14]. Among them, the “Sovereign-Minister-Assistant-Courier” combination rule, also known as the “Jun-Chen-Zuo-Shi” combination rule, is a major combination principle of TCM formulae [15]. According to this principle, the sovereign herb plays a major role for dealing with main symptoms and syndromes of diseases, the minister herb helps the sovereign herb to strengthen herbal efficacy, and the assistant and courier herbs provide supporting function to reconcile formulae (e.g., reducing side effects) [15, 16]. Thus, the herbs acting as the sovereign or minister play a key role in terms of treating diseases, while others play an assistant role [16, 17]. In this way, the herbs serving as the sovereign or minister are viewed as core herbs in TCM formulae [17–19]. In other words, a formula contains multiple herbs, and core herbs play a critical therapeutic effect for treating diseases. Many formulae are collected in books, medical records, and scientific literature; however, most of them do not record their core herbs [19], which is difficult for young doctors and learners to master the core concern of formulae and prescribe effective formulae for treating different diseases. Thus, discovering core herbs can help doctors and learners to understand the quintessence of formulae quickly and provide evidences and references for the clinical application of herbs and formulae [16, 18, 19]. Through discovered core herbs, doctors can optimize the herb combination of formulae and synergize herb efficacies to prescribe more effective formulae for treating diseases [15], [19].

In general, researchers mainly explored core herbs by manual analysis [20–22], data analysis [19, 23–27], and clinical and pharmacology experiments [16, 28]. The traditional way to discover core herbs is the manual analysis on TCM books. Researchers first collected the relative books about the TCM treatment of a certain disease and then explored the possible relations between herbs and this disease. Finally, they discovered core herbs according to frequent relations, which is suitable for small-scale researches [20–22]. Recently, researchers utilized data analysis methods, such as statistical approach, association rule, mutual information, and entropy clustering, to analyse the frequency of herbs and their cooccurrence relations in formulae for discovering herbal compatibility rules and core herbs from medical records [19, 23–27]. Data analysis approaches can deal with large-scale medical records; however, they need structured data. It is known that medical records contain personal information (e.g., name, age, and sex), diagnostic information (e.g., laboratory index, symptom, syndrome, and disease), and treatment information (e.g., western drug, Chinese herb, formula, and medical advice) [29] [30]. In order to discover core herbs for treating a certain disease, researchers must extract partial diagnostic and treatment information from large-scale records, which costs more time. Meanwhile, it is worth noting that existing core herb discovery models cannot understand the inner meanings and functions of herbs in these records [19, 23–27]. For example, herb liquorice root (Gan Cao) has many attributes, such as usage, efficacy, and taboo; however, existing models only consider the characters of Chinese words as text, then they cannot capture the implicit characteristics of this herb. In clinical experiments, researchers evaluated the efficacy of different herb combinations of TCM formulae on subjects to find effective herbs as core herbs [28]. In pharmacology experiments, researchers designed evaluation indexes, such as the network recovery index, to measure the scores of different ingredients in TCM formulae to find high score ingredients and considered the herbs with these ingredients as core herbs [16]. The experimental ways focus on few classical formulae and can analyse herb components in clinical trial and microscopic analysis perspectives to achieve high accuracy. However, enumerating all potential herb combinations and ingredients in an experimental way maybe impossible.

Besides books and medical records, there is rich scientific literature containing medical knowledge about TCM formulae [31]. To our best knowledge, there are few researches about discovering core herbs from the scientific literature. We consider some reasons: (1) literature is unstructured text, where disease, formula, and herb information are unevenly distributed in full text and cannot be processed easily; (2) it is hard to analyse the semantics of herbs in the literature; and (3) there are no good ways to represent herb semantics. Minority researchers studied classical literature to mine treatment patterns [32, 33], but they also process them artificially to deal with problem (1). However, they also do not analyse the inner meanings and functions of herbs in the literature for problems (2) and (3). In order to mimic the human learning mode for relatively accurately comprehending the literature and improve the efficiency of literature analysis, we introduce semantic analysis and community detection to handle these problems for analysing large-scale literature and discover core herbs efficiently.

In this paper, we propose an artificial intelligence model CHDSC for discovering the core herb for treating a certain disease based on semantic analysis and community detection, whose framework is shown in Figure 1. CHDSC mainly contains two artificial intelligence modules, in which a semantic analysis module is a natural language processing algorithm for analysing the semantics of herbs in large-scale literature by a Chinese word embedding algorithm ESSP2VEC as described in Section 3.1, and the community detection module is a network analysis algorithm to discover herb communities in the herbal semantic network by a label propagation-based algorithm LILPA as described in Section 3.2. The herbal semantic network is constructed by the semantic similarity of herbs based on the results of the semantic analysis module. The semantics of herbs contain which disease can be treated and how is it treated, then the herbal semantic network can reflect the relations between herbs and disease. Herbs in each community have the same or similar efficacy for treating multiple syndromes of a certain disease. Further, we consider important herbs in each herb community as the core herbs for treating the syndromes characterized by the community.

Figure 1: The framework of CHDSC. CHDSC consists of two modules, semantic analysis and community detection, in which the former is a Chinese word embedding algorithm ESSP2VEC to analyse the semantics of herbs and the latter is a label propagation-based algorithm LILPA to detect herb communities and core herbs. As a case study, we take CGN as an example and discover core herbs to treat different syndromes of CGN.

In order to validate the proposed model, we choose chronic glomerulonephritis (CGN) and discover the core herbs for treating this disease as a case study. Chronic Kidney Disease (CKD) is a class of kidney diseases with proteinuria, oedema, and haematuria as clinical symptoms [34]. The overall prevalence of CKD is 10.8%, and the number of patients in China is up to about 119.5 million [34]. CGN is a typical disease of CKD, which has different symptoms, such as oedema, haematuria, anaemia, albuminuria, and kidney function decrease and may lead to different degrees of renal dysfunction and chronic renal failure. CGN may damage heart function and the central nervous system and threaten life when it is severe [35]. In TCM, CGN is mainly recognized as the syndrome of qi deficiency of the spleen and kidney, the syndrome of deficiency of both qi and yin, the syndrome of yin deficiency of the liver and kidney, the syndrome of yang deficiency of the spleen and kidney, and the syndrome of liver depression and qi stagnation [36]. In addition, CGN also contains the syndrome of fluid-dampness, the syndrome of dampness-heat, the syndrome of blood stasis, and the syndrome of damp-turbidity [36]. It is shown that TCM treatment can improve and recover renal function and alleviate clinical symptoms [37]. Thus, discovering core herbs in TCM formulae for CGN treatment is helpful for improving the curative effect and precisely prescribing medicine. TCM doctors can utilize effective core herbs to form new formulae for treating different syndromes of patients with CGN.

In order to discover core herbs for treating different syndromes of CGN, we propose CHDSC with three stages: corpus construction, herb network establishment, and core herb discovery. The literature of CGN treatment in TCM is acquired from the China National Knowledge Infrastructure (CNKI). In the first stage, the CGN corpus is constructed by preprocessing the collected large-scale literature. In the second stage, a semantic analysis module based on word embedding is proposed by integrating the stroke, structure, and pinyin features of Chinese characters to analyse the semantics of herbs in literature, then the semantic similarity among herbs is measured, and a herbal semantic network is built according to semantic similarity. In the last stage, a community detection module based on label propagation is used to discover herb communities and core herbs in the herbal semantic network. We also analyse the community size, degree, and closeness centrality distributions of the network to mine the rules of core herbs. Experimental results show that CHDSC uncovers three major herb communities where herbs in each community can be used for treating multiple syndromes of CGN, and discovers the core herbs for curing different syndromes of CGN with high accuracy. Core herbs mainly exist in the herb communities with more than 25 herbs. The degree and closeness centrality of core herb nodes in the herb network concentrate on the range of [15, 40] and [0.25, 0.45], respectively.

2. Related Work

In general, there are three type ways to discover core herbs: manual analysis, data analysis, and clinical and pharmacology experiments.

In manual analysis, researchers searched Chinese books about the TCM treatment of a specified disease, extracted corresponding formulae, and found core herbs by hand. Wang [20] investigated some classical books such as Shen-Nong-Ben-Cao-Jing and Huang-Di-Nei-Jing to discuss the methods for exploring the sovereign, minister, assistant, and courier herbs. Wang and Wang [21] analysed the compatibility and function of Zhi-Gan-Cao-Tang and found that liquorice root (Gan Cao) is its core herb with the efficacy of making up qi, blood, yin, and yang. Song and Niu [22] drew the rules on the determination of the sovereign herbs of Xie-Xin-Tang and analysed its sovereign herbs.

In data analysis, researchers discovered core herbs based on the frequency of herbs and their cooccurrence relations in datasets. Meanwhile, most studies focused on medical records. Zhou et al. [19] proposed an Effect Degree- (ED-) based algorithm to discover core herbs and compatibility rules with three steps: core herb discovery based on ED, network construction based on pointwise mutual information, and herb compatibility rule detection. They found 42 core herbs for treating consumptive lung disease. Zhan et al. [23] collected CGN treatment data in a Chinese biomedical literature database and mined the relationship among symptoms, syndromes, herbs, and formulae by the stratification algorithm based on keyword frequency, then they discovered that milkvetch root (Huang Qi), danshen root (Dan Shen), and Indian bread (Fu Ling) are core herbs. Ma et al. [24] extracted herbs, therapies, syndromes, and diseases in TCM formulae from medicine records and built a relation graph by NetDraw. The degree and closeness centrality were calculated to discover core herbs, then they found nine core herbs for treating gastric abscess. You et al. [25] established a formula database of bone marrow suppression treatment with a TCM kidney-tonifying method after radiotherapy and chemotherapy and applied cluster techniques and association rules to analyse medication rules. They found that milkvetch root (Huang Qi), atractylodis macrocephalae rhizoma (Bai Zhu), and ligustri lucidi fructus (Nv Zhen Zi) are frequently used herbs. Most data analysts also discovered the compatibility rules and treatment patterns of TCM formulae where core herbs are contained. Chen et al. [26] mined symptom-herb patterns with the triangular relationship of symptoms, syndromes, and herbs from medical records. They found the main symptom-herb patterns on four real-world patient records (insomnia, diabetes, infertility, and Tourette syndrome). Chang et al. [27] investigated the treatment patterns among stroke patients by a nationwide population-based study using random samples of one million individuals from the national health insurance research database in Taiwan. They found that Bu-Yang-Huan-Wu-Tang and danshen root (Dan Shen) are commonly used.

In clinical and pharmacology experiments, researchers analysed effective herb combinations or ingredients of a given formula to explore core herbs for treating a certain disease. Yan et al. [28] proposed a study protocol to explore the core herbs for treating primary insomnia in TCM, in which they performed a triple-blind, randomized, and parallel-group clinical trial to analyse the formulae of prestigious TCM clinicians and used association rules to find effective core herbs. Wu et al. [16] identified the roles of “Sovereign-Minister-Assistant-Courier” of herbs in the Qi-Shen-Yi-Qi formula for treating myocardial ischemia by the network pharmacology approach. They integrated disease-associated genes and protein-protein interaction experiments to construct an organism disturbed network of myocardial ischemia and developed a network-based index, Network Recovery Index (NRI), to measure the therapeutic efficacy of the Qi-Shen-Yi-Qi formula. As a result, the whole formula gets the NRI score of 864.48 and outperforms a single herb. Additionally, danshen root (Dan Shen) and milkvetch root (Huang Qi) obtain the NRI scores of 734.31 and 680.27, respectively; thus, the two herbs are regarded as core herbs.

The above researches obtain good results for discovering core herbs; however, manual analysis and medical experiments need high cost for large-scale samples. Meanwhile, for data analysis, researchers need to process medical records manually to obtain structured data. Data analysis methods are based on cooccurrence relations and do not contain the inner meaning of herbs in medical records. On the other hand, there is large-scale literature containing the domain knowledge of formulae. In this paper, we focus on analysing literature and introduce semantic analysis and community detection to analyse the meanings of herbs in the literature to discover core herbs for treating a disease in TCM.

3. Artificial Intelligence Module

In this section, we introduce the semantic analysis and community detection modules used in CHDSC for core herb discovery. Firstly, we propose a Chinese word embedding algorithm ESSP2VEC to deal with large-scale literature and analyse the semantics of herbs based on the stroke, structure, and pinyin features of Chinese characters by predicting the contextual words of Chinese words. Secondly, we adopt a label importance-based label propagation algorithm LILPA to detect herb communities and core herbs, in which labels are propagated according to label importance based on node importance and node attraction. If the nodes own the same label when LILPA ends, they are allocated to the same community.

3.1. Word Embedding Algorithm

In order to analyse the semantics of herbs in large-scale literature, we propose the Chinese word embedding algorithm ESSP2VEC. We consider that it is a suitable model for learning the meanings of herbs from large-scale literature to handle problems (1) and (2). Word embedding is utilized to analyse word meanings based on the distributional hypothesis that similar words tend to appear in similar contexts; in other words, the semantics of words are included in their contextual words [38, 39]. Words are expressed as semantic word vectors, then we can consider that the meanings of words are contained in them [39]. In order to understand semantic word vectors intuitively, we take an example to visual some words in a two-dimensional surface by their semantic word vectors. As shown in Figure 2, semantic word vectors can contain some meanings of words and better distinguish different types of words, such as the animals (pig, sheep, and cow), the plants (tree and grass), and the actions (swim and dive). Thus, word embedding can capture the semantics of words to a certain degree. In collected large-scale literature, we can analyse the semantics of herbs and express them as semantic word vectors, which is a way to improve problem (3) to embody the semantics of herbs.

Figure 2: Example of semantic word vectors.

Further, herbs in the collected literature are recorded as Chinese words. Chinese words are made up of Chinese characters, which contain many semantically related internal features [40] [41]. Researchers proposed many Chinese word embedding algorithms for analysing the meanings of Chinese words by exploiting the character feature of Chinese words [42] and the internal features of Chinese characters, such as radical [43], component [44], stroke -grams [39], structure [40], and pinyin [40]. Here, we introduce these features briefly.

(i)Character (https://en.wikipedia.org/wiki/Chinese_characters): characters are logogram developed for the writing of Chinese, which makes up Chinese words [42].(ii)Radical (https://en.wikipedia.org/wiki/Radical_(Chinese_characters)): radical is the first stroke or morphological component of Chinese characters, which is the catalogue of symbols that are classified according to the structure and meaning of Chinese characters in a dictionary [43].(iii)Component: component is a character-forming unit and has the function of assembling Chinese characters [44].(iv)Stroke-gram (https://en.wikipedia.org/wiki/Stroke_(CJK_character)): stroke is the uninterrupted dots and lines of various shapes that compose Chinese characters, such as horizontal, vertical, left-falling, right-falling, and turning, which is the smallest constitutional unit of Chinese characters. Stroke -gram is the combination of strokes according to stroke order (https://en.wikipedia.org/wiki/Stroke_order) [39].(v)Structure: structure is the azimuth relationship (13 patterns) among strokes, such as left-right and left-middle-right [40].(vi)Pinyin (https://en.wikipedia.org/wiki/Pinyin): pinyin is the romanization of Chinese characters, which consists of initials, finals, and tones [40].

However, existing researches do not consider these features together. Stroke -grams include radical and component features and can capture partial semantics of the entire character [39] [40]. Meanwhile, the structure feature can capture the implication meanings of characters, and the pinyin feature can help us to understand the meanings of onomatopoeia and distinguish the characters which have the same stroke -gram and structure [40]. Then, we can catch relatively comprehensive semantics of Chinese characters from the stroke -gram, structure, and pinyin features. Thus, we propose ESSP2VEC to integrate the stroke -gram, structure, and pinyin features of Chinese characters for analysing the semantics of Chinese words.

The architecture of ESSP2VEC is shown in Figure 3 with an explanatory example. In this example, we have a sentence “carry forward the spirit of laborious struggle vigorously,” where the target word is “laborious (https://www.zdic.net/hans/%E8%89%B0%E8%8B%A6),” which is made up of two Chinese characters, and its contextual words are “vigorously,” “carry forward,” “struggle,” and “spirit.” ESSP2VEC consists of input, feature extraction, feature encoding, ensemble feature, and output layers.

(i)Input layer: input layer is used to receive the target word .(ii)Feature extraction layer: this layer is used to decompose word to independent characters and extract the stroke, structure, and pinyin of each character.(iii)Feature encoding layer: this layer is used to encode the stroke, structure, and pinyin features. We adopt the code defined in [40] to encode the stroke, structure, and pinyin features.(iv)Ensemble feature layer: this layer is designed to generate stroke -gram (all combinations of stroke) by moving a slide window with different lengths on the stroke sequence as shown in Figure 3 and integrate stroke -gram, structure, and pinyin features.(v)Output layer: output layer is designed as a softmax layer [45] to calculate the probability that the contextual words of word are predicted based on the ensemble features of word .

Figure 3: The architecture of ESSP2VEC. First, we decompose a Chinese word to characters and extract their stroke, structure, and pinyin features in the feature extraction layer. Second, the three features are encoded in the feature encoding layer. Third, we generate stroke -gram and integrate stroke -gram, structure, and pinyin features in the ensemble feature layer. Finally, the contextual words are predicted based on the ensemble features of the target word to learn the semantics of the target word.

Similar to [39–45], we predict the contextual words based on the target word in ESSP2VEC. In particular, the target word is expressed as its ensemble features. Given corpus represented as the sequence of words formally, where the word is the target word and is the number of words. The set of the contextual words of word is represented as

where is the size of the contextual words and word represented the element of , then the objective of ESSP2VEC is to maximize the log-likelihood in equation (2) where we hope to get the maximization of possibility , that is, word can be predicted correctly with maximum possibility based on the target word .

Then, the softmax function is used to model probability of predicting word given word , which is defined as

where is a scoring function to map the pairs of word and word to a real number.

Chinese characters with similar stroke -gram, structure, and pinyin may have similar semantics [40]. Thus, Chinese characters having similar ensemble features should have similar senses. Then, we define as equation (4) to calculate their similarity based on the ensemble features of word and its contextual word , where denotes the collection of the stroke -grams of word ; , , and are the embeddings of stroke -gram, structure, and pinyin features, respectively; and is the initial semantic word vector of word . By replacing as , we also can compute.

We optimize the objective function of equation (2) based on standard gradient methods [39]. After the training process, the semantic word vectors of contextual words are the output. Thus, we can obtain semantic word vectors of all words in the corpus, where denotes the semantic word vector of word and is the number of nonrepetitive words in the corpus. By training ESSP2VEC in the collected large-scale literature corpus, we can analyse the semantics of herbs and express them as semantic word vectors.

There also are word embedding algorithms designed for other languages. For example, Park et al. [46] proposed a Korean word embedding algorithm, which uses jamo feature of Korean characters to construct the jamo-gram of Korean words and predict the contextual words of the target word based on its -gram. Korean characters can be decomposed into jamos in turn, which are the smallest lexicographic units representing the consonants and vowels [46]. The jamo feature is extracted to construct the jamo-gram of Korean words, which is similar to the stroke -gram of Chinese words. Then, the model predicts the contextual words of the target word based on its jamo-gram to obtain final word embeddings. For English, Bojanowski et al. [47] proposed the FastText algorithm to capture the subword feature of English words to construct character -gram and predict the contextual words of the target word based on its character -gram. English words can be divided into 26 alphabets, which are the smallest component units of English words. Different character combinations can form different features, such as etyma, prefixes, and suffixes, which contain part semantics of words [47]. The subword feature is extracted to construct the character -gram of English words, which is similar to the stroke -gram of Chinese words. For example, the 3-grams of the word where are <wh, whe, her, ere, re> [47]. Then, FastText predicts the contextual words of the target word based on its -gram to obtain final word embeddings.

The above three methods both generate the -gram of one feature of the target word (i.e., the stroke -gram of Chinese, the jamo-gram of Korean, and the character -gram of English) and predict the contexts of the target word based on its -grams. For the proposed algorithm, ESSP2VEC not only constructs the stroke -gram of Chinese words but also integrates the other two features (structure and pinyin) to analyse relatively comprehensive semantics of Chinese words. That is, ESSP2VEC considers both the morphological and phonetic features of Chinese words. Meanwhile, ESSP2VEC considers the similarity between the contextual words and the internal features of the target word to conduct prediction.

3.2. Label Propagation-Based Algorithm

According to the theory of ESSP2VEC, we can analyse the semantics of herbs and obtain their semantic word vectors. However, how to use the semantic word vectors to find core herbs is a challenge. In order to discover core herbs for treating a certain disease by the semantic word vectors, we first compute the semantic similarity among herbs and construct a herbal semantic network, where herbs are considered as nodes and if the semantic similarity between two herbs is larger than the average value of all similarity among herbs (threshold value), edges are formed between the two herbs. Then, we adopt a label importance-based label propagation algorithm LILPA [48] to detect communities in the herbal semantic network, which can further improve problem (3). Herbs in a community may have the same or similar efficacy and can treat multiple syndromes of a certain disease. Finally, we identify important nodes in each community as core herbs for treating the syndromes of the disease. Here, we introduce LILPA briefly.

There are many real-world networks, such as social networks, collaboration networks, and herb networks, in which nodes represent objects and edges represent their relations [18]. Real-world networks often consist of subnetworks or communities with nodes more tightly linked with respect to the rest of the networks [3]. Community detection can be informally considered as a problem of finding such communities in networks, which aims at assigning community labels to nodes such that the nodes in the same community share higher similarity than the nodes in different communities [49] [50]. Communities in networks are the division of networks into the groups of nodes having dense intraconnections and sparse interconnections [51]. In other words, the connections among nodes in communities are dense, while the connections between communities are sparse. Thus, community detection focuses on discovering communities with dense connection nodes in networks. If the nodes own the same label when the algorithm ends, these nodes are allocated to the same community. Table 1 shows the corresponding concepts between core herb discovery and LILPA.

Table 1: Corresponding concepts.

Core herb discovery
LILPA

Herb
Node

The relations among herbs
Edge

Efficacy
Label

Herb group for treating multiple syndromes
Community

Core herbs for treating multiple syndromes
Nodes with a top- degree in each community

An example is given in Figure 4 to explain the process of community detection based on label propagation. Node is chosen to update its labels firstly. Its neighbour nodes launch their own label with belonging coefficient to node (we assume that the belonging coefficient equals to 1). Then, node receives labels (purple, 1), (purple, 1), (purple, 1), (green, 1), and (orange, 1). By normalizing their belonging coefficients, we obtain node with labels (purple, 0.6), (green, 0.2), and (orange, 0.2). If the belonging coefficient is smaller than (we assume the filtering threshold ), then the green and orange labels are filtered. Finally, the label of node is updated to the purple label, so node is assigned to purple community. Then, other nodes are chosen to update their labels. The above process is conducted continuously until the labels of nodes are kept unchanged. Finally, community detection is finished, and we can discover three communities in the example network. That is, nodes are assigned to a community; nodes are assigned to a community; and nodes are assigned to another community. We can find that intercommunal relations among communities are sparser than the connections within the communities. In each community, the nodes with a large degree (the number of neighbours) are considered as important nodes, such as , , and In addition, nodes are drawn in a layout area.

Figure 4: Example of label propagation for community detection.

Given an undirected and unweighted network , where represents the set of nodes and represents the set of edges. and are the number of nodes and edges, respectively. The neighbour nodes of node are expressed as , and its degree is expressed as . The labels of node are stored in , where label is the th label with a belonging coefficient of node , , and is the number of labels in . The community characterized by label is expressed as . Nodes are drawn in a rectangle layout area with length and width . The position and displacement of node in the layout are denoted as and , respectively.

In the above example, node is randomly chosen to update its labels. In order to fix the updating order of nodes to improve stability, node importance is defined to reflect the weight of nodes in networks as

where is the closeness centrality of node to measure its centrality in networks and is the shortest distance between nodes and

Communities are the clusters of nodes owning dense intraconnections and sparse external connections [49]. In order to increase the attraction among nodes to obtain dense internal connection, the node attraction between nodes and is defined as

where is the straight-line distance between nodes and in the layout area calculated by the positions of nodes in the layout area, which is different with which is the shortest distance between nodes and calculated by the edge weight of networks.

When label l with a belonging coefficient is sent from node to node , the weight of this label is influenced by the node importance of sender, propagation distance (related to the node attraction among nodes), and its belonging coefficient [18]. Then, label importance is defined to measure the weight of labels of a node when they reach other nodes as

The processes of LILPA consist of initialization, node choice, node movement, label launch, label acceptation, termination judgement, and postprocess, as shown in Figure 5.

Step 1. Initialization. Nodes are allotted with labels (e.g., node’s id) and random positions, then the node importance of all nodes is computed.

(1)Set , and for , , and . Here, represents the node set where nodes have not been updated(2)Node importance is calculated, then the nodes in are ordered in ascending order of node importance.

Step 2. Node choice. Node is chosen to update its labels, which satisfies , then set . Nodes with small importance can be influenced by nodes with large importance easily [18], then the labels of nodes with small importance are preferentially updated.

Step 3. Node movement. Node moves to a new position according to its displacement.

(1)The displacement of node is calculated by

(2)The position of the node is updated by

(3)If node is out of the layout area, then its position is restricted in the layout area by equations (10) and (11)

Step 4. Label launch. In this step, every node in the neighbouring nodes of node sends its label with the maximal belonging coefficient to node .

(1)For node in , label is chosen, which satisfies , then node sends label to node (2)When label reach node , it is assigned with label importance calculated by equation (7), then (3)The label importance is added when the labels with the same id reach node

Step 5. Label acceptation. This step is used to accept useful labels and filter the labels with small belonging coefficients.

(1)By normalizing the label importance of labels in , , (2)For label in , if , then . The updated of node is gained by normalizing again, then the updating of labels of node is finished. Here, is the filtering threshold(3)If , then step 6 is executed, else the method sets , and returns to Step 2 to update other nodes.

Step 6. Termination judgement. The minimal number set of nodes signed by each community identifier is computed. If or LILPA reaches the maximum number of iterations, LILPA goes to Step 7 for postprocessing, else sets and returns to Step 2 for the next iteration.

Step 7. Postprocessing. Nodes with label are allocated to community . If nodes have multiple labels, then they are assigned to multiple communities.

Figure 5: The process of LILPA. LILPA first initializes each node with a unique label, chooses nodes to update according to node importance, and moves nodes in the layout area according to node attraction. Then, the neighbour nodes of the updating node launch labels, and the updating node accepts labels according to label importance. The above steps except initialization are iteratively executed until all nodes are updated once. If LILPA reaches termination condition, then it goes to postprocessing, else, it returns to the step of node choice for the next iteration.

We apply LILPA to herbal semantic network and discover herb community set , where is the number of herb communities. In each community , herbs have the same or similar efficacy for treating multiple syndromes of a certain disease. Then, we can discover core herbs for treating the syndromes by choosing nodes with large degree in community .

4. The Proposed Model

In this paper, we aim to import herb knowledge implied in large-scale literature into core herb discovery. Thus, we propose CHDSC to analyse the semantics of herbs in literature based on semantic analysis module ESSP2VEC, calculate the semantic similarity among herbs to build herbal semantic network, and discover herb communities and core herbs in the network based on community detection module LILPA. CHDSC includes three stages: corpus construction, herb network establishment, and core herb discovery, whose process is shown in Figure 6.

Figure 6: The process of CHDSC.

Before applying CHDSC to discover core herbs for treating a certain disease, we should choose a target disease; here, we denote the target disease as . After discussing with TCM experts, we select keywords in Chinese about the TCM treatment of disease to search scientific literature in CNKI.

Input: the collected literature, standard herb name dictionary D, the size of context windows , filtering threshold R;

Output: core herb set ;

Stage 1 Corpus construction

C₁ = Word-segmentation ();

C₂ = Font-conversion (C₁);

C = Redundant-information-removal (C₂);

Stage 2 Herb network establishment

Step 1 Semantic analysis

;

Step 2 Name entity recognition

;

For each word in C

    If

         and ;

End For

Step 3 Semantic similarity calculation

    Calculate by equation (12);

Step 4 Herb network establishment

;

For each herb in

    If

        ;

End For

Stage 3 Core herb discovery

Step1 Herb community discovery

;

Step 2 Core herb discovery

For each community in

     herbs represented by the nodes having top-8 degree in ;

    ;

End For

Return

Algorithm 1: CHDSC.

4.1. Corpus Construction

In this stage, corpus about the TCM treatment of disease is built by preprocessing the collected literature, which is used to train ESSP2VEC for analysing the semantics of herbs in literature.

Step 1. Word segmentation. Different from English sentences that use space as the natural interval among words, Chinese sentences are made up of continuous words. In order to analyse the semantics of Chinese words in literature, in this paper, Chinese sentences of the full text of literature are divided into Chinese words.

Step 2. Font conversion. Since traditional Chinese characters may exist in the literature, we convert them into simplified Chinese characters to make uniform the process.

Step 3. Redundant information removal. This step is to remove messy code, punctuations, and English abstract to obtain the pure corpus , whose number of words is .

4.2. Herb Network Establishment

In this stage, herbal semantic network is constructed by extracting the semantic word vectors of herbs and calculating their semantic similarity to reflect the relations between herbs and the target disease.

Step 1. Semantic analysis. Corpus is input into ESSP2VEC to analyse the semantics of words in literature. Then, we obtain the semantic word vectors .

Step 2. Name entity recognition. All Chinese words in the corpus including symptoms, syndromes, diseases, herbs, and other words are used to train word embedding because the semantics of herbs are contained in the contexts of words [38]. Then, the results contain the semantic word vectors of symptoms, syndromes, diseases, herbs, and other words. In this step, the semantic word vectors of herbs is extracted from by name entity recognition, where represents the herbs existing in the collected literature. We construct a standard herbal name dictionary according to the regulated herb name in The Pharmacopoeia of the People’s Republic of China [52]. If herbs exist in the corpus and the standard herb thesaurus simultaneously, then we extract the herbs and their semantic word vectors.

Step 3. Semantic similarity calculation. Here, we adopt cosine similarity [53] to measure the semantic similarity among herbs, which is defined as

If the semantic similarity among herbs is greater than the average value of all similarities among herbs, we consider that they own similar efficacy and can treat some syndromes of a disease.

Step 4. Herb network establishment. Herb semantic network is constructed by herbs and their semantic similarity. The herbs form nodes in the network, and if the similarity of two herbs is greater than the average value of all similarities among herbs, then an edge is formed between the two herbal nodes.

4.3. Core Herb Discovery

In this stage, core herb set is discovered in herb community .

Step 1. Herb community discovery. Herbs in herb communities own the same or similar efficacy to treat multiple syndromes of a disease. Herb communities are revealed by LILPA.

Step 2. Core herb discovery. In each community, nodes are important if they have a large degree. We choose eight herbs with top-8 degree in each community as core herbs.

4.4. Complexity Analysis

The complexity of CHDSC is mainly in the two artificial intelligence modules. Here, we briefly analyse the time complexity of ESSP2VEC and LILPA.

4.4.1. The Time Complexity of ESSP2VEC

The contextual words are predicted based on each word taking time . We adopt an optimal strategy, negative sampling [45], which considers the target word and its contextual words as positive sample pairs and takes the target word and random words as negative sample pairs, whose number is . Then, the problem of predicting contextual words can be replaced as a set of independent binary classification tasks so as to independently predict the presence (or absence) of contextual words [39] [40]. Then, equation (3) can be rewritten as

Thus, the complexity of predicting the contextual words of a word can be reduced to . Then, predicting the contextual words of all words costs time . For ESSP2VEC, we represent each word as its stroke -gram with structure and pinyin features and predict the contextual words based on the ensemble features of the target word, then the total complexity is , where is the maximum length of stroke -gram. In general, , , , then the total complexity is near , where is a constant.

4.4.2. The Time Complexity of LILPA

The time complexity of LILPA is estimated as follows.

(1)Initialization: the shortest distances among nodes are calculated with time . The Quicksort algorithm is adopted for sorting nodes by node importance with time . Thus, initialization costs time (2)Node choice: choosing a node to update its label costs constant time(3)Node movement: calculating the attractive and repulsive forces between node and its neighbours and the displacement of node takes time (4)Label launch: the neighbours of node cost the worst time to send their labels, where is the maximum number of labels of the neighbours of node . In general, , then label launch needs constant time(5)Label acceptation: accepting the labels of node takes , where is the number of labels reaching node . In general, , then label acceptation takes constant time(6)Termination judgement and postprocessing: the same as COPRA [54], the former costs time and the latter needs time

For the label update process of node , Steps 2–5 need constant time. Thus, updating the labels of nodes in one iteration needs time . Thus, the time complexity of LILPA is . In general, , then the total complexity is near , where and are constants.

5. Experiment Setup

In this section, we first introduce datasets, evaluation criteria, and comparison algorithms, which are used to evaluate the performance of artificial intelligence modules. Then, we take a case study by choosing CGN as the target disease and apply CHDSC to discover the core herbs for treating multiple syndromes of CGN in TCM.

5.1. Data Description

For evaluating the effectiveness of the semantic analysis module (i.e., word embedding algorithm ESSP2VEC), we employ a universal data SogouCA shown in Table 2, which contains 300 million words after preprocessing by the same operation of corpus construction to train ESSP2VEC to obtain word semantic vectors. Then, we use datasets (1) WA-1124, (2) WS-240, and (3) WS-296 to evaluate the proposed module on word analogy and word similarity tasks, respectively, as described in Section 5.2. For estimating the performance of community detection module (i.e., label propagation algorithm LILPA), we use eight real-world networks shown in Table 3. Each algorithm independently runs 50 times.

Table 2: Description of training and evaluation dataset.

Function
Dataset
Reference
Task
Scale

Training
SogouCA
[40]
—
300 million words

Evaluation
WA-1124
[42]
Word analogy
1124 instances

WS-240
[39]
Word similarity
240 instances

WS-296
[39]
Word similarity
296 instances

Table 3: Description of real-world networks.

Network

Dia
Reference

Karate
34
78
2
4.588
5
[55]

Dolphins
62
159
2
5.129
8
[56]

Football
115
615
12
10.661
4
[57]

Netscience
1589
2742
16
3.451
17
[58]

Power
4941
6594
–
2.669
46
[59]

PGP
10680
24316
–
4.554
24
[60]

Cond2003
31163
120029
–
7.703
16
[61]

Cond2005
40421
175693
–
8.693
18
[61]

: the number of communities; : the average degree of networks; dia: the diameter of networks.

5.2. Evaluation Criteria

In order to evaluate the quality of semantic word vectors obtained by word embedding algorithms, we test them on word analogy and word similarity tasks.

(i)Word analogy task is used to measure the model ability of exploring the semantic relations among words [42] [45]. Given three words , , and , the word embedding models judge word that correctly answers the question “ to is to what?” For example, there is a question “Beijing is to China as Berlin is to what?” such that the cosine similarity between vectors () and is maximized. By correctly answering this question, such as Germany, the models are considered that they can capture semantic relationships among words. We adopt the test data WA-1124 with 1124 instances for evaluating Chinese word semantic vectors [42](ii)Word similarity task is designed to evaluate the model ability of capturing semantic relatedness and closeness among words [39] [40]. Word similarity is measured by the cosine similarity between the corresponding word vectors, then we calculate the Spearman correlation coefficient between the word similarity and the human similarity scores to estimate the quality of word vectors. We adopt two datasets WS-240 and WS-296 for evaluation [39]

In order to measure the quality of detected communities in networks, we use two criteria Normalized Mutual Information (NMI) and Overlap Modularity (OM). If the true communities of real-world networks are known, the two criteria are both adopted; otherwise, only OM is adopted.

(i)NMI is used to compute the difference between the communities detected by algorithms and true community structures and varies between 0 and 1 [62]. The larger the value, the smaller the difference(ii)OM reflects the quality of divisions assessed by the relative density of edges within communities and between communities [63], which varies between 0 and 1. The larger the value, the better the quality

5.3. Comparison Algorithms

To evaluate the effectiveness of ESSP2VEC, we compare it with seven word embedding algorithms, including (1) three general word embedding algorithms CBOW [45], Skip-Gram [45], and GloVe [64], which can be used for any languages, and (2) four Chinese word embedding algorithms CWE [42], JWE [44], GWE [65], and CW2VEC [39], which are designed for the Chinese language and consider the radical, component, character, and stroke -gram features, respectively. For baselines, we set the size of the contextual window equalling to ESSP2VEC.

To show that LILPA can find better communities, we compare it with seven label propagation-based community detection algorithms COPRA [54], SLPA [66], DLPA⁺ [67], WLPA [68], LPA_NI [69], NGLPA [70], and LPANNI [49]. In this paper, we use the given parameters for baselines if real-world networks are used in the original articles. Otherwise, we utilize the ways proposed in the original articles to gain the best solution.

5.4. Case Study

In order to further validate the effectiveness of core herb discovery model CHDSC, we choose CGN as the target disease to conduct a case study. After discussing with TCM experts, we select keyword pairs in Chinese (1) “chronic glomerulonephritis” and “Chinese medicine” and (2) “chronic glomerulonephritis” and “Chinese native medicine,” to search the scientific literature in CNKI. Then, we apply CHDSC to analyse the collected literature to discover the core herbs for treating different syndromes of CGN.

6. Results and Discussion

The results for word analogy and word similarity tasks are shown in Table 4. The average values of NMI and OM for real-world networks are shown in Tables 5 and 6, respectively. We mark the optimal values in italics. The number in brackets is the rank of methods for each task or network, and the average rank of each algorithm is shown in the last column. Finally, we choose CGN as the target disease to conduct a case study.

Table 4: Results of word analogy and word similarity tasks.

Algorithm
Word analogy (%)
Word similarity (%)
Average rank

WA-1124
WS-240
WS-296

CBOW
22.77 (7)
46.40 (8)
56.26 (7)
7.33

Skip-Gram
58.45 (3)
55.36 (2)
60.76 (4)
3.00

Glove
19.39 (8)
48.36 (7)
47.02 (8)
7.67

CWE
47.69 (6)
51.67 (5)
61.17 (3)
4.67

JWE
57.65 (4)
51.00 (6)
60.22 (6)
5.33

GWE
48.84 (5)
53.45 (4)
60.63 (5)
4.67

CW2VEC
63.17 (2)
54.85 (3)
61.41 (2)
2.33

ESSP2VEC
64.85 (1)
55.38 (1)
61.71 (1)
1.00

Table 5: Average value of NMI.

Algorithm
Karate
Dolphins
Football
Netscience
Average rank

COPRA
0.3596 (8)
0.5976 (6)
0.8836 (7)
0.3566 (5)
6.5000

SLPA
0.6915 (3)
0.6678 (3)
0.8862 (6)
0.3651 (2)
3.5000

DLPA⁺
0.5489 (5)
0.4753 (8)
0.9044 (2)
0.3858 (1)
4.0000

WLPA
0.5016 (6)
0.6599 (4)
0.9013 (3)
0.3350 (8)
5.2500

LPA_NI
0.6598 (4)
0.6436 (5)
0.8823 (8)
0.3636 (3)
5.0000

NGLPA
0.4408 (7)
0.7108 (2)
0.8887 (5)
0.3471 (7)
5.2500

LPANNI
0.7782 (2)
0.5809 (7)
0.8997 (4)
0.3627 (4)
4.2500

LILPA
0.9855 (1)
0.8125 (1)
0.9079 (1)
0.3526 (6)
2.2500

Table 6: Average value of OM.

Algorithm
Karate
Dolphins
Football
Netscience
Power
PGP
Cond2003
Cond2005
Average rank

COPRA
0.2348 (8)
0.3741 (7)
0.5972 (6)
0.8784 (7)
0.1696 (8)
0.5117 (8)
0.6306 (5)
0.4256 (8)
7.1250

SLPA
0.3742 (5)
0.4757 (5)
0.6016 (3)
0.9043 (6)
0.6225 (6)
0.7641 (4)
0.6341 (2)
0.6019 (5)
4.5000

DLPA⁺
0.4210 (2)
0.5166 (3)
0.5960 (7)
0.8456 (8)
0.5993 (7)
0.6761 (6)
0.4764 (8)
0.4371 (7)
6.0000

WLPA
0.3682 (6)
0.3695 (8)
0.5981 (5)
0.9279 (2)
0.7731 (2)
0.6231 (7)
0.5959 (6)
0.6117 (3)
4.8750

LPA_NI
0.4136 (4)
0.5055 (4)
0.5985 (4)
0.9140 (4)
0.7473 (4)
0.7861 (3)
0.6313 (3)
0.6111 (4)
3.7500

NGLPA
0.3314 (7)
0.5189 (2)
0.5848 (8)
0.9209 (3)
0.7631 (3)
0.8092 (1)
0.5907 (7)
0.4431 (6)
4.6250

LPANNI
0.4147 (3)
0.5423 (1)
0.6090 (1)
0.9070 (5)
0.6608 (5)
0.7575 (5)
0.6312 (4)
0.6175 (2)
3.6250

LILPA
0.4213 (1)
0.4003 (6)
0.6061 (2)
0.9319 (1)
0.7817 (1)
0.8001 (2)
0.6852 (1)
0.6223 (1)
1.8750

6.1. Results of Word Embedding Algorithm

As shown in Table 4, we can find that ESSP2VEC obtains the best result in all tasks. For word analogy task, CBOW and Glove achieve about 20% accuracy, CWE and GWE obtain over 40% accuracy, Skip-Gram and JWE gain over 50% accuracy, and the accuracy of CW2VEC and ESSP2VEC is over 60%. In general, the proposed algorithm ESSP2VEC outperforms the best baseline CW2VEC. For word similarity task in terms of WS-240, CBOW and Glove gain over 40% accuracy and other algorithms achieve over 50% accuracy. ESSP2VEC outstrips the best baseline Skip-Gram. For word similarity in terms of WS-296, the accuracy of CBOW and Glove is under 60%; on the contrary, other algorithms obtain over 60% accuracy. ESSP2VEC outperforms the best baseline CW2VEC. Thanks to the ideas of using the target word to predict its contexts and the effectiveness of integrating the stroke, structure, and pinyin features of Chinese characters, ESSP2VEC obtains the best average rank on word analogy and word similarity tasks. Comparing with state-of-the-art word embedding algorithms, we can consider that the proposed algorithm ESSP2VEC can obtain good accuracy and analyse the semantics of herbs in the literature.

6.2. Results of Label Propagation-Based Algorithm

As shown in Table 5, we can find that LILPA obtains the best NMI for the Karate, Dolphins, and Football networks and achieves the best average rank, which illustrates that LILPA can discover communities close to the true ones. In particular, LILPA outperforms the best baseline LPANNI over 20.73% for the Karate network and outstrips the best baseline NGLPA over 10.17% for the Dolphins network. Although LILPA obtains poor NMI than some algorithms for the Netscience network, the difference with the optimal value is small. As shown in Table 6, LILPA gains the first rank in five networks and the second rank in two networks, then it achieves the best average rank. LILPA gets poor OM in the Dolphins network, while it obtains the best NMI in this network. With the increase of network scale, LILPA keeps good performance. LILPA can find better communities in different scale networks than other baselines. In general, according to the average rank, LILPA outperforms baselines in terms of NMI and OM, which is profited by node importance, node attraction, and label importance. Compared with state-of-the-art label propagation-based algorithms, we can infer that LILPA can discover good communities and can detect high-quality herb communities in the herbal semantic network.

6.3. Results of the Application of CHDSC on CGN

In this section, we choose CGN as the target disease for the reason mentioned in Section 1. According to the above experiments, we can consider that CHDSC with ESSP2VEC and LILPA can discover core herbs accurately. Then, we apply CHDSC to discover core herbs for CGN treatment in TCM. After searching the literature in CNKI, we collect 449 samples of literature by keywords “chronic glomerulonephritis” and “Chinese medicine” and 677 samples of literature by keywords “chronic glomerulonephritis” and “Chinese native medicine.”

After corpus construction, we obtain CGN corpus containing 1126 samples of literature with 0.8 million words. All articles are related to the TCM treatment of CGN, so we expect semantic analysis can obtain high-quality semantic word vectors of herbs, since a pure in-domain corpus yields better performance than a mixed-domain corpus [71].

After herb network establishment, we obtain the semantic word vectors of 274 herbs and build a herbal semantic network with 274 nodes and 1293 edges. Some nodes have no edges with others because these herbs may have small similarity with other herbs. In order to understand the semantic word vectors intuitively, we choose two herbs dwarf lilyturf tuber (Mai Dong) and combined spicebush root (Wu Yao), discover the herbs owing large semantic similarity with one of them, and visualize these herbs in a two-dimensional surface. As shown in Figure 7, dwarf lilyturf tuber (Mai Dong) and some herbs are clustered together (denoted as with red color), and combined spicebush root (Wu Yao) and some herbs are also gathered together (denoted as with green color). Meanwhile, we can observe that groups and have obvious interval, then we can infer that the semantic word vectors of dwarf lilyturf tuber and combined spicebush root can reflect their characteristics to find similar herbs. CHDSC can capture the semantics of herbs in the literature to a certain extent and generate effective semantic word vectors.

Figure 7: Example of semantic word vectors of herbs.

After core herb discovery, CHDSC discovers three large herb communities in herbal semantic network as shown in Figure 8. The herbs in the same community own similar efficacy and can treat multiple syndromes of CGN. According to the analysis of TCM experts, the herbs in the blue community have the efficacies of nourishing the liver and kidney and nourishing yin and blood, which can be mainly used for treating the syndrome of deficiency of both qi and yin and the syndrome of yin deficiency of the liver and kidney. The herbs in the purple community have the efficacies of removing dampness and diuresis, clearing heat and removing toxicity and dispelling wind evil and are often used for treating the syndrome of yang deficiency of the spleen and kidney. Meanwhile, they can be used to treat the syndromes of dampness-heat and fluid-dampness. The herbs in the green community have the efficacies of activating qi and eliminating dampness, clearing heat and removing toxicity, and resolving masses, which are used to treat the syndrome of liver depression and qi stagnation. According to the pathogenesis of CGN in TCM (intermingled deficiency and excess) and the TCM treatment points for CGN (supple deficiency and expel excess and strengthening vital qi to eliminate pathogenic factor) [36, 37], we find that the herbs in the blue community are mainly used for supplying deficiency and the herbs in the purple and green communities are mainly used for expelling excess. Thus, the herbs in the blue community are necessary for treating CGN in TCM, and the ones in the purple and green communities are used to treat the secondary symptoms. CHDSC discovers herb communities where herbs can treat most primary syndromes of CGN; however, herbs in herb communities do not cover all syndromes of CGN, which may be because some syndromes are less recorded in the literature and the scale of the literature is limited.

Figure 8: Results of herb communities.

The herbs represented by the nodes with the top-8 degree in each community are regarded as core herbs for treating multiple syndromes of CGN as shown in Figure 9 (their Chinese pinyin and English name are shown in Tables 7–9). According to the analysis of TCM experts, for the herbs with the top-8 degree, the herbs in red circles are the core herbs identified correctly for treating the CGN syndromes represented by corresponding herb communities and the herbs in yellow circles are complementary herbs (the core herbs identified correctly are indicated in italics in Tables 7–9). It is seen that CHDSC can discover core herbs for treating most syndromes of CGN with high accuracy from large-scale literature, which can give references for the clinical application of herbs. Thus, we can consider that CHDSC can automatically discover core herbs for treating a disease from large-scale literature. The herbs in red circles are core herbs and can be used to treat main symptoms of CGN; the herbs in yellow circles are used to play support efficacy according to the symptoms of patients because patients may suffer from other diseases and need to be treated at the same time.

(a) Blue community

(b) Purple community

(c) Green community

Figure 9: Results of core herbs in each community. Herbs in red circles are the core herbs identified correctly for treating multiple syndromes of CGN. Herbs in yellow circles are complementary herbs.

Table 7: Top-8 herbs in blue community.

Herb (Chinese pinyin)
Herb (English name)
Degree
Closeness centrality

Sha Shen
Coastal glehnia root
26
0.35

Bu Gu Zhi
Malaytea scurfpea fruit
25
0.33

Sang Ji Sheng
Chinese taxillus herb
23
0.35

Mai Dong
Dwarf lilyturf tuber
22
0.34

Nv Zhen Zi
Glossy privet fruit
20
0.30

Lu Jiao Jiao
Deerhorn glue
17
0.31

Shu Di Huang
Prepared rehmannia root
15
0.28

Bai Shao
Debark peony root
15
0.34

Table 8: Top-8 herbs in purple community.

Herb (Chinese pinyin)
Herb (English name)
Degree
Closeness centrality

Tong Cao
Ricepaperplant pith
39
0.40

Xuan Shen
Figwort root
35
0.39

Sheng Jiang
Fresh ginger
34
0.38

Ren Dong Teng
Honeysuckle stem
33
0.41

Chen Pi
Dried tangerine peel
32
0.39

Yu Jin
Turmeric root tuber
32
0.40

Mu Dan Pi
Tree peony root bark
29
0.41

Jie Geng
Platycodon root
28
0.37

Table 9: Top-8 herbs in green community.

Herb (Chinese pinyin)
Herb (English name)
Degree
Closeness centrality

Wu Yao
Combined spicebush root
48
0.42

Sheng Ma
Largetrifoliolious bugbane rhizome
36
0.38

Bian Xu
Common knotgrass herb
35
0.32

Mo Yao
Myrrh
35
0.34

Zhen Zhu Mu
Nacre
34
0.34

Lu Gen
Reed rhizome
33
0.38

Lu Xian Cao
Pyrola herb
23
0.31

Qing Pi
Immature tangerine peel
23
0.38

In order to further explore the herbal semantic network, we analyse its community size, degree, and closeness centrality distributions to mine the rules of CGN core herbs.

(i)Community size distribution can reflect the community number of networks and the number of nodes in each community(ii)Degree distribution can measure the number of nodes with different degrees(iii)Closeness centrality distribution can reflect the number of nodes with different closeness. The closeness centrality of a node is a measure of centrality in a network. The more central a node is, the closer it is to other nodes

The results are shown in Figure 10, and the degree and closeness centrality values of core herb nodes are shown in Tables 7–9. As shown in Figure 10(a), there are three large communities, in which each community owns more than 25 nodes. Other communities are small and only have few nodes because the literature records complex symptoms and syndromes, and these herbs in small communities are used to treat other symptoms of patients. Thus, core herbs are discovered from the three communities for treating the main symptoms and syndromes of CGN in TCM. As shown in Figures 10(b) and 10(c) and Tables 7–9, the degree and closeness centrality of core herb nodes concentrate on the range of [15, 40] and [0.25, 0.45], respectively. It suggests that core herbs are represented by the important and central nodes in the herb network. Thus, if we construct a new herb network from new literature, then we can prejudge the core herbs for treating CGN according to their degree and closeness centrality, which can reduce cost and increase accuracy. For other diseases, we also can utilize the above rules to prejudge core herbs according to their degree and closeness centrality. So, these circled states can reflect the distribution rules of core herbs and are important for doctors and researchers to explore core herbs for CGN and other diseases.

(a) Community size distribution

(b) Degree distribution

(c) Closeness centrality distribution

Figure 10: Results of network distributions.

7. Conclusions

In this paper, we study the problem of core herb discovery in TCM and propose an artificial intelligence model CHDSC to discover core herbs for treating a certain disease from large-scale literature based on semantic analysis and community detection, in which word embedding algorithm ESSP2VEC is designed to analyse the semantics of herbs in the literature, and label propagation-based algorithm LILPA is used to discover herb communities and core herbs. In the case study, CHDSC discovers three large herb communities where herbs can treat most syndromes of CGN and identifies core herbs for treating these syndromes with high accuracy. CHDSC can discover effective core herbs, which is helpful for the clinical application of herbs and formulae. In addition, the proposed model is introduced to discover core herbs for treating CGN as an example; it also can be applied to other diseases.

We also find that some syndromes cannot be covered by discovered core herbs and some core herbs with low degree (e.g., asiatic cornelian cherry fruit (Shan Zhu Yu) in blue community) are not discovered. These syndromes may be less recorded in the literature, and the collected literature may not contain the usage of these core herbs in most cases. Improving the semantic analysis and community detection modules is an important area of future research. For example, importing the “Sovereign-Minister-Assistant-Courier” combination rule in LILPA can combine TCM domain knowledge with community detection to guide label propagation and form a supervised way. The source and scale of literature have the influence on results, so enlarging the scale of the corpus and selecting authoritative literature can enhance the accuracy. In addition, for the Chinese word embedding algorithm ESSP2VEC, we can consider the syntax and Part of Speech (POS) [72] as features and predict the contextual words based on soft tree [73] to learn the semantics of Chinese words, which will also be the subject of future research.

Data Availability

The text data used to support the findings of this study have been deposited in https://github.com/yunzhangwww/TCM-literature-corpus

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this article.

Acknowledgments

This work was supported by the National Key R&D Program of China (Nos. 2017YFC1703905 and 2018YFC1704105) and Sichuan Province Science and Technology Department (Nos. 2020YFS0372 and 2020YFS0302).

References

C. Wallis, “How artificial intelligence will change medicine,” Nature, vol. 576, no. 7787, article S48, 2019.

W. Zhang, X. He, and W. Lu, “Exploring discriminative representations for image emotion recognition with CNNs,” IEEE Transactions on Multimedia, vol. 22, no. 2, pp. 515–523, 2020.

L. Yang, X. C. Cao, D. X. He, C. Wang, X. Wang, and W. X. Zhang, “Modularity based community detection with deep learning,” in Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI), pp. 2252–2258, New York, NY, USA, July 2016.

M. Gimenez, J. Palanca, and V. Botti, “Semantic-based padding in convolutional neural networks for improving the performance in natural language processing. A case of study in sentiment analysis,” Neurocomputing, vol. 378, pp. 315–323, 2020.

T. Paulraj, K. S. V. Chelliah, and S. Chinnasamy, “Lung computed axial tomography image segmentation using possibilistic fuzzy C-means approach for computer aided diagnosis system,” International Journal of Imaging Systems and Technology, vol. 29, no. 3, pp. 374–381, 2019.

Y. Zhang and Y. Zhao, “Pathogenic network analysis predicts candidate genes for cervical cancer,” Computational and Mathematical Methods in Medicine, vol. 2016, Article ID 3186051, 8 pages, 2016.

A. Onan, “Biomedical text categorization based on ensemble pruning and optimized topic modelling,” Computational and Mathematical Methods in Medicine, vol. 2018, Article ID 2497471, 22 pages, 2018.

D. Kerstin and V. H. Frank, “Recent advances in extracting and processing rich semantics from medical texts,” Artificial Intelligence in Medicine, vol. 93, pp. 11-12, 2018.

J. Li, J. W. Lian, Y. X. Zhou et al., Formula of Traditional Chinese Medicine, China Press of Traditional Chinese Medicine, China, 9th edition, 2016.

M. Jiang, C. Lu, C. Zhang et al., “Syndrome differentiation in modern research of traditional Chinese medicine,” Journal of Ethnopharmacology, vol. 140, no. 3, pp. 634–642, 2012.

X. Gao, J. Shang, H. Liu, and B. R. Yu, “A meta-analysis of the clinical efficacy of TCM decoctions made from formulas in the Liu-Wei-Di-Huang-Wan categorized formulas in treating diabetic nephropathy proteinuria,” Evidence-based Complementary and Alternative Medicine, vol. 2018, Article ID 2427301, 10 pages, 2018.

X. J. Wang and B. L. Zhang, “Elucidation of compatibility principle and scientiffic valueof Chinese medical formulae based on pharmacometabolomics,” China Journal of Chinese Materia Medica, vol. 35, no. 10, pp. 1346–1348, 2010.

Y. Zhao, “The ‘Jun-Chen-Zuo-Shi’ combination rule of TCM formula in the Ming dynasty,” Journal of Traditional Chinese Medical Literature, vol. 32, no. 3, pp. 23–25, 2014.

Y. Zhao, “The herb property combination rule of TCM formula in the Ming dynasty,” Journal of Traditional Chinese Medical Literature, vol. 32, no. 1, pp. 32–34, 2014.

Y. J. Bai, Design, synthesis, and biological characterization of herb molecules based on ‘Jun-Chen-Zuo-Shi’ strategy, Northwest University, China, 2014.

L. H. Wu, Y. Wang, Z. Li, B. Zhang, Y. Y. Cheng, and X. H. Fan, “Identifying roles of ‘Jun-Chen-Zuo-Shi’ component herbs of QiShenYiQi formula in treating acute myocardial ischemia by network pharmacology,” Chinese Medicine, vol. 9, no. 1, p. 24, 2014.

K. Li, The multidimensional data analysis and judgment study of major herbs in formula, Chengdu University of Traditional Chinese Medicine, China, 2007.

Y. Zhang, Y. Liu, J. J. Zhu, C. Yang, W. Yang, and S. Zhai, “NALPA: a node ability based label propagation algorithm for community detection,” IEEE Access, vol. 8, pp. 46642–46664, 2020.

W. Zhou, F. Wang, C. J. Wang, and J. Y. Xie, “Mining core herbs and their combination rules using effect degree,” Journal of Frontiers of Computer Science & Technology, vol. 7, no. 11, pp. 994–1001, 2013.

J. J. Wang, “Discussion on concept of ‘the monarch and his subjects, assistant and envoy’ and applied principle from documents,” Chinese Journal of Basic Medicine in Traditional Chinese Medicine, vol. 10, no. 5, pp. 63–65, 2004.

Y. T. Wang and L. Wang, “The explore of ‘Jun’ herbs in Zhi-Gan-Cao-Tang,” Global Traditional Chinese Medicine, vol. 8, no. 8, pp. 955-956, 2015.

X. L. Song and X. Niu, “The explore of ‘Jun’ herbs in ‘Ban-Xia-Sheng-Jiang-Gan-Cao’ of Xie-Xin-Tang,” Chinese Journal of Experimental Traditional Medical Formulae, vol. 13, no. 9, pp. 66–68, 2007.

J. P. Zhan, G. Zheng, M. Jiang et al., “Exploring association rules of traditional Chinese medicine syndrome-symptom-formula-herb in chronic glomerulonephritis by a novel text mining approach,” Chinese Journal of Experimental Traditional Medical Formulae, vol. 19, no. 3, pp. 315–320, 2013.

Y. K. Ma, D. Z. Zhang, A. Wulamu, Y. Xie, H. Zang, and J. Zhang, “The core drugs analysis based on social network analysis about traditional Chinese medicine records semantic relation,” Procedia Computer Science, vol. 31, pp. 328–335, 2014.

X. You, Y. K. Xu, J. Huang et al., “A data mining-based analysis of medication rules in treating bone marrow suppression by kidney-tonifying method,” Evidence-Based Complementary and Alternative Medicine, vol. 2019, Article ID 1907848, 9 pages, 2019.

J. P. Chen, J. Poon, S. K. Poon, L. Xu, and D. M. Y. Sze, “Mining symptom-herb patterns from patient records using tripartite graph,” Evidence-Based Complementary and Alternative Medicine, vol. 2015, Article ID 435085, 14 pages, 2015.

C. C. Chang, Y. C. Lee, C. C. Lin et al., “Characteristics of traditional Chinese medicine usage in patients with stroke in Taiwan: a nationwide population-based study,” Journal of Ethnopharmacology, vol. 186, pp. 311–321, 2016.

S. Y. Yan, R. S. Zhang, X. Z. Zhou, P. Li, L. Y. He, and B. Y. Liu, “Exploring effective core drug patterns in primary insomnia treatment with Chinese herbal medicine: study protocol for a randomized controlled trial,” Trials, vol. 14, no. 1, p. 61, 2013.

V. Žitkus, R. Butkienė, R. Butleris, R. Maskeliūnas, R. Damaševičius, and M. Woźniak, “Minimalistic approach to coreference resolution in Lithuanian medical records,” Computational and Mathematical Methods in Medicine, vol. 2019, Article ID 9079840, 14 pages, 2019.

H. Liang, B. Tsui, H. Ni et al., “Evaluation and accurate diagnoses of pediatric diseases using artificial intelligence,” Nature Medicine, vol. 25, no. 3, pp. 433–438, 2019.

X. Zhou, B. Liu, Z. Wu, and Y. Feng, “Integrative mining of traditional Chinese medicine literature and MEDLINE for functional gene networks,” Artificial Intelligence in Medicine, vol. 41, no. 2, pp. 87–104, 2007.

S. Y. Yu, J. Yang, M. X. Yang et al., “Application of acupoints and meridians for the treatment of primary dysmenorrhea: a data mining-based literature study,” Evidence-Based Complementary and Alternative Medicine, vol. 2015, Article ID 752194, 8 pages, 2015.

M. J. Choi, B. T. Choi, H. K. Shin, B. C. Shin, Y. K. Han, and J. U. Baek, “Establishment of a comprehensive list of candidate antiaging medicinal herb used in Korean medicine by text mining of the classical Korean medical literature, “Dongeuibogam,” and preliminary evaluation of the antiaging effects of these herbs,” Evidence-Based Complementary and Alternative Medicine, vol. 2015, Article ID 873185, 29 pages, 2015.

L. X. Zhang, F. Wang, L. Wang et al., “Prevalence of chronic kidney disease in China: a cross-sectional survey,” Lancet, vol. 379, no. 9818, pp. 815–822, 2012.

H. Y. Wang, Nephrology, People's Medical Publishing House, China, 3th edition, 2012.

B. H. Liu and Y. Xu, “The diagnose, syndrome differentiation and therapeutic effect evaluation of chronic glomerulonephritis (trial scheme),” Shanghai Journal of Traditional Chinese Medicine, vol. 40, no. 6, pp. 8-9, 2006.

J. T. Liu, Y. Jin, and F. F. Li, “Research process of traditional Chinese medicine of chronic glomerulonephritis,” Chinese Archives of Traditional Chinese Medicine, vol. 31, no. 10, pp. 2127–2129, 2013.

Z. S. Harris, “Distributional structure,” Word, vol. 10, no. 23, pp. 146-147, 1954.

S. S. Cao, W. Lu, J. Zhou, and X. L. Li, “Cw2vec: learning Chinese word embeddings with stroke n-gram information,” in Proceedings of the 32th AAAI Conference on Artificial Intelligence (AAAI), pp. 5053–5061, New Orleans, LA, 2018.

Y. Zhang, Y. Liu, J. Zhu et al., “Learning Chinese word embeddings from stroke, structure and pinyin of characters,” in Proceedings of the 28th ACM International Conference on Information and Knowledge Management, pp. 1011–1020, Beijing, China, November 2019.

Y. X. Meng, W. Wu, F. Wang et al., “Glyce: glyph-vectors for Chinese character representations,” in Proceedings of Conference on Neural Information Processing Systems (NeurIPS), pp. 2742–2753, Vancouver, Canada, December 2019.

X. X. Chen, X. Lei, Z. Y. Liu, M. S. Sun, and H. B. Luan, “Joint learning of character and word embeddings,” in Proceedings of the 24th International Joint Conferences on Artificial Intelligence (IJCAI), pp. 1236–1242, Buenos Aires, Argentina, July 2015.

Y. M. Sun, L. Lin, N. Yang, Z. Z. Ji, and X. L. Wang, “Radical-enhanced Chinese character embedding,” in Neural Information Processing. ICONIP 2014, C. K. Loo, K. S. Yap, K. W. Wong, A. Teoh, and K. Huang, Eds., vol. 8835 of Lecture Notes in Computer Science, pp. 279–286, Springer, Cham, 2014.

J. X. Yu, X. Jian, H. Xin, and Y. Q. Song, “Joint embeddings of Chinese words, characters, and fine-grained subcharacter components,” in Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing, pp. 286–291, Copenhagen, Denmark, September 2017.

T. Mikolov, K. Chen, G. Corrado, and J. Dean, “Efficient Estimation of Word Representations in Vector Space,” 2013, https://arxiv.org/abs/1301.3781.

S. Park, J. Byun, S. Baek, Y. Cho, and A. Oh, “Subword-level word vector representations for Korean,” in Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pp. 2429–2438, Melbourne, Australia, July 2018.

P. Bojanowski, E. Grave, A. Joulin, and T. Mikolov, “Enriching word vectors with subword information,” Transactions of the Association for Computational Linguistics, vol. 5, no. 1, pp. 135–146, 2017.

Y. Zhang, Y. G. Liu, Q. Q. Li, R. J. Jin, and C. B. Wen, “LILPA: a label importance based label propagation algorithm for community detection with application to core drug discovery,” Neurocomputing, vol. 413, pp. 107–133, 2020.

M. L. Lu, Z. L. Zhang, Z. H. Qu, and Y. Kang, “LPANNI: overlapping community detection using label propagation in large-scale complex networks,” IEEE Transactions on Knowledge and Data Engineering, vol. 31, no. 9, pp. 1736–1749, 2019.

Y. Zhang, Y. G. Liu, J. T. Li et al., “WOCDA: a whale optimization based community detection algorithm,” Physica A, vol. 539, article 122937, 2020.

J. R. Zhu, B. L. Chen, and Y. F. Zeng, “Community detection based on modularity and k-plexes,” Information Sciences, vol. 513, pp. 127–142, 2020.

Pharmacopoeia Commission of the Ministry of Health of the People's Republic of China, The Pharmacopoeia of the People’s Republic of China, China Medical Science Press, China, 2010.

M. Abdel-Basset, M. Mohamed, M. Elhoseny, L. H. Son, F. Chiclana, and A. E.-N. H. Zaied, “Cosine similarity measures of bipolar neutrosophic set for diagnosis of bipolar disorder diseases,” Artificial Intelligence in Medicine, vol. 101, article 101735, 2019.

S. Gregory, “Finding overlapping communities in networks by label propagation,” New Journal of Physics, vol. 12, no. 10, article 103018, 2010.

W. W. Zachary, “An information flow model for conflict and fission in small groups,” Journal of Anthropological Research, vol. 33, no. 4, pp. 452–473, 1977.

D. Lusseau, “The emergent properties of a dolphin social network,” Royal Society of London Series B, vol. 270, Supplement 2, 2003.

M. Girvan and M. E. J. Newman, “Community structure in social and biological networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 99, no. 12, pp. 7821–7826, 2002.

M. E. J. Newman, “Finding community structure in networks using the eigenvectors of matrices,” Physical Review E, vol. 74, no. 3, article 036104, 2006.

D. J. Watts and S. H. Strogatz, “Collective dynamics of ‘small-world’ networks,” Nature, vol. 393, no. 6684, pp. 440–442, 1998.

M. Boguñá, R. Pastor-Satorras, A. Díaz-Guilera, and A. Arenas, “Models of social networks based on social distance attachment,” Physical Review E, vol. 70, no. 5, article 056122, 2004.

M. E. J. Newman, “The structure of scientific collaboration networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 98, no. 2, pp. 404–409, 2001.

A. Lancichinetti, S. Fortunato, and J. Kertész, “Detecting the overlapping and hierarchical community structure in complex networks,” New Journal of Physics, vol. 11, no. 3, article 033015, 2009.

V. Nicosia, G. Mangioni, V. Carchiolo, and M. Malgeri, “Extending the definition of modularity to directed graphs with overlapping communities,” Journal of Statistical Mechanics Theory and Experiment, vol. 2009, article 03024, no. 3, p. P03024, 2009.

J. Pennington, R. Socher, and C. D. Manning, “Glove: global vectors for word representation,” in Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 1532–1543, Doha, Qatar, October 2014.

S. Tzu-Ray and H. Lee, “Learning Chinese word representations from glyphs of characters,” in Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing, pp. 264–273, Copenhagen, Denmark, September 2017.

J. R. Xie, B. K. Szymanski, and X. M. Liu, “SLPA: uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process,” in 2011 IEEE 11th International Conference on Data Mining Workshops, pp. 344–349, Vancouver, Canada, December 2011.

K. Liu, J. B. Huang, H. L. Sun, M. J. Wan, Y. T. Qi, and H. Li, “Label propagation based evolutionary clustering for detecting overlapping and non-overlapping communities in dynamic networks,” Knowledge-Based Systems, vol. 89, pp. 487–496, 2015.

C. Tong, J. W. Niu, J. M. Wen, Z. Y. Xie, and F. Peng, “Weighted label propagation algorithm for overlapping community detection,” in 2015 IEEE International Conference on Communications (ICC), pp. 1–6, London, UK, June 2015.

X. K. Zhang, J. Ren, C. Song, J. Jia, and Q. Zhang, “Label propagation algorithm for community detection based on node importance and label influence,” Physics Letters A, vol. 381, no. 33, pp. 2691–2698, 2017.

M. Shen and Z. Ma, “A novel node gravitation-based label propagation algorithm for community detection,” International Journal of Modern Physics C, vol. 30, no. 6, article 1950049, 2019.

S. W. Lai, K. Liu, S. Z. He, and J. Zhao, “How to generate a good word embedding,” IEEE Intelligent Systems, vol. 31, no. 6, pp. 5–14, 2016.

M. Woźniak, D. Polap, R. Damasevicius, and W. Wei, “Design of computational intelligence-based language interface for human-machine secure interaction,” Journal of Universal Computer Science, vol. 24, no. 4, pp. 537–553, 2018.

M. Woźniak and D. Polap, “Soft trees with neural components as image-processing technique for archeological excavations,” Personal and Ubiquitous Computing, vol. 24, pp. 1–13, 2020.