scholarly journals Research on Data Analysis of Traditional Chinese Medicine with Improved Differential Evolution Clustering Algorithm

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Honglei Zhu ◽  
Yingying Zhao ◽  
Xueyun Wang ◽  
Yulong Xu
Keyword(s):  
Global Optimization ◽  
Data Analysis ◽  
Chinese Medicine ◽  
Traditional Chinese Medicine ◽  
Differential Evolution ◽  
Clustering Algorithm ◽  
Optimal Solution ◽  
Local Optimal Solution ◽  
Clustering Center ◽  
Clustering Effect

Medical data analysis is an important part of intelligent medicine, and clustering analysis is a commonly used method for data analysis of Traditional Chinese Medicine (TCM); however, the classical K-Means algorithm is greatly affected by the selection of initial clustering center, which is easy to fall into the local optimal solution. To avoid this problem, an improved differential evolution clustering algorithm is proposed in this paper. The proposed algorithm selects the initial clustering center randomly, optimizes and locates the clustering center in the process of evolution iteration, and improves the mutation mode of differential evolution to enhance the overall optimization ability, so that the clustering effect can reach the global optimization as far as possible. Three University of California, Irvine (UCI), data sets are selected to compare the clustering effect of the classical K-Means algorithm, the standard DE-K-Means algorithm, the K-Means++ algorithm, and the proposed algorithm. The experimental results show that, in terms of global optimization, the proposed algorithm is obviously superior to the other three algorithms, and in terms of convergence speed, the proposed algorithm is better than DE-K-Means algorithm. Finally, the proposed algorithm is applied to analyze the drug data of Traditional Chinese Medicine in the treatment of pulmonary diseases, and the analysis results are consistent with the theory of Traditional Chinese Medicine.

Research and Improvement on K-Means Clustering Algorithm

2013 ◽  
Vol 756-759 ◽  
pp. 3231-3235
Author(s):  
Xue Mei Wang ◽  
Jin Bo Wang
Keyword(s):  
Differential Evolution ◽  
Clustering Algorithm ◽  
Differential Evolution Algorithm ◽  
Optimal Solution ◽  
Clustering Quality ◽  
Local Optimal Solution ◽  
Evolution Algorithm ◽  
Clustering Center ◽  
Searching Ability ◽  
Improved Differential Evolution Algorithm

According to the defects of classical k-means clustering algorithm such as sensitive to the initial clustering center selection, the poor global search ability, falling into the local optimal solution. A differential evolution algorithm which was a kind of a heuristic global optimization algorithm based on population was introduced in this article, then put forward an improved differential evolution algorithm combined with k-means clustering algorithm at the same time. The experiments showed that the method has solved initial centers optimization problem of k-means clustering algorithm well, had a better searching ability,and more effectively improved clustering quality and convergence speed.

Research on the Optimal Design of Soccer Robot Based on the Mechanical Analysis

2013 ◽  
Vol 380-384 ◽  
pp. 3854-3857
Author(s):  
Jian Wen Han ◽  
Lei Hong
Keyword(s):  
Differential Evolution ◽  
Clustering Algorithm ◽  
Differential Evolution Algorithm ◽  
Optimal Solution ◽  
Mechanical Analysis ◽  
Clustering Quality ◽  
Local Optimal Solution ◽  
Evolution Algorithm ◽  
Searching Ability ◽  
Improved Differential Evolution Algorithm

According to the defects of classical k-means clustering algorithm such as sensitive to the initial clustering center selection, the poor global search ability, falling into the local optimal solution. A differential evolution algorithm which was a kind of a heuristic global optimization algorithm based on population was introduced in this article, then put forward an improved differential evolution algorithm combined with k-means clustering algorithm at the same time. The experiments showed that the method has solved initial centers optimization problem of k-means clustering algorithm well, had a better searching ability,and more effectively improved clustering quality and convergence speed

Improved Artificial Bee Colony Clustering Algorithm Based on K-Means

