An Improved K-Means Algorithm Based on Evidence Distance

The main influencing factors of the clustering effect of the k-means algorithm are the selection of the initial clustering center and the distance measurement between the sample points. The traditional k-mean algorithm uses Euclidean distance to measure the distance between sample points, thus it suffers from low differentiation of attributes between sample points and is prone to local optimal solutions. For this feature, this paper proposes an improved k-means algorithm based on evidence distance. Firstly, the attribute values of sample points are modelled as the basic probability assignment (BPA) of sample points. Then, the traditional Euclidean distance is replaced by the evidence distance for measuring the distance between sample points, and finally k-means clustering is carried out using UCI data. Experimental comparisons are made with the traditional k-means algorithm, the k-means algorithm based on the aggregation distance parameter, and the Gaussian mixture model. The experimental results show that the improved k-means algorithm based on evidence distance proposed in this paper has a better clustering effect and the convergence of the algorithm is also better.

Fast mining method of network heterogeneous fault tolerant data based on K-means clustering

In the traditional network heterogeneous fault-tolerant data mining process, there are some problems such as low accuracy and slow speed. This paper proposes a fast mining method based on K-means clustering for network heterogeneous fault-tolerant data. The confidence space of heterogeneous fault-tolerant data is determined, and the range of motion of fault-tolerant data is obtained; Singular value decomposition (SVD) method is used to construct the classified data model to obtain the characteristics of heterogeneous fault-tolerant data; The redundant data in fault-tolerant data is deleted by unsupervised feature selection algorithm, and the square sum and Euclidean distance of fault-tolerant data clustering center are determined by K-means algorithm. The discrete data clustering space is constructed, and the objective optimal function of network heterogeneous fault-tolerant data clustering is obtained, Realize fault-tolerant data fast mining. The results show that the mining accuracy of the proposed method can reach 97%.

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

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.

Segmentation of corpus callosum based on tensor fuzzy clustering algorithm

BACKGROUND: The corpus callosum in the midsagittal plane plays a crucial role in the early diagnosis of diseases. When the anisotropy of the diffusion tensor in the midsagittal plane is calculated, the anisotropy of corpus callosum is close to that of the fornix, which leads to blurred boundary of the segmentation region. OBJECTIVE: To apply a fuzzy clustering algorithm combined with new spatial information to achieve accurate segmentation of the corpus callosum in the midsagittal plane in diffusion tensor images. METHODS: In this algorithm, a fixed region of interest is selected from the midsagittal plane, and the anisotropic filtering algorithm based on tensor is implemented by replacing the gradient direction of the structural tensor with an eigenvector, thus filtering the diffusion tensor of region of interest. Then, the iterative clustering center based on K-means clustering is used as the initial clustering center of tensor fuzzy clustering algorithm. Taking filtered diffusion tensor as input data and different metrics as similarity measures, the neighborhood diffusion tensor pixel calculation method of Log Euclidean framework is introduced in the membership function calculation, and tensor fuzzy clustering algorithm is proposed. In this study, MGH35 data from the Human Connectome Project (HCP) are tested and the variance, accuracy and specificity of the experimental results are discussed. RESULTS: Segmentation results of three groups of subjects in MGH35 data are reported. The average segmentation accuracy is 97.34%, and the average specificity is 98.43%. CONCLUSIONS: When segmenting the corpus callosum of diffusion tensor imaging, our method cannot only effective denoise images, but also achieve high accuracy and specificity.

Subdivision of Urban Traffic Area Based on the Combination of Static Zoning and Dynamic Zoning

In this paper, the traffic area of subzone division in urban road network is studied and a subzone division method based on the combination of static partition and dynamic partition is proposed. The static partition is carried out for the road network when the traffic flow is in a noncongested state, so as to provide the decision-making basis for the traffic green wave signal control strategy. At the same time, aiming at the road network when the traffic flow is congested, the dynamic partition is carried out on the basis of static partition to provide the decision-making basis for the traffic maximum flow signal control strategy. In view of the fact that it is difficult to determine the clustering center point during the initial division, this method proposes to determine the clustering center point according to the value of nodes of betweenness centrality. In order to solve the problem that it is difficult to collect traffic data, a method for estimating traffic flow density is proposed. In order to solve the problem of normalization of different probability distribution among various parameters, Mahalanobis distance is used as the fusion index of subzone division. Model verification shows that the method is feasible and effective.

