Dynamic Relationship Network Analysis Based on Louvain Algorithm for Large-Scale Group Decision Making
Bibliographic record
Abstract
large-scale group decision making consensus reaching process dynamic relationship network Louvain algorithm node centrality subgroup cohesion A B S T R A C TIn most existing large-scale group decision making (LSGDM) problems, the relationships between decision makers (DMs) are usually ignored or regarded as static.However, in many cases, the results of LSGDM are dynamically influenced by the relationship between group members.To address this issue, a dynamic relationship network analysis method based on Louvain algorithm is proposed in this paper.First, each DM could be considered as a node to construct a relationship network, which dynamically change the individual opinion by the definition of correction index to eliminate subjective factors.Second, the node centrality and subgroup cohesion are defined and the Louvain algorithm is used to divide DMs into several subgroups to measure the importance of each node and subgroup.Then, the termination conditions of the discussion are determined by measuring the consensus and stability of the group decision information.Moreover, stage weight function is defined to assign weights to discussions at different stages and obtain the final results.An illustrative example is provided to prove the feasibility of the proposed model.Sensitivity analysis is given to show the stability of correction index and stage weight function.Finally, the comparative analysis is performed to illustrate its feasibility and effectiveness of the 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.004 | 0.009 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.002 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 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".