MétaCan
Menu
Back to cohort
Record W2263890399 · doi:10.1145/2808797.2809310

Spectral Embedding of Directed Networks

2015· article· en· W2263890399 on OpenAlexaff
Q. Zheng, David B. Skillicorn

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldPhysics and Astronomy
TopicComplex Network Analysis Techniques
Canadian institutionsQueen's University
Fundersnot available
KeywordsBetweenness centralityEmbeddingDirected graphComputer scienceNode (physics)Theoretical computer scienceStrengths and weaknessesEnhanced Data Rates for GSM EvolutionProperty (philosophy)MathematicsArtificial intelligenceAlgorithmCombinatoricsEngineeringEpistemology

Abstract

fetched live from OpenAlex

Most relationships in a social network have an element of asymmetry: the strength of A's relationship to B need not be the same as B's to A; and relationships that are based on power or influence have a natural flow associated with them. It is therefore natural to model many kinds of social networks by directed graphs, with a node corresponding to each participant, and a weighted directed edge to each relationship. Spectral embeddings for directed graphs are known, but they have significant weaknesses. We design a new directed-graph embedding, show that its mathematical properties are appropriate, and demonstrate its application to some synthetic and real-world networks. As well as avoiding the weaknesses of known techniques, the new embedding also represents a property we call flow betweenness of each node, allowing for directed edge prediction.

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.001
metaresearch head score (Gemma)0.007
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.003
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.007
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0020.001
Science and technology studies0.0000.001
Scholarly communication0.0010.003
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.001

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.019
GPT teacher head0.285
Teacher spread0.266 · 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 designTheoretical or conceptual
Domainnot available
GenreMethods

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

Citations7
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicComplex Network Analysis TechniquesFrench-language works237,207