Parallelization method for DENCLUE algorithm
An algorithm and computing node technology, applied in the field of parallelization of the DENCLUE algorithm, can solve problems that are difficult to adapt to large-scale data clustering analysis scenarios
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0027] In order to make the object, technical solution and advantages of the present invention more clear and definite, the present invention will be further described in detail below with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described here are only used to explain the present invention, not to limit the present invention.
[0028] The overall flow framework of the present invention is as follows figure 1 As shown, the flow chart of data mapping and grid division represented by steps S1-S3 is as follows figure 2 shown.
[0029] S1: Divide the original data, and divide the original data into the same number of data blocks according to the number of computing nodes.
[0030] S11: According to the number n of computing nodes, the original data set is divided into n sub-data sets on average from the starting position, and sent to each node in the form of subseti for simple sampling, and each sampling generate...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com