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

Competition and cooperation clustering method based on maximum clearance segmentation of dynamic bounding box

A technology of maximum gap and clustering method, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve problems that affect the use effect and practical value of CCL clustering algorithm, initial seed points are sensitive and difficult to determine, etc. , to avoid clustering fragmentation, improve stability, and speed up clustering

Inactive Publication Date: 2014-11-12
HOHAI UNIV
View PDF4 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

K-means is a clustering method based on the mean square error (MSE) minimization criterion, but this type of algorithm has two main defects: 1) K-means needs to determine the exact number of categories in advance, but in practical applications, It is difficult to determine this parameter; 2) prone to the so-called "dead unit" phenomenon
However, there are still some unavoidable problems in the CCL algorithm: 1) It has the initial seed point sensitivity problem
[0003] The existence of the above problems affects the use effect and practical value of the CCL clustering algorithm, and it is necessary to improve these defects of the CCL algorithm

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
  • Competition and cooperation clustering method based on maximum clearance segmentation of dynamic bounding box
  • Competition and cooperation clustering method based on maximum clearance segmentation of dynamic bounding box
  • Competition and cooperation clustering method based on maximum clearance segmentation of dynamic bounding box

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0060] The present invention will be described in further detail in conjunction with the accompanying drawings and specific embodiments.

[0061] The present invention discovers its deficiencies through experiments and analysis of the original CCL clustering algorithm, and makes targeted improvements. Concepts and symbols involved in the present invention are defined as follows:

[0062] Input sample: the input data, each input data is a multidimensional vector, denoted as x i , i represents the i-th input data;

[0063] Seed point: also called clustering center in the present invention, a vector with the same dimension as the input data, denoted as c i , i represents the i-th seed point;

[0064] Winner: For the current input data x i , distance x i The closest seed point is called the winner, denoted as c w , the distance measure here adopts Euclidean distance;

[0065] Cooperation group: for the current input data x i , with the winner c w as the center, ||c w -x ...

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 discloses a competition and cooperation clustering method based on maximum clearance segmentation of a dynamic bounding box, and provides a method for acquiring an initial seed point by adopting the maximum clearance segmentation of the dynamic bounding box, i.e. firstly calculating a bounding box of data in a multi-dimensional characteristic space, projecting data points in the bounding box towards a longest axis, dividing the bounding box into two parts by finding out positions with a maximum distance of two adjacent projection points, carrying out the recursion until the entire space is segmented into sufficient subspaces, and finally calculating a center of the subspaces to be used as the initial seed point. The invention also provides a method for merging clusters by adopting a distance radius analysis method and capable of self-adaptively combining a plurality of segmented clusters into a complete cluster aiming at the phenomenon that the same cluster is segmented into a plurality of clusters. By adopting the competition and cooperation clustering method, the missing phenomenon caused by the random seed point can be avoided, the clustering segmentation phenomenon can be avoided, and a real cluster result can be rapidly acquired.

Description

technical field [0001] The invention relates to a competitive and cooperative clustering method based on dynamic bounding box maximum gap segmentation, which belongs to the technical field of data mining. Background technique [0002] Clustering is the process of grouping a group of real or abstract data objects into multiple classes or clusters, and it is an effective means for people to understand and explore the internal relationship between things. Commonly used clustering methods include K-means, ISODATA, and fuzzy clustering. K-means is a clustering method based on the mean square error (MSE) minimization criterion, but this type of algorithm has two main defects: 1) K-means needs to determine the exact number of categories in advance, but in practical applications, It is difficult to determine this parameter; 2) It is easy to produce the so-called "dead unit" phenomenon. If an initial clustering center is given inappropriately, no input data will be assigned to the ...

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
CPCG06F18/23
Inventor 陈仁喜周绍光
Owner HOHAI 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