Unlock instant, AI-driven research and patent intelligence for your innovation.

Data correlation determination method

A determination method and data association technology, applied in the information field, can solve the problems of slow speed and insufficient clustering quality, and achieve the effect of fast processing speed

Inactive Publication Date: 2017-10-31
杨连群
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The main purpose of the present invention is to overcome the defects of the above-mentioned prior art, and provide a method for determining data relevance to solve the defects of slow speed and insufficient clustering quality in the process of determining data relevance in the prior art. It can provide high-quality clustering results while ensuring a fast processing speed

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
  • Data correlation determination method
  • Data correlation determination method
  • Data correlation determination method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0048] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution of the present invention will be clearly and completely described below in conjunction with specific embodiments of the present invention and corresponding drawings. Apparently, the described embodiments are only some of the embodiments of the present invention, but not all of them. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts belong to the protection scope of the present invention.

[0049] figure 1 The above is a schematic diagram of a method for determining data relevance provided by a specific embodiment of the present invention.

[0050] Step 110, clustering the data of graph G to obtain N clusters.

[0051] Step 120, merge the N clusters obtained in the first step to generate K clusters, where K

[0052] In a specific implementation...

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 provides a data correlation determination method. The method comprises the following steps of 1, clustering data of a graph G to obtain N clusters; and 2, merging the obtained N clusters to generate K clusters, wherein K is less than N. According to the method provided by the invention, the defects of relatively low speed and low clustering quality in a data correlation determination process in the prior art are overcome; and while a high-quality clustering result can be provided, relatively high processing speed is ensured.

Description

technical field [0001] The invention relates to the field of information technology, in particular to a method for determining data relevance. Background technique [0002] Clustering analysis is to divide objects into different clusters according to the similarity between objects, so that the similarity of objects in the same cluster is maximized, and the similarity of objects between different clusters is minimized. [0003] Graph clustering in cluster analysis refers to dividing a graph into some disjoint subgraphs, so that the nodes in the same subgraph have higher closeness, while the nodes between subgraphs have lower closeness. A graph is usually expressed as G=(V,E,W), where V is the set of nodes, E is the set of edges, and W is the edge weight. The graph clustering problem is to divide the graph G into K disjoint subgraphs G. i =(V,E,W), i=1,2,...,K. The graph clustering methods in the prior art have the following disadvantages: 1) the segmentation quality is not...

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): G06K9/62
CPCG06F18/2323G06F18/22
Inventor 杨连群温晋英刘树发
Owner 杨连群