MétaCan
Menu
Back to cohort
Record W4256380542 · doi:10.3233/ida-120564

Guest Editorial

2013· editorial· es· W4256380542 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.

fundA Canadian funder is recorded on the work.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueIntelligent Data Analysis · 2013
Typeeditorial
Languagees
FieldPhysics and Astronomy
TopicComplex Network Analysis Techniques
Canadian institutionsnot available
FundersUniversity of Illinois at Urbana-ChampaignUniversidade Federal de Minas GeraisKU LeuvenUniversità degli Studi di PaviaInstitut National des Sciences Appliquées de LyonInstitute of GeneticsIndian National Science Academy
KeywordsPolitical science

Abstract

fetched live from OpenAlex

Modeling and analyzing networks is a major emerging topic in different research areas, such as computational biology, social science, document retrieval and social web applications.By connecting objects, it is possible to obtain an intuitive and global view of the relationships among components of a complex system.Nowadays, scientific communities have access to huge volume of network-structured data, such as social networks, gene/proteins/metabolic networks, sensor networks, and peer-to-peer networks.Often, data is collected at different time points allowing capturing a dynamic trend of the observed network.Consequently, the time component plays a key role in the comprehension of the evolutionary behavior of the studied network (evolution of the network structure and/or of flows within the system).Time can help to determine the real causal relationships within, for instance, gene activations, link creation, and information flow.Handling such data is a major challenge for current research in machine learning and data mining, and it has led to the development of recent innovative techniques that consider complex/multi-level networks, time-evolving graphs, heterogeneous information (nodes and links), and requires scalable algorithms that are able to manage large-scale complex networks.This special issue is the follow-up of the Dynamic Networks and Knowledge Discovery workshop (DyNaK) 1 that has been held in conjunction to ECML-PKDD 2011 at Barcelona on September 24th 2011.The workshop was motivated by the interest of providing a meeting point for scientists with different backgrounds who are interested in the study of large-scale dynamic complex networks.The workshop has attracted 18 submissions out of which 9 papers has been accepted.The workshop has gathered more than 30 participants and was also the host of three highly appreciated invited keynotes and one industrial talk.Building on the success of the DyNaK workshop, an open call for papers has been issued for this special issue, focusing on the major topic discussed in the workshop: analyzing, modeling and mining large-scale real network.15 high quality papers have been received; each of which has been reviewed by three reviewers.Only 7 contributions were finally selected.These contributions show the vitality of the field: a broad panel of techniques are applied to modeling the dynamics of complex systems, using a wide set of formalisms ranging from descriptive rules to Probabilistic Real-Time Automata.Application fields are also wide: vision, opinion diffusion in social network, business process modeling and text mining.In Internal link prediction: a new approach for predicting links in bipartite graphs, Allali et al. present an algorithm for predicting internal link in bipartite graph.They address the problem of predicting

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.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Scholarly communication, Open science, Research integrity, Insufficient payload (model declined to judge)
Consensus categoriesMeta-epidemiology (narrow), Research integrity, Insufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Editorial · Consensus signal: Editorial
Teacher disagreement score0.158
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0020.002
Meta-epidemiology (broad)0.0040.002
Bibliometrics0.0020.005
Science and technology studies0.0000.000
Scholarly communication0.0020.001
Open science0.0090.005
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0070.006

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.330
Teacher spread0.300 · 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