A Distributed HOSVD Method With Its Incremental Computation for Big Data in Cyber-Physical-Social Systems
Bibliographic record
Abstract
Cyber-physical-social systems (CPSS), integrating cyber, physical, and social spaces together, bring both conveniences and challenges to humans. For practical applications and user convenience, it is essential that the Big Data produced in CPSS be processed in real time. Therefore, Big Data computation should avoid redundant computations on historical data when dealing with periodic incoming data. In this paper, we propose a columnwise high-order singular value decomposition (HOSVD) algorithm to realize dimensionality reduction, extraction, and noise reduction for tensor-represented Big Data. First, the distributed HOSVD (DHOSVD) is proposed using the columnwise Jacobi-based approach to realize the distributed computation of HOSVD. Second, big streaming data are continuously produced and the intermediate results could be recorded for the next computational step. Third, we propose a similar columnwise incremental HOSVD (IHOSVD) scheme to support online computation on temporally incremental data streaming. The performance of the two HOSVD-based schemes will illustrate the scalability of our efficient real-time Big Data processing 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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| 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.002 | 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 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".