MétaCan
Menu
Back to cohort
Record W2558304576 · doi:10.1109/cec.2016.7744350

A study on population adaptation in social networks based on knowledge migration in cultural algorithm

2016· article· en· W2558304576 on OpenAlexaff
Pooya Moradian Zadeh, Mukund Pandey, Ziad Kobti

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldPhysics and Astronomy
TopicComplex Network Analysis Techniques
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsPopulationComputer scienceAsset (computer security)Key (lock)Social network (sociolinguistics)Adaptation (eye)MacroKnowledge transferArtificial intelligenceKnowledge managementComputer securityDemographySociologyWorld Wide Web

Abstract

fetched live from OpenAlex

Networks can be analyzed from different aspects-micro and macro. If we assume that the main asset of each network is its population and the key difference between populations is their knowledge, then it is knowledge that drives the evolution of any network. In this paper, the behavior and status of a network will be analyzed in a case where a population from one network migrates to another similar network and transfers its knowledge to it. In fact, we are going to find how a migrated population will adapt itself to a new environment with similar characteristics based on the knowledge that it has learned from the previous network and what is the role of this prior knowledge in its evolution. For this purpose, different scenarios are modeled by employing a cultural algorithm with various networks and populations on two different cases: a population with migrated knowledge and a population without it. The results clearly show that when the changes in the structure of networks are less than 25%, trained population can adapt itself with the new network very fast but when the difference is higher, in the best case they perform like a random population without any training.

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 imitation

Not 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.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.014
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.005
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.014
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0010.003
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.

Opus teacher head0.030
GPT teacher head0.318
Teacher spread0.288 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations2
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicComplex Network Analysis TechniquesFrench-language works237,207