Principal Component Analysis Algorithm and Spatial Mapping Construction for Feature Extraction of University Language Text Data
Bibliographic record
Abstract
With the arrival of the big data era, a huge amount of text data of college language is generated, and how to manage these text data efficiently and mine useful information has become the focus of many scholars.The study first preprocesses and represents the university language text data, proposes a feature screening method based on Shannon entropy and JS-scatter, and then combines the principal component analysis algorithm with the dimensionality reduction of the extracted features on this basis.Subsequently, a pre-trained high-dimensional word vector spatial mapping model is introduced to generate richer semantic representations, and a pre-trained high-dimensional word vector spatial mapping model based on the pre-trained high-dimensional word vector spatial mapping model is designed.Finally, the method proposed in this paper is tested experimentally.Under different feature dimensions, the macro-averages of this paper's method are 72%, 44.2%, 67.1%, and 3.3% higher than those of IG, PMI, ANOVA, and JS methods.At the feature dimension k=350, the macro-mean of this paper's method is 0.853, when the classification effect reaches the optimization.In the spatial mapping relationship of word vectors, the accuracy of the mapping of this paper's method also reaches 11.2% for the words with word frequency sorted from the first 5000 to the first 6000.This proves the effectiveness and feasibility of this paper's method.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.003 | 0.004 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| 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".