Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Entropy weight-based global K-means clustering method

A technology of K-means and clustering methods, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve problems such as poor stability

Inactive Publication Date: 2011-11-23
XIDIAN UNIV
View PDF0 Cites 14 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0012] The technical problem to be solved by the present invention is that the K-means method of entropy weight is used alone and has poor stability. In order to improve the accuracy of multidimensional data clustering and enhance the stability of clustering results, based on multidimensional data clustering Based on the characteristics of clusters, a global K-means clustering method based on entropy weights is proposed. Compared with other methods, this method can obtain higher clustering accuracy and stability.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Entropy weight-based global K-means clustering method
  • Entropy weight-based global K-means clustering method
  • Entropy weight-based global K-means clustering method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0054] refer to figure 1 , first cluster the data into one class, and its optimal clustering center is the centroid of all samples, then calculate the sample point that minimizes the objective function and use it as the initial optimal clustering center of the next class, and then use The K-means method based on the entropy weight is iteratively updated to obtain the best cluster center when clustered into two categories, and the same method is used to increase the number of cluster centers in order to update and iterate until K categories are clustered (K is the known cluster number), thus completing the whole process of clustering all sample points into K classes.

[0055] First, we introduce a concept entropy weight λ in depth k,j : It indicates the effect of the jth attribute on clustering into the kth class. The larger the value, the greater the effect of this attribute. The smaller the value or even 0, the smaller the effect of this attribute does not even affect clust...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention relates to an entropy weight-based global K-means clustering method. The method is realized through the steps of: firstly, clustering data into a class, wherein the optimal clustering center is the centroid of all data; next, determining the minimum data point of an objective function through computation, and taking the data point as an initial clustering center of a next class; then iterating and updating by utilizing an entropy weight-based K-means method to get the optimal clustering centers when the data are clustered into two classes; and sequentially increasing the number of the clustering centers by adopting the same method to iterate and update until the clustering of the set K class is completed, and in this way, completing the whole process of clustering all data points into the K class. According to the method provided by the invention, the global K-means clustering method is combined with K-means with entropy attributes, a new entropy weight value-based global K-means clustering method is constructed, and the clustering results are quite stable; and compared with the experimental results of varieties of K-means clustering methods, the effectiveness and the robustness of the clustering method provided by the invention are proven.

Description

technical field [0001] The present invention relates to a new clustering method. Specifically, a global K-means clustering method based on entropy weights is proposed to solve the problems of low clustering accuracy and unstable clustering results of common K-means methods in clustering. While improving the clustering accuracy of the method, a very stable clustering result is obtained. Background technique [0002] Clustering is a process of dividing a group of samples into each class, so that the intra-class distance is minimized and the inter-class distance is maximized, that is, samples in the same class are as similar as possible, and samples in different classes are as similar as possible. different. Clustering plays an important role in data mining, statistics, machine learning, spatial database technology, biology, and marketing. [0003] In recent years, data has become increasingly complex in many application domains of clustering. A target is often described by...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06F17/30
Inventor 于昕焦李成惠转妮刘芳曹宇吴建设王达王爽李阳阳
Owner XIDIAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products