High-dimensional data clustering method based on unweighted hypergraph segmentation

A technology of high-dimensional data and clustering methods, which is applied in the direction of instruments, character and pattern recognition, computer components, etc., can solve the problem that hypergraphs cannot reflect the data distribution of data sets, and achieve the effect of improving computing efficiency

Inactive Publication Date: 2016-01-27
YANCHENG INST OF TECH
View PDF4 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

But the disadvantage is that the hypergraph cannot reflect the data distribution of the entire data set, and cannot complete the cluster analysis of all data

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
  • High-dimensional data clustering method based on unweighted hypergraph segmentation

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0026] Such as figure 1 As shown, the clustering algorithm consists of three steps, which are the construction of unweighted hypergraph, the segmentation of unweighted hypergraph, and the evaluation of clustering results. The following are detailed introductions respectively.

[0027] 1. Construction of Unweighted Hypergraph S01

[0028] Define 1 node V

[0029] Map distinct attribute values ​​in high-dimensional datasets to nodes of an unweighted hypergraph.

[0030] Definition 2 Hyperedge E

[0031] Each data record is mapped to a hyperedge of the unweighted hypergraph, and each node contained in the hyperedge is an attribute value of the data record.

[0032] The central idea of ​​the unweighted hypergraph construction algorithm for high-dimensional datasets is to map different attribute values ​​in high-dimensional datasets to nodes in unweighted hypergraphs, map each data record in high-dimensional datasets to a hyperedge, and The unweighted hypergraph...

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 high-dimensional data clustering method based on unweighted hypergraph segmentation. The high-dimensional data clustering method comprises the steps of: mapping different attribute values in a high-dimensional data set as nodes of an unweighted hypergraph, and mappting each data record as a hyperedge of the unweighted hypergraph to obtain an original unweighted hypergraph, wherein each node contained in the hyperedge is an attribute value of the data record; segmenting the original unweighted hypergraph into k parts, and regarding each part as a clustering subgraph; and evaluating quality of a clustering result by using compactness of the clustering subgraphs, wherein the greater the compactness, the better the quality of the clustering result, the compactness of the clustering subgraphs is defined by a ratio of v1 to v2, the v1 is the number of nodes simultaneously occupied by at least two hyperedges among all the nodes in the clustering subgraphs, and the v2 is the number of nodes occupied by only one hyperedge. The high-dimensional data clustering method can be used for carrying out clustering analysis on the high-dimensional data set comprehensively, and can further improve the calculating efficiency of a high-dimensional data clustering algorithm.

Description

technical field [0001] The invention belongs to the technical field of high-dimensional data clustering processing, and in particular relates to a high-dimensional data clustering method based on unweighted hypergraph segmentation. Background technique [0002] With the rapid development of information technology, the amount of data accumulated by people has increased rapidly, often forming many high-dimensional data sets. How to extract useful knowledge from massive high-dimensional data sets has become a top priority for researchers. Data mining is a data processing technology developed to meet this need. Data mining includes various methods such as association rules, clustering, classification, etc. In recent years, the clustering algorithm for high-dimensional data has gradually become a research hotspot. One of its typical applications is the forecast of the stock market. By clustering and analyzing the high-dimensional data sets of the stock market, a collection of s...

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): G06K9/62
CPCG06F18/2323
Inventor 陈伟高直孟海涛徐秀芳巩永旺韩立毛
Owner YANCHENG INST OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products