Optimization of Identification and Intervention Path of Psychological Problems of Secondary School Students in Cultural Education Based on Dijkstra’s Algorithm
Bibliographic record
Abstract
The recent frequent occurrence of students' psychological crisis events has drawn widespread attention to mental health education in colleges and universities.Based on students' behavioral data, we use big data and data mining technology to model and analyze students' daily behaviors, complete the construction of students' social intimacy features based on Dijkstra's algorithm, use the C4.5 decision tree improvement algorithm based on variable-precision rough set to realize the identification of students' psychological problems, and analyze the intervention paths of students' psychological problems and the evaluation of the results of the intervention.The proposed method can recognize students' psychological problems more accurately, and the recognition accuracy of different levels of psychological problems reaches more than 72%, which is significantly higher than other classification methods.Learning anxiety, loneliness tendency and terror tendency of students in the intervention group were significantly reduced after the psychological intervention (P < 0.05), and the overall factor scores decreased by 9.85%, and the level of mental health was answered to be improved, which reflected the effectiveness of the proposed mental health intervention.The experiment proves that the model in this paper can effectively identify students with psychological abnormalities, and the proposed intervention path for students' psychological problems has a positive impact on the development of students' mental health.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 teacher head, 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".