Augmenting Document Classification Accuracy Through the Integration of Deep Contextual Embeddings
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Document classification, a fundamental process within the field of natural language processing, has benefitted from the recent advancements in deep learning, particularly in enhancing accuracy.Traditional text clustering methods, such as bag-of-words models, exhibit domain specificity and struggle to handle vast data volumes.They also face limitations in elucidating sophisticated patterns and intricate word and phrase relationships within textual data.These constraints may adversely affect the accuracy of text clustering, subsequently impacting downstream applications like information retrieval, document classification, and natural language processing.This paper proposes a novel text classification model, termed Deep Contextual Embeddings Model (DCEM), designed to improve document classification accuracy.The DCEM integrates pre-trained deep contextual embedding architectures (e.g., GPT-2) with text clustering algorithms (e.g., K-Means).It employs contextual embedding models to enhance document clustering accuracy by capturing context and semantic depth, improving data structure comprehension, and eliminating noise for more precise results.Experimental results, derived from the application of DCEM on AG News, Reuters-21578, and IMDB reviews datasets, indicate a significant improvement in document classification accuracy (81.09%), compared to traditional text clustering and document classification methods.
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.
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.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.010 |
| Open science | 0.001 | 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 it