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

A clustering method based on vision principle to solve big data clustering

A clustering method and big data technology, applied in text database clustering/classification, special data processing applications, relational databases, etc. Use needs, etc.

Active Publication Date: 2020-07-28
XI AN JIAOTONG UNIV
View PDF9 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This is difficult to meet in big data and distributed situations, so this method is also difficult to meet the needs of clustering
[0007] Clustering problems are the basis of information processing methods such as artificial intelligence and machine learning. There are many excellent clustering algorithms, but they are difficult to implement in the environment of big data computing, and the existing big data clustering methods are difficult to meet the needs of use.

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
  • A clustering method based on vision principle to solve big data clustering
  • A clustering method based on vision principle to solve big data clustering
  • A clustering method based on vision principle to solve big data clustering

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0041] The present invention will be further described below in conjunction with the accompanying drawings.

[0042] Step1 Determine the S / D encoding accuracy: according to different application scenarios, set different encoding accuracy ε, the size of ε shows the error between the encoding and the original data;

[0043] Step2 Determine the number of bits, the largest scale and the smallest scale of the S / D code: any element χ∈P in the d-dimensional original data set χ δ , for each dimension x of x (t) ∈[a t ,b t ], t∈[1,d], the largest scale σ max satisfy

[0044]

[0045] Minimum scale σ 0 Usually 1, the number of encoded bits L=σ max × d;

[0046] Step3 S / D encodes each element in the original data to obtain the original code set x ∈ χ, P ε (·) is the S / D encoding function,

[0047] e=P ε (x),e=[e (1) e (2) ...e (L) ]

[0048]

[0049] in,[·] 2 Represents the binary form of a number, Indicates a round down operation. The specific encoding process ...

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 visual principle-based clustering method for solving big data clustering. By performing lossless multi-scale encoding on the original data with a given precision, the multi-scale and multi-dimensional grid storage of the data is realized. Each scale code judges the similarity between codes and neighborhood codes, and uses connectivity analysis to realize multi-scale clustering and provide multi-scale clustering results. In the process of data encoding, the principle of vision is used, which conforms to Weber's law, that is, the difference threshold of sensation changes with the change of the original stimulus amount.

Description

technical field [0001] The invention belongs to the field of big data clustering, and in particular relates to a visual principle-based clustering method for solving big data clustering. Background technique [0002] Clustering is a knowledge discovery method that divides data into different groups according to some similarity (such as structure or trend) of data. Measuring the similarity between data is the basis of clustering. Usually, the similarity between each point is stored in the form of a matrix. For large-scale or distributed data, this method will lead to a huge amount of data transmission, slow calculation efficiency, and even due to the huge matrix Unable to store the problem. [0003] The reason for these problems is that the similarity is stored in a dense matrix, and the data volume increases at the square speed of the original data volume. [0004] There are currently two types of big data clustering algorithms: [0005] A divisional clustering method wit...

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 Patents(China)
IPC IPC(8): G06K9/62G06F16/28G06F16/35
CPCG06F16/285G06F16/35G06F18/23
Inventor 徐宗本张俪文杨树森
Owner XI AN JIAOTONG 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