Feature Extraction of High-dimensional Data Based on J-HOSVD for Cyber-Physical-Social Systems
Bibliographic record
Abstract
With the further integration of Cyber-Physical-Social systems (CPSSs), there is explosive growth of the data in CPSSs. How to discover effective information or knowledge from CPSSs big data and provide support for subsequent learning tasks has become a core issue. Moreover, modern applications in CPSSs increasingly rely on the processing and analysis of high-dimensional data; the correlation and internal structure of these high-dimensional data are gradually becoming more complex, which further makes traditional machine learning algorithms a little inadequate in processing these data. In this article, we propose two general dimension reduction and feature extraction methods for high-dimensional data based on joint tensor decomposition, namely core feature extraction methods and factor feature extraction methods, which can effectively mine out the common components and hidden patterns of high-dimensional data by joint analysis while maintaining the original data structure. We also verified the effectiveness of the methods from both theoretical and practical aspects. Furthermore, we extend the two feature extraction methods to the tensor distance scenario and illustrate that the compressed features extracted by our models can keep the global information of original data well. Finally, we evaluated proposed methods on two benchmark datasets through classification tasks, and experimental results show that the low-dimensional features extracted by the proposed models have higher classification accuracy than the direct classification of the original data, which further verifies the effectiveness and robustness of our 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.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| 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.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".