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

Improved DBSCAN algorithm based on hierarchical structure

A hierarchical structure and algorithm technology, applied in computing, computer components, instruments, etc., can solve problems such as insufficient time performance, and achieve the effect of improving algorithm time performance, reducing time requirements, and improving execution speed.

Pending Publication Date: 2022-07-29
HARBIN UNIV OF SCI & TECH
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] In order to solve the problem of insufficient time performance brought by the traditional DBSCAN algorithm in the face of large data sets, the present invention discloses an improved DBSCAN algorithm based on hierarchical structure

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
  • Improved DBSCAN algorithm based on hierarchical structure
  • Improved DBSCAN algorithm based on hierarchical structure
  • Improved DBSCAN algorithm based on hierarchical structure

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0036] In order to clearly and completely describe the technical solutions in the embodiments of the present invention, the present invention will be further described in detail below with reference to the accompanying drawings in the embodiments.

[0037] Take the six data samples A, B, C, D, E, and F in the two-dimensional plane dataset as an example.

[0038] The improved DBSCAN algorithm based on the hierarchical structure in the embodiment of the present invention includes the following steps.

[0039] Step 1 Hierarchical clustering.

[0040] Step 1-1 Take the above two-dimensional data sample as an example, regard these 6 points as 6 clusters, namely {A}, {B}, {C}, {D}, {E}, {F }.

[0041] Step 1-2 Find the two clusters with the highest similarity in the current cluster, merge them into a new cluster, and update the cluster list. At this time, there are five clusters left, namely {A, B}, {C}, {D }, {E}, {F}.

[0042] Steps 1-3 repeat the previous step, find the two c...

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 relates to an improved DBSCAN algorithm based on a hierarchical structure. The invention provides an improved algorithm based on a hierarchical structure, aiming at the problem that the traditional DBSCAN algorithm is time-consuming because the data volume is increased, firstly, simple hierarchical clustering is carried out on a data set from bottom to top, but only one cluster is required finally, then, a neighborhood object set is built for divided data, and the neighborhood object set is built for a neighborhood object set; noise points are separated in advance through a neighborhood set, interference of noise in the clustering process is avoided, and meanwhile the neighborhood query speed of an algorithm core point object is increased; according to the optimized DBSCAN algorithm, a test discovers that the clustering result of the improved DBSCAN algorithm is basically not changed, but the time performance is greatly improved, and the time complexity is reduced; noise points are stripped in advance, the algorithm execution speed is good, and the time performance of the algorithm is improved.

Description

Technical field: [0001] The invention relates to an improved DBSCAN algorithm based on a hierarchical structure. The method greatly improves the operation efficiency of the algorithm on the premise that the number of clusters and the quality of the clusters are basically consistent between the two algorithms. Background technique: [0002] Clustering is a very popular method in data mining. The core idea is "similar to the same, far apart", the purpose is to divide the data set according to the core idea, and the result is multiple clusters. The data of the same cluster has a high degree of similarity, and the data objects of different clusters have a large degree of dissimilarity. [0003] The current mainstream clustering algorithms include: hierarchy-based methods, grid-based clustering methods, partition-based methods, and density-based methods. Among them, the DBSCAN algorithm is the most classic algorithm in the density-based clustering method. This algorithm does 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
Patent Type & Authority Applications(China)
IPC IPC(8): G06K9/62
CPCG06F18/231
Inventor 李志华万静李想
Owner HARBIN UNIV OF SCI & TECH