2014 ◽  
Vol 556-562 ◽  
pp. 3852-3855 ◽  
Author(s):  
Xue Mei Wang ◽  
Jin Bo Wang
Keyword(s):  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Clustering Algorithm ◽  
Optimal Solution ◽  
Bee Colony ◽  
The Poor ◽  
Algorithm Stability ◽  
Clustering Quality ◽  
Local Optimal Solution ◽  
Clustering Center

According to the defects of classical k-means clustering algorithm such as sensitive to the initial clustering center selection, the poor global search ability, falling into the local optimal solution. Artificial Bee Colony algorithm based on K-means was introduced in this article, then put forward an improved Artificial Bee Colony algorithm combined with k-means clustering algorithm at the same time. The experiments showed that the method has solved algorithm stability of k-means clustering algorithm well, and more effectively improved clustering quality and property.

The Research on Modified K-Means Algorithm Based on GA&SA

2013 ◽  
Vol 347-350 ◽  
pp. 3242-3246
Author(s):  
Zhe Feng Zhu ◽  
Xiao Bin Hui ◽  
Yi Qian Cao ◽  
Wan Xiang Lian
Keyword(s):  
Local Search ◽  
Clustering Algorithm ◽  
Optimal Solution ◽  
Global Search ◽  
Local Optimization ◽  
Effective Algorithm ◽  
Global Optimal Solution ◽  
Local Optimal Solution ◽  
Global Optimal ◽  
Clustering Center

The traditional K-means clustering algorithm has the disadvantage of weakness in overall search, easily falling into local optimization, highly reliance on initial clustering center. Aiming at the drawback of falling into partial optimization, putting forward a modified K-means algorithm mixing GA and SA, which combined the advantages of global search ability of GA and local search, to avoid K-means algorithm to lost into local optimal solution. The results of simulation show that the performance of above-mentioned algorithm is better in the optimization capacity than before, and easier to get the global optimal solution. It is an effective algorithm.

K-Means Clustering Algorithm Based on Prim Improvement

2014 ◽  
Vol 644-650 ◽  
pp. 2063-2066
Author(s):  
He Wei Zhang ◽  
Lei Sun ◽  
Hong Zhang
Keyword(s):  
Data Mining ◽  
Clustering Algorithm ◽  
Contrastive Analysis ◽  
Greedy Strategy ◽  
Classical Algorithm ◽  
Sample Data ◽  
Clustering Center ◽  
Clustering Effect ◽  
Implementation Steps

K - means algorithm is the classical algorithm to solve the problem of clustering in the area of data mining, when the sample data meets certain conditions, the results of clustering is better. But the algorithm is sensitive to the initial clustering center and clustering results will change as the differences of initial clustering center its number. Aimed at this shortage, this paper proposes a new algorithm based on prim algorithm to select the initial clustering center, details the basic idea of the algorithm and improves the specific methods and implementation steps, finally uses a test for the contrastive analysis. Results show that the improved K - means clustering algorithm needs not to specify the initial clustering center in advance, and it is not sensitive to abnormal value, and at the same time the use of greedy strategy makes the clustering effect more optimal than usual algorithms.

scholarly journals An Improved Grey Wolf Optimizer Based on Differential Evolution and OTSU Algorithm

2020 ◽  
Vol 10 (18) ◽  
pp. 6343
Author(s):  
Yuanyuan Liu ◽  
Jiahui Sun ◽  
Haiye Yu ◽  
Yueyong Wang ◽  
Xiaokang Zhou
Keyword(s):  
Differential Evolution ◽  
Image Recognition ◽  
Optimal Solution ◽  
Tsallis Entropy ◽  
Grey Wolf Optimizer ◽  
Initial Population ◽  
Grey Wolf ◽  
Particle Swarm Optimizer ◽  
De Algorithm ◽  
Local Optimal Solution

