Enhancing Tag Recommendation Precision on Stack Overflow Data Warehouse: An Integrated Approach Combining Numeric Attributes, Feature Extraction Techniques, and Multiple Machine Learning Algorithms
Bibliographic record
Abstract
Building upon our previous work on extracting and analyzing Stack Overflow data to uncover trends in programming languages, community contributions, and talent availability, this research investigates the impact of numeric attributes on tag recommendation. Utilizing the Stack Overflow Data Warehouse System developed in our prior study, we conduct a comprehensive analysis of multiple Machine Learning (ML) algorithms to evaluate their effectiveness in recommending tags based on an integration of specific numeric attributes with feature extraction techniques. The methodology involves extracting relevant data, preprocessing it, and applying Term Frequency-Inverse Document Frequency (TF-IDF) as a feature extraction technique alongside diverse ML algorithms, including Support Vector Machines (SVM), Gradient Boosting, Random Forest, and Decision Tree, to assess their performance. Our results indicate that this combination improves evaluation metrics, including F1 Score, Recall, and Precision, with a particularly significant influence on the Precision of tag recommendations, providing insights into the optimization of tagging systems on Q&A platforms. Future research will focus on integrating advanced models and refining data preprocessing techniques to further enhance tag prediction accuracy. This study extends the application of the Stack Overflow Data Warehouse System and contributes to the improvement of tag recommendation mechanisms in online technical communities.
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.005 | 0.014 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.009 | 0.008 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.003 | 0.004 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".