An Improved Reconstruction-Based Multiattribute Contrastive Learning for Digital-Twin-Enabled Industrial System
Bibliographic record
Abstract
Digital twin (DT) is a promising technology for responding to Industry 4.0 and realizing comprehensive automation and virtualization. In the Web3.0-powered 5G/6G era, the expansion of the industrial data and closer interaction among cross-industrial entities pose new security challenges for DT industrial systems. As a prevalent computing paradigm, Graph Anomaly Detection provides an effective solution to ensure the security of DT industrial systems. However, the existing unsupervised graph anomaly detection methods tend to treat multiple graph attributes in isolation during the reconstruction process, resulting in insufficient semantics and suboptimal reconstruction performance. To overcome these challenges, we propose a multiattribute contrastive learning framework, which realizes graph anomaly detection by capturing both graph attribute patterns and their hidden relationships. First, we use an improved multiattribute aligned reconstruction approach to represent the anomaly information effectively. Besides that, the positive instance aggregation-based contrastive constraints are proposed, which can reduce the loss generated by mappings between different data dimension in feature representation space. Finally, to verify our proposal, extensive experiments have been conducted on five benchmark datasets, and the results show that our method obtains the state-of-the-art performance.
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 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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".