Identification of substructures in complex networks using formal concept analysis
Bibliographic record
Abstract
Purpose In recent years, the increasing complexity of the hyper-connected world demands new approaches for social network analysis. The main challenges are to find new computational methods that allow the representation, characterization and analysis of these social networks. Nowadays, formal concept analysis (FCA) is considered an alternative to identifying conceptual structures in a social network. In this FCA-based work, this paper aims to show the potential of building computational models based on implications to represent and analyze two-mode networks. Design/methodology/approach This study proposes an approach to find three important substructures in social networks such as conservative access patterns, minimum behavior patterns and canonical access patterns. The present study approach considered as a case study a database containing the access logs of a cable internet service provider. Findings The result allows us to uncover access patterns, conservative access patterns and minimum access behavior patterns. Furthermore, through the use of implications sets, the relationships between event-type elements (websites) in two-mode networks are analyzed. This paper discusses, in a generic form, the adopted procedures that can be extended to other social networks. Originality/value A new approach is proposed for the identification of conservative behavior in two-mode networks. The proper implications needed to handle minimum behavior pattern in two-mode networks is also proposed to be analyzed. The one-item conclusion implications are easy to understand and can be more relevant to anyone looking for one particular website access pattern. Finally, a method for a canonical behavior representation in two-mode networks using a canonical set of implications (steam base), which present a minimal set of implications without loss of information, is proposed.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.009 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.004 | 0.003 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".