Subject selection recommendation method based on K-clustering algorithm
A technology of clustering algorithm and recommendation method, applied in the field of information, can solve problems such as inability to recommend subjects in a targeted and purposeful manner, and achieve the effect of facilitating analysis and calculation, avoiding singularity, and avoiding blindness and helplessness.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0050] The present invention provides a subject selection and recommendation method based on K-clustering algorithm, such as figure 1 As shown, the method includes the following steps:
[0051] Obtain personal information of survey respondents;
[0052] S2: Transform the personal information into sample data y i , forming the sample data set Y;
[0053] S3: For sample data y i Perform preprocessing to obtain preprocessed sample data x i ;
[0054] S4: Use the K-means++ algorithm to analyze the preprocessed sample data, and select k initial cluster centers;
[0055] S5: Calculate the Euclidean distance between each preprocessed sample data and each initial cluster center, and assign each preprocessed sample data to the nearest initial cluster center according to the minimum distance principle;
[0056] S6: After the allocation is completed, calculate the mean point of the Euclidean distance from the preprocessed sample data allocated in each initial cluster center to the ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


