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

Global K-means clustering method based on feature weight

A technology of K-means and clustering methods, applied in the field of data statistics, can solve problems such as poor stability

Inactive Publication Date: 2011-11-23
XIDIAN UNIV
View PDF0 Cites 17 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, in order to improve the accuracy of multi-dimensional data clustering and enhance the stability of clustering results, aiming at the problem of relatively poor stability of the LAW-K-means method in use, for the multi-dimensional data clustering characteristics, using the LAW-K-means method has better clustering results and the global K-means has the characteristics of stable results, combining the two, a global K-means clustering method based on feature weights is proposed, which 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
  • Global K-means clustering method based on feature weight
  • Global K-means clustering method based on feature weight
  • Global K-means clustering method based on feature weight

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0055] refer to figure 1 , first cluster the data into one class, and the optimal clustering center is the centroid of all the data, then calculate the data point that minimizes the objective function and use it as the initial clustering center of the next class, and then use The K-means method of feature 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 number of clusters ), thus completing the whole process of gathering all data points into K classes.

[0056] First, we introduce a concept feature 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 clustering into the kt...

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

A global K-means clustering method based on a feature weight is disclosed. The implementation process of the method comprises the following steps of: firstly, clustering data into one class, wherein the optimal clustering centre is the centre of mass of all the data; secondly, figuring out the minimal data point of a target function through calculation and taking the data point as the initial clustering centre of a next class; thirdly, performing iterative updating by a K-means method with the feature weight to obtain the optimal clustering centre of clustering into two classes; and finally, performing updating iteration by orderly increasing the number of the clustering centres by the same method until the clustering of K classes predetermined is completed, thus completing the whole process of clustering all the data points into K classes. In the invention, the new global K-means clustering method based on the feature weight is established by combining the global K-means method with the K-means with the feature weight, and the clustering result is very stable; and in contrast with the experimental results of several K-means clustering methods, the effectiveness and the robustness of the clustering method disclosed by the invention are proved.

Description

technical field [0001] The invention belongs to the field of data statistics and relates to a clustering method. Specifically, a global K-means clustering method based on feature weight is proposed, which is used to solve the problem of unstable clustering results of the common K-means methods in clustering, and improves the clustering accuracy of the method. At the same time, a very stable clustering result is obtained. Background technique [0002] Clustering is a process of dividing a set of data into various classes, so that the intra-class distance is minimized and the inter-class distance is maximized, that is, the data in the same class are as similar as possible, while the data 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 clu...

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
Patent Type & Authority Applications(China)
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