Data clustering method and system and storage medium
A clustering method and data clustering technology, applied in other database clustering/classification, other database retrieval, other database indexing, etc., can solve the problems of lack of integrity and universal applicability of traditional clustering algorithms, and achieve practicality High, improved expression efficiency, and complete clustering results
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0067] Embodiment 1 of the present invention provides a data clustering method, such as figure 1 shown, including the following steps:
[0068] (1) Determine the data clustering conditions, including the following steps:
[0069] Identify factors that affect the similarity between data;
[0070] Determine the data dimension concerned by data clustering from many factors;
[0071] Determine the combination relationship of different dimension data;
[0072] Determine the clustering condition of the data according to the combination relationship of each dimension data.
[0073] The data clustering condition is determined based on the similarity between data, and the similarity between data is often affected by factors in multiple dimensions. Therefore, the data clustering condition in Embodiment 1 of the present invention is based on the following combinations of different dimensional data Relationships cluster data as follows:
[0074] (v 1 ,v 2 ,v 3 ,...,v j ),
[007...
Embodiment 2
[0094] HSV is a color space created according to the intuitive characteristics of color, also known as the hexagonal cone model. The parameters of the color in this model are: hue (h), saturation (s), lightness (v), and the value ranges are respectively It is: H: 0~180, S: 0~255, V: 0~255, the image is composed of several data points, each data point has h value, s value, v value.
[0095] Such as figure 2 As shown, Embodiment 2 of the present invention provides a data clustering method, for the data of 12 scattered and disordered data points: the hue h value, clustering is performed by the following method, including the following steps:
[0096] (1) Determine the conditions for data clustering, specifically:
[0097] The similarity between the data in this embodiment is only affected by one dimension: the difference Δh between the hue h values, so the condition for data clustering in this embodiment is to cluster the data according to Δh:
[0098] v 1 =Δh={a m1}=a 11 ,...
Embodiment 3
[0124] Such as Figure 7 As shown, the third embodiment of the present invention provides a data clustering method, for the data of 11 ordered data points in the Cartesian coordinate system: hue h value, x coordinate value, y coordinate value, clustering is performed by the following method , including the following steps:
[0125] (1) Determine the conditions for data clustering, specifically:
[0126] The similarity between the data in the third embodiment of the present invention is jointly affected by factors in two dimensions: the difference Δh between the hue h values, and the difference Δx between the x coordinate values, so the data clustering in the third embodiment of the present invention The condition is to cluster the data according to the combination relationship of Δh and Δx:
[0127] (v 1 ,v 2 ),
[0128] v 1 =Δh,
[0129] v 2 =Δx;
[0130] In the third embodiment of the present invention, the dimension data concerned by data clustering is Δh, and the ...
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



