Interactive Mining of Strong Friends from Social Networks and Its Applications in E-Commerce
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.
Bibliographic record
Abstract
Social networks are generally made of individuals who are linked by some types of interdependencies such as friendship. Most individuals in social networks have many linkages in terms of friends, connections, and/or followers. Among these linkages, some of them are stronger than others. For instance, some friends may be acquaintances of an individual, whereas others may be friends who care about him or her (e.g., who frequently post on his or her wall). In this study, we integrate data mining with social computing to form a social network mining algorithm, which helps the individual distinguish these strong friends from a large number of friends in a specific portion of the social networks in which he or she is interested. Moreover, our mining algorithm allows the individual to interactively change his or her mining parameters. Furthermore, we discuss applications of our social mining algorithm to organizational computing and e-commerce
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it