Deep Fusion of Multiple Networks for Learning Latent Social Communities
Bibliographic record
Abstract
The rapid development of techniques results in a growing diversity of social network data which require for analysis. Therefore, the deeper understanding of latent knowledge representing the social network data needs learning by combining the insights obtained from multiple, diverse networks carrying heterogeneous information featuring the interrelationship between vertices. In this manuscript, we propose a novel deepmodel- based approach to learn latent structural representation from multi-domain social network data. The algorithm, which we call Deep Multiple Networks Fusion (DMNF), is able to discover an aggregated deep representation, by taking into consideration multiple networks, which represent heterogeneous information carried by the social network data. To perform the task, DMNF first constructs a network representing the total degree of interrelationship between pairwise vertices by utilizing a fusion method to compute such degree taking into consideration heterogeneous information embedded in the network data, e.g., node connection, and attribute relativity. Given the fused network data, DMNF attempts to learn the latent network representation making use of a deep neural network model. Such learned representation is able to reveal the latent structure, e.g., social communities, and clusters in the social network. DMNF has been tested with two sets of real social network data and compared with several prevalent approaches to network community detection. The experimental results show that the latent representation found by DMNF may match well with the ground-truth communities and DMNF is able to outperform the state-of-the-art approaches to detecting social network communities.
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.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.004 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| 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".