Supercharge Your Innovation With Domain-Expert AI Agents!

Large-scale data analysis method based on DBSCAN algorithm

A technology of large-scale data and analysis methods, applied in the field of large-scale data analysis based on the DBSCAN algorithm, can solve the problems of large time consumption of the partition process, complex distribution, unstable partition effect and performance, and reduce idle waiting time. , the effect of reducing traffic

Pending Publication Date: 2022-07-05
SUN YAT SEN UNIV
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, as the dimensionality of data increases, the distribution of data often becomes extremely complex, and the effect and performance of simple partition methods will become very unstable; complex partition methods also have the problem that the time consumed by the partition process is too large, and many scenarios Only one-time cluster analysis is needed, and the time is not worth the loss

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-scale data analysis method based on DBSCAN algorithm
  • Large-scale data analysis method based on DBSCAN algorithm
  • Large-scale data analysis method based on DBSCAN algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0031] The technical scheme of the present invention is further described below in conjunction with the accompanying drawings of the description:

[0032] This embodiment discloses a distributed DBSCAN algorithm for large-scale computing clusters. The algorithm calculates an adjacency list through ring communication, broadcasts and synchronizes the cluster number of core points in turn, and updates the cluster number of boundary points through reverse ring communication. The mathematically equivalent distributed clustering algorithm of DBSCAN algorithm makes full use of the physical memory and communication bandwidth of the computer, and balances the workload of each computing node, so that the clustering analysis of high-latitude large-scale data sets can be completed in an effective time. .

[0033] like figure 1 As shown, the method of this embodiment specifically includes the following steps:

[0034] Step (1): Calculate the adjacency list through ring communication

[...

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-scale data analysis method based on a DBSCAN algorithm. The large-scale data analysis method comprises the following steps that 1, an adjacency list is calculated through annular communication; 2, locally and preliminarily determining a temporary cluster number of a core point; step 3, broadcasting synchronous core point cluster numbers in turn; and step 4, updating the boundary point cluster number through reverse annular communication. According to the method, the efficiency problem of the DBSCAN algorithm in large-scale data clustering analysis can be well solved, the problem of dependency of calculation steps in the recursive calculation process of the DBSCAN algorithm is ingeniously solved, the method is made to be suitable for a distributed execution model, and workloads of different nodes in a cluster are made to be balanced as much as possible. The communication traffic in distributed calculation is greatly reduced, calculation and communication are overlapped in a non-blocking communication mode, and the idle waiting time is shortened. And the memory of the calculation node is fully utilized, so that the clustering analysis of mass data on the cluster is realized.

Description

technical field [0001] The invention relates to a big data clustering algorithm and a computer distributed computing technology, in particular to a large-scale data analysis method based on the DBSCAN algorithm. Background technique [0002] With the continuous innovation of information technology, people's demand for extracting effective information from massive data is more and more urgent. However, how to process the massive data is still a serious challenge. Data mining technology to mine effective information from data has become more and more important with the advent of the era of big data. Cluster analysis in the field of data mining is widely used in practice because of its versatility. In conclusion, how to apply cluster analysis techniques to large-scale systems and massive data is one of the important challenges in big data processing. [0003] The DBSCAN algorithm is a density clustering method proposed by Ester Martin et al. in 1996. It takes the data object...

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): G06F9/50G06F9/54G06K9/62G06V10/762
CPCG06F9/5083G06F9/542G06F18/23
Inventor 卢宇彤张元胤陈志广
Owner SUN YAT SEN 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