Local core point clustering algorithm based on parallel natural neighbors

A clustering algorithm and core point technology, applied in computing, computer components, instruments, etc., can solve problems such as inability to apply complex manifold data sets, and achieve the effect of improving efficiency

Inactive Publication Date: 2019-06-07
YANGTZE NORMAL UNIVERSITY
View PDF0 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] Aiming at the deficiency that the existing DP (Density Peaks) algorithm cannot be applied to complex manifold data sets, the present invention proposes a local core point clustering algor

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
  • Local core point clustering algorithm based on parallel natural neighbors
  • Local core point clustering algorithm based on parallel natural neighbors
  • Local core point clustering algorithm based on parallel natural neighbors

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0045] The present invention will be further described in detail below in conjunction with examples and specific implementation methods. However, it should not be understood that the scope of the above subject matter of the present invention is limited to the following embodiments, and all technologies realized based on the content of the present invention belong to the scope of the present invention.

[0046] figure 1 It is a schematic flowchart of a local core point clustering algorithm based on parallel natural neighbors according to an exemplary embodiment of the present invention. Specifically include the following steps:

[0047] Step S1: Construct a KD-tree on the data set using the quick sort method.

[0048] In the present embodiment, the data set to be clustered is D, and the present invention adopts the quick sorting method to sort the data in the data set D so as to find the median value of the data set, thereby constructing the KD-tree (k-Dimensional tree) of th...

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 local core point clustering algorithm based on parallel natural neighbors. The local core point clustering algorithm comprises the following steps of S1, carrying out KD-treeconstruction on data set by adopting a rapid sorting method; S2, obtaining neighborhood information of each data object by adopting a parallel natural neighborhood search algorithm; S3, obtaining a local core point by calculating the density of each data object; S4, calculating the distance between the local core points; S5, constructing a decision diagram, and realizing clustering of local corepoints; S6, distributing non-local core points, and achieving clustering of the data set. Through the algorithm, the distance between the local core points based on the shared neighbors is defined, and the efficiency of the clustering algorithm is improved.

Description

technical field [0001] The invention relates to the technical field of data mining, in particular to a local core point clustering algorithm based on parallel natural neighbors. Background technique [0002] Cluster analysis is an important method of data mining. Its purpose is to divide data objects into different classes, so that objects in the same cluster are similar to each other, while objects in different clusters are different from each other. Cluster analysis is widely used in fields such as big data, pattern recognition, image processing and artificial intelligence. Therefore, the research on clustering analysis algorithm is of great significance. The existing clustering algorithms can be roughly divided into partition-based methods, density-based methods, hierarchical-based methods, grid-based methods, and model-based methods. [0003] In recent years, center-based clustering algorithms have gradually become a research hotspot. Partition-based methods, such as ...

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
Inventor 程东东黄金龙张素兰李捷桂俊
Owner YANGTZE NORMAL UNIVERSITY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap