UI Design Optimization Method Based on User Behavior Analysis – Based on Heat Map Analysis, K-means Clustering, and Random Forest Regression Analysis Algorithms
Bibliographic record
Abstract
In today's digital era, user interface (UI) design is crucial for enhancing user experience and strengthening user engagement.The study uses heatmap analysis, K-means clustering algorithm and random forest regression algorithm to comprehensively analyze the characteristics of user behavior in UI pages.The predicted results of user behavior in UI pages are visualized and analyzed through heatmaps.Cluster classes are divided according to user behavioral characteristics to generate user profiles with the same behavior.Combine Random Forest and Logistic regression algorithm to get the key indexes of UI optimization design and predict their impact on user behavior experience.The research results show that the MAE and SMAPE values of Random Forest regression algorithm on user behavior prediction are 133.55 and 8.18%, respectively, with an R² of 0.96, and the accuracy rate of behavior prediction is more than 80%, which shows a good performance of user behavior prediction.The clustering algorithm divides the user behavioral characteristics into 6 clusters based on their behavioral characteristics, including cluster class 1 (browsing and exploring class), which accounts for 11.5% of the number of investigators.The weight of the top 8 of the importance of UI optimization design obtained by the random forest regression analysis algorithm is 70.26%.And the user behavior experience can be improved by 5.377~9.925times when each element is improved by one unit.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.006 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".