MétaCan
Menu
Back to cohort
Record W2134928001 · doi:10.1109/jsyst.2010.2065093

Relational Attribute Integrated Matching Analysis (RAIMA): A Framework for the Design of Self-Adaptive Egocentric Social Networks

2010· article· en· W2134928001 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Systems Journal · 2010
Typearticle
Languageen
FieldComputer Science
TopicOpportunistic and Delay-Tolerant Networks
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsComputer scienceSocial network (sociolinguistics)Matching (statistics)InferenceContext (archaeology)VisualizationOrder (exchange)Social computingSocial network analysisData scienceArtificial intelligenceWorld Wide WebSocial media

Abstract

fetched live from OpenAlex

An emerging research in pervasive computing is the inference of social context to facilitate and mediate communications among proximate people. Understanding users' needs through information reasoning and leveraging principles of social networks play an important role in the emergence of innovative computer-mediated social networks. This paper introduces a generic social networking framework for the analysis and visualization of mobile and spontaneous social networks. The proposed framework is capable of analyzing social scores in order to provide decision support to users in the form of egocentric social graphs. As part of the framework, we introduce a matching algorithm that its efficiency is compared to commonly used “Stable Marriage Matching” algorithms in opportunistic social networks. We show the performance of the algorithm as social profile attributes increase in a network.

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.

Full frame distilled prediction

Teacher imitation

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

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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: Methods · Consensus signal: none
Teacher disagreement score0.885
Threshold uncertainty score0.673

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.051
GPT teacher head0.267
Teacher spread0.216 · 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