K-MEANS clustering method and system based on centroid median zone
A clustering method and technology of the intermediate zone, which is applied in the fields of instruments, character and pattern recognition, computer parts, etc., can solve the problems of difficult convergence of data sets, poor control of K value selection, and poor clustering effect, so as to reduce the Overfitting and improving the effect of generalization
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0037] Such as figure 1 Shown, the K-MEANS clustering method based on centroid intermediate band of the present invention, comprises the steps:
[0038] S1: Proposal of the middle zone of the center of mass: the middle zone of the center of mass refers to setting a middle zone along the place where the center of mass swings left and right, that is, the distance difference between the middle zone and each centroid is less than the set threshold, which is set as the minimum recognition threshold Y ;
[0039] Such as figure 2 Shown, S2: the selection of the minimum recognition threshold Y, including the following situations:
[0040] Case 1: Based on the understanding of the data, fixed experience is given, that is, prior experience;
[0041] Case 2: Increment or decrement within a certain range according to the number of iterations of the algorithm;
[0042] Situation 3: The default is biased toward certain categories, that is, preference clustering;
[0043] Such as ima...
Embodiment 2
[0057] The K-MEANS clustering system based on the middle band of the centroid of the present invention comprises the following modules:
[0058] The main control module is used to realize the K-MEANS clustering method based on the centroid median and the main control module of the system;
[0059] A storage control module, used to control the transmission and storage of data;
[0060] And calculate the initialization centroid and the minimum recognition threshold initialization module through the K-MEANS algorithm;
[0061] Calculate the distance from the sample point to each centroid, and the minimum recognition threshold calculation module;
[0062] A centroid update module that updates the centroid by comparing the two classifications with the minimum distance;
[0063] Calculate the distance between the centroids before and after the update, the two classification comparisons of the minimum distance, and the output variance determination module of the centroid middle zon...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com



