MétaCan
Menu
Back to cohort
Record W2053553533 · doi:10.1145/1286240.1286291

Identifying subcommunities using cohesive subgroups in social hypertext

2007· article· en· W2053553533 on OpenAlexaffabout
Alvin Chin, Mark Chignell

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldPhysics and Astronomy
TopicComplex Network Analysis Techniques
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsHyperlinkHypertextWorld Wide WebComputer scienceSense of communityThe InternetGroup (periodic table)Connection (principal bundle)Social network (sociolinguistics)Web pagePsychologySocial mediaMathematicsSocial psychology

Abstract

fetched live from OpenAlex

Web pages can be modeled as nodes in a social network, and hyperlinks between pages form links (relationships) between the nodes. Links may take the form of comments, for example on blogs, creating explicit connections between authors and readers. In this paper, we describe a novel methodology and framework for identifying subcommunities as cohesive subgroups of n-cliques and k-plexes within social hypertext. We apply our methodology to a group of computer technologists in Toronto called TorCamp who communicate using a Google group. K-plex analysis is then used to identify a group of people that forms a subcommunity within the larger community. The results are then validated against the experienced sense of community of people inside and outside the subcommunity. Statistically significant differences in experienced sense of community are found, with people within the subcommunity showing higher levels of perceived influence and emotional connection.

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 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.000
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: Observational · Consensus signal: Observational
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.268
Threshold uncertainty score0.709

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.061
GPT teacher head0.337
Teacher spread0.276 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designObservational
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

Citations13
Published2007
Admission routes2
Has abstractyes

Explore more

Same topicComplex Network Analysis TechniquesFrench-language works237,207