Aimed at solving the problems of poor stability and easily falling into the local optimal solution in the grey wolf optimizer (GWO) algorithm, an improved GWO algorithm based on the differential evolution (DE) algorithm and the OTSU algorithm is proposed (DE-OTSU-GWO). The multithreshold OTSU, Tsallis entropy, and DE algorithm are combined with the GWO algorithm. The multithreshold OTSU algorithm is used to calculate the fitness of the initial population. The population is updated using the GWO algorithm and the DE algorithm through the Tsallis entropy algorithm for crossover steps. Multithreshold OTSU calculates the fitness in the initial population and makes the initial stage basically stable. Tsallis entropy calculates the fitness quickly. The DE algorithm can solve the local optimal solution of GWO. The performance of the DE-OTSU-GWO algorithm was tested using a CEC2005 benchmark function (23 test functions). Compared with existing particle swarm optimizer (PSO) and GWO algorithms, the experimental results showed that the DE-OTSU-GWO algorithm is more stable and accurate in solving functions. In addition, compared with other algorithms, a convergence behavior analysis proved the high quality of the DE-OTSU-GWO algorithm. In the results of classical agricultural image recognition problems, compared with GWO, PSO, DE-GWO, and 2D-OTSU-FA, the DE-OTSU-GWO algorithm had accuracy in straw image recognition and is applicable to practical problems. The OTSU algorithm improves the accuracy of the overall algorithm while increasing the running time. After adding the DE algorithm, the time complexity will increase, but the solution time can be shortened. Compared with GWO, DE-GWO, PSO, and 2D-OTSU-FA, the DE-OTSU-GWO algorithm has better results in segmentation assessment.

scholarly journals Summarizing the Effective Herbs for the Treatment of Hypertensive Nephropathy by Complex Network and Machine Learning

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Jia-Ming Huan ◽  
Wen-Ge Su ◽  
Wei Li ◽  
Chao Gao ◽  
Peng Zhou ◽  
...  
Keyword(s):  
Machine Learning ◽  
Chinese Medicine ◽  
Traditional Chinese Medicine ◽  
Signaling Pathways ◽  
Complex Network ◽  
Renal Damage ◽  
Clustering Algorithm ◽  
Mapk Signaling ◽  
Prescription Data ◽  
Hypertensive Nephropathy

Hypertensive nephropathy is a common complication of hypertension. Traditional Chinese medicine has been used in the clinical treatment of hypertensive nephropathy for a long time, but the commonly used prescriptions have not been summarized, and the basic therapeutic approaches have not been discussed. Based on data from 3 years of electronic medical records of traditional Chinese medicine used at the Affiliated Hospital of Shandong University of Traditional Chinese Medicine, a complex network and machine learning algorithm was used to explore the prescribed herbs of traditional Chinese medicine in the treatment of hypertensive nephropathy (HN). In this study, complex network algorithms were used to describe traditional Chinese medicine prescriptions for HN treatment. The Apriori algorithm was used to analyze the compatibility of these treatments with modern medicine. Data on the targets and regulatory genes related to hypertensive nephropathy and the herbs that affect their expression were obtained from public databases, and then, the signaling pathways enriched with these genes were identified on the basis of their participation in biological processes. A clustering algorithm was used to analyze the therapeutic pathways at multiple levels. A total of 1499 prescriptions of traditional Chinese medicines used for the treatment of hypertensive renal damage were identified. Fourteen herbs used to treat hypertensive nephropathy act through different biological pathways: huangqi, danshen, dangshen, fuling, baizhu, danggui, chenpi, banxia, gancao, qumai, cheqianzi, ezhu, qianshi, and niuxi. We found the formulae of these herbs and observed that they could downregulate the expression of inflammatory cytokines such as TNF, IL1B, and IL6 and the NF-κB and MAPK signaling pathways to reduce the renal inflammatory damage caused by excessive activation of RAAS. In addition, these herbs could facilitate the deceleration in the decline of renal function and relieve the symptoms of hypertensive nephropathy. In this study, the traditional Chinese medicine approach for treating hypertensive renal damage is summarized and effective treatment prescriptions were identified and analyzed. Data mining technology provided a feasible method for the collation and extraction of traditional Chinese medicine prescription data and provided an objective and reliable tool for use in determining the TCM treatments of hypertensive nephropathy.

Sign in / Sign up

Export Citation Format

Share Document