Set characteristic vector-based quick clustering method and device

Abstract

The invention provides a set characteristic vector-based quick clustering method and a set characteristic vector-based quick clustering device. The method comprises the following steps of: (1) converting input hybrid attribute data into a binary attribute; (2) sequencing according to an object sparsity index or a non-interference sequence index; (3) independently categorizing a first sequenced object to obtain a set characteristic vector of the first object, then sequentially scanning other objects to be clustered, and determining whether a presently scanned object is incorporated into an established category or an independently established new category by sizes of set difference and set difference upper limit b1 for incorporating the object into the established category; and (4) performing secondary clustering on a primary clustering result obtained by the step (3), and then removing an isolated point in the clustering result to obtain a final clustering result. According to the method and the device, a clustering process can be finished by only performing sequencing and scanning on the data once, the time required by clustering is greatly shortened while the clustering quality is considered, and the clustering result cannot be limited to influence of a data input sequence.

Description

technical field [0001] The invention relates to the technical fields of data mining, cluster analysis, high-dimensional data clustering, etc., and in particular to a fast clustering method and device based on set feature vectors. Background technique [0002] Clustering is one of the most common tasks in the field of data mining, which is used to discover unknown object classes in the data set. [0003] The ability to process high-dimensional data is an important content of clustering research. Many clustering algorithms can generate high-quality clustering results when the dimensionality is relatively low, but it is difficult to apply to high-dimensional data, and sometimes may even produce wrong clustering results. [0004] Before proposing the present invention, we have proposed an effective algorithm—CABOSFV clustering algorithm in the field of high-dimensional data mining, especially in the field of high-dimensional sparse data mining. [0005] The CABOSFV algorithm d...

AI Technical Summary

Problems solved by technology

However, the CABOSFV algorithm also has some deficiencies: ①The clustering results are not uniform, the size of each clustering result is very different, and it tends to produce large-scale clusters; ②The clustering results are seriously affected by the upper limit of the difference b, and the setting If the b value is different, the clustering results may be quite different; ③The clustering results are affected by the order of data input, ev

Images