MétaCan
Menu
Back to cohort
Record W2091638386 · doi:10.1109/icdmw.2011.12

A Diffusion of Innovation-Based Closeness Measure for Network Associations

2011· article· en· W2091638386 on OpenAlexaff
Reihaneh Rabbany Khorasgani, Osmar R. Zai͏̈ane

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldPhysics and Astronomy
TopicComplex Network Analysis Techniques
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsClosenessMeasure (data warehouse)Intersection (aeronautics)Computer scienceContext (archaeology)Data scienceData miningNetwork scienceRepresentation (politics)BibliometricsCentralityCommunity structureEvent (particle physics)Network analysisTheoretical computer scienceComplex networkMathematicsWorld Wide WebGeographyStatisticsEngineering

Abstract

fetched live from OpenAlex

Network association is a prevalent representation when dealing with data from present-day applications. Examples are crime event connections in criminology, cellphone call graphs in telecommunication, co-authorship networks in bibliometrics, etc. A large body of work has been devoted to the analysis of these networks and the discovery of their underlying structures. One important structure is the notion of community i.e. a group of nodes that are relatively cohesive within and reasonably disjointed outside. Finding the communities usually relies on a closeness/distance measure between network nodes. In this paper, we propose a novel closeness measure, named iCloseness, inspired by the theory of Diffusion of Innovations in anthropology. It is computed based on the intersection of neighbourhoods and quantifies the closeness of two nodes. To apply this measure we adjusted the Top Leaders community mining method to use this measure for community detection. Experimental results on real world and synthesized information networks show the effectiveness of our proposed measure and highly motivate the application of the iCloseness measure in the context of community mining.

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.004
metaresearch head score (Gemma)0.032
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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.011
Threshold uncertainty score0.020

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.032
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0110.009
Science and technology studies0.0010.002
Scholarly communication0.0030.007
Open science0.0020.003
Research integrity0.0020.002
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.045
GPT teacher head0.276
Teacher spread0.230 · 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
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

Citations4
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicComplex Network Analysis TechniquesFrench-language works237,207