Label Propagation Community Detection Algorithm Based on Density Peak Optimization

Community structure detection in complex network structure and function to understand network relations, found its evolution rule, monitoring and forecasting its evolution behavior has important theoretical significance, in the epidemic monitoring, network public opinion analysis, recommendation, advertising push and combat terrorism and safeguard national security has wide application prospect. Label propagation algorithm is one of the popular algorithms for community detection in recent years, the community detection algorithm based on tags spread the biggest advantage is the simple algorithm logic, relative to the module of optimization algorithm convergence speed is very fast, the clustering process without any optimization function, and the initialization before do not need to specify the number of complex network community. However, the algorithm has some problems such as unstable partitioning results and strong randomness. To solve this problem, this paper proposes an unsupervised label propagation community detection algorithm based on density peak. The proposed algorithm first introduces the density peak to find the clustering center, first determines the prototype of the community, and then fixes the number of communities and the clustering center of the complex network, and then uses the label propagation algorithm to detect the community, which improves the accuracy and robustness of community discovery, reduces the number of iterations, and accelerates the formation of the community. Finally, experiments on synthetic network and real network data sets are carried out with the proposed algorithm, and the results show that the proposed method has better performance.

Deep learning for extracting water body from Sentinel-2 MSI imagery

<p>Deep learning has a good capacity of hierarchical feature learning from unlabeled remote sensing images. In this study, the simple linear iterative clustering (SLIC) method was improved to segment the image into good quality super-pixels. Then, we used the convolutional neural network (CNN) to extract of water bodies from Sentinel-2 MSI data using deep learning technique. In the proposed framework, the improved SLIC method obtained the correct water bodies boundary by optimizing the initial clustering center, designing a dynamic distance measure, and expanding the search space. In addition, it is different from traditional extraction of water bodies methods that cannot achieve multi-level water bodies detection. Experimental results showed that this method had higher detection accuracy and robustness than other methods. This study was able to extract water bodies from remotely sensed images with deep learning and to conduct accuracy assessment.</p>

Research on blade grouping method for array machining

Blades are the core component of aero-engines. The complexity of aero-engine blades deformation after multi-axis milling causes poor consistency in batch blades. In turn, the poor consistency of blades affects the aerodynamic performance of an aero-engine. Hence it is critical to ensure the consistency of blades before precise machining. This article proposes a clustering-based blade grouping strategy aiming to improve the consistency of the same group of blades automatically and efficiently. First, the feature vector of the blade and the distance between two blade surfaces are defined. Then the K-medoids clustering algorithm is used to group the blades. According to the maximum allowable distance between the blade surfaces and the Ray-Turi index, the ideal number of clusters, that is the number of groups, is determined. Finally, the clustering center of each cluster is selected as the blade processing model of each group. The experiment for aero-engine blade grouping and machining was performed to demonstrate the effectiveness of the proposed method and the results show that it can improve the consistency of the blades in each group. The geometric contour differences of the blades in the group are not more than 0.02 mm, which can satisfy the requirements of the following precise array machining.

A Novel Data Cluster Algorithm Based on Linear Regression And Residual Analysis for Human Resource Management

Human resource management has become an important part of enterprise management. How to select high-quality talents and how to allocate corresponding talents to appropriate works have become an increasingly acute problem. Traditional data cluster methods cannot effectively solve the above problem due to the high-dimensional data. Therefore, we propose a novel data cluster algorithm based on linear regression and residual analysis for Human Resource Management. Improved hybrid entropy weight attribute similarity is adopted for measuring the similarity between objects. The proposed local density calculation method based on KNN and Parzen window is used to calculate the density of each object. Then, we utilize the linear regression and residual analysis to select the clustering center points quickly and automatically, which can eliminates the subjectivity of artificial selection. A new clustering center objective optimization model is proposed to determine the real clustering center. Through theoretical analysis and comparative experiments on artificial data sets and real data sets, it shows that the proposed cluster algorithm can overcome the defects of the original algorithms, and achieve better clustering effect and lower computation time than state-of-the-art methods.