Check patentability & draft patents in minutes with Patsnap Eureka AI!

Large-data clustering optimization method based on dimension reducing grouping

An optimization method and big data technology, applied in multi-dimensional databases, relational databases, database models, etc., can solve the problems of large amount of calculation and low accuracy, and achieve the effect of less computing resources, high accuracy and wide adaptability

Inactive Publication Date: 2017-01-25
XIDIAN UNIV
View PDF1 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007] The purpose of the present invention is to propose a large data clustering optimization method based on dimensionality reduction grouping for the existing large data clustering optimization problem solving methods with large amount of calculation and low accuracy, including the following specific steps:

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
  • Large-data clustering optimization method based on dimension reducing grouping

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0033] Attached below figure 1 The present invention is further described.

[0034] Step 1, initialization.

[0035] Create a global related dimension Non-Set collection and initialize it to empty.

[0036] Create a temporary collection Temp-Set and initialize it to empty.

[0037] Step 2, scan the similarity expression corresponding to the big data clustering optimization problem, and judge whether it contains a correlation symbol, if so, go to step 3, otherwise, go to step 4.

[0038] Step 3, store related dimensions.

[0039] Store the correlation quantity contained in the similarity expression as a sub-dimension in the Non-Set collection of the global correlation dimension.

[0040] Step 4, judging whether the similarity expression contains similarity sub-expressions separated by parentheses, if so, execute step 5, otherwise, execute step 12.

[0041] Step 5, storing temporary data.

[0042] Store each dimension included in the similarity sub-expression as temporary ...

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 large-data clustering optimization method based on dimension reducing grouping. The large-data clustering optimization method includes the steps that (1) initialization is carried out; (2) similarity expressions corresponding to large-data clustering optimization problems are scanned, and whether relative symbols exist or not is judged; (3) relative dimensionality is stored; (4) whether similarity sub-expressions exist or not is judged; (5) ephemeral data of the similarity sub-expressions is stored; (6) whether relative symbols exist in the similarity sub-expressions or not is judged; (7) relative sub-dimensionality is stored; (8) whether a first symbol after the similarity sub-expressions is the similarity symbol or not is judged; (9) the relative dimensionality is merged; (10) ephemeral data is released; (11) sub-dimensionality with common elements is merged. By means of the large-data clustering optimization method based on dimension reducing grouping, the large-data clustering optimization problems can be accurately subjected to dimension reducing grouping, the speed is high, and wide adaptation is achieved.

Description

technical field [0001] The invention belongs to the technical field of big data clustering optimization, and further relates to a big data clustering optimization method based on dimensionality reduction grouping in the technical field of large-scale numerical query analysis and optimization. The present invention can be used for big data clustering, big data compression storage, classifier construction, optimizing scheduling process by grouping tasks in large-scale task scheduling, artificial neural network classification training, and classifying various system parameters in engineering design problems optimization etc. Background technique [0002] Big data clustering optimization technology refers to large-scale problems, that is, problems with more than 1,000 dimensions or variables, reducing the dimension of the problem through dimensionality reduction and grouping, so that it is easier to process or optimize large-scale problems. Due to the characteristics of high di...

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): G06F17/30
CPCG06F16/285G06F16/283
Inventor 王宇平刘海燕魏飞关世伟刘旭妍宗婷婷蔡坤
Owner XIDIAN UNIV
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More