A novel state space reduction algorithm for team formation in social networks.
Ontology highlight
ABSTRACT:
SUBMITTER: Rehman MZ
PROVIDER: S-EPMC8638979 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:We examine whether social data can be used to predict how members of Major League Baseball (MLB) and members of the National Basketball Association (NBA) transition between teams during their career. We find that incorporating social data into various machine learning algorithms substantially improves the algorithms' ability to correctly determine these transitions in the NBA but only marginally in MLB. We also measure the extent to which player performance and team fitness data can be used to predict transitions between teams. This data, however, only slightly improves our predictions for players for both basketball and baseball players. We also consider whether social, performance, and team fitness data can be used to infer past transitions. Here we find that social data significantly improves our inference accuracy in both the NBA and MLB but player performance and team fitness data again does little to improve this score.
| S-EPMC9231699 | biostudies-literature
Project description:<p><font color="#FF0000"><b>Note: Data Use Restrictions:</b> <ul> <li>The data <i><u>must only</u></i> be used for genetic research projects solely in the area of health-related social-network research.</li> </ul> </font> </p> <p>This study compiles detailed information on family and social ties linked to participants in the offspring cohort of the Framingham Heart Study. The investigators took computerized information from self-report data used by the FHS for over 30 years to facilitate health exam scheduling. These tracking sheets asked participants to identify people close to them, which were assumed by the investigators to indicate a social tie. Individuals are listed as "egos" (if the ties are from their perspective) and/or "alters" (if they are linked as a friend or family members to one of the other participants). All egos were FHS offspring participants while alters could be FHS participants in any cohort or non-participants. This information was combined with internal FHS pedigree data on family ties to list family member alters (as well as the nature of their relationship). The resultant dataset therefore includes each ego-alter tie, the nature of their relationship and the start and end dates for their ties for each of seven waves for the offspring study.</p> <p>Due to privacy concerns, all exam dates for individuals are listed relative to the initial FHS exam date. The study investigators chose a random, confidential date, to which all initial exam dates are linked (by number of months from random date to initial exam date). With this information, researchers can have access to the temporal relationships among participants' exam dates while remaining unaware of the actual exam dates for individual participants.</p> <p>During each clinic exam cycle, the participants undergo a detailed examination including physical examination, medical history, laboratory testing, and electrocardiogram. Over the years, other tests (that may not be performed at every exam cycle) have included pulmonary function, lifestyle, physical function, cognitive function questionnaires, and various noninvasive cardiovascular tests including echocardiograms. This study involves phenotypic data from these exams including (when available) basic body measurements (height, weight, blood pressure), laboratory values (blood sugar levels, LDL levels), information on smoking and alcohol use, and tests of depression and cognitive functioning.</p> <p><b>Important links to apply for individual-level data</b> <ol> <li><a href="http://dbgap.ncbi.nlm.nih.gov/aa/wga.cgi?view_pdf&stacc=phs000153.v3.p3" target="_blank">Data Use Certification Requirements (DUC)</a></li> <li><a href="GetPdf.cgi?id=phd001183.1" target="_blank">Instructions to Request Authorized Access</a></li> <li><a href="http://view.ncbi.nlm.nih.gov/dbgap-controlled" target="_blank">Apply here for controlled access to individual level data</a></li> <li><a href="GetPdf.cgi?id=phd000317" target="_blank">Participant Protection Policy FAQ</a></li> </ol> </p> <p>In 1948, researchers recruited men and women from the town of Framingham, Massachusetts, beginning the first round of extensive physical examinations and lifestyle interviews that would later be analyzed for common patterns related to CVD development.</p> <p>Initially, the Framingham Heart Study enrolled 5,209 men and women from the Framingham area who were between the ages of 28 and 62 years. Beginning in 1971, the Framingham Heart Study enrolled 5,124 men and women, who were either offspring of the original cohort or spouses of those offspring. In 2002, 4,095 third generation participants (men and women) were enrolled.</p>
| phs000153.v5.p5 | EGA
Project description:This trial examines cancer communication within Hispanic social networks. Hispanics have the lowest colorectal cancer screening rate of any major ethnic group and health interventions are crucially needed among Hispanics. Patient decision aids are health communication interventions designed to provide patients with targeted health information and have shown to improve colorectal cancer screening rates among Hispanics. The goal of this study is to investigate, in a sample of Hispanics, how a colorectal cancer decision aid aimed at increasing individuals’ colorectal cancer screening behavior has effects on their alters’ intention to get screened for colorectal cancer.
| 2343521 | ecrin-mdr-crc
Project description:MotivationA key goal of studying biological systems is to design therapeutic intervention strategies. Probabilistic Boolean networks (PBNs) constitute a mathematical model which enables modeling, predicting and intervening in their long-run behavior using Markov chain theory. The long-run dynamics of a PBN, as represented by its steady-state distribution (SSD), can guide the design of effective intervention strategies for the modeled systems. A major obstacle for its application is the large state space of the underlying Markov chain, which poses a serious computational challenge. Hence, it is critical to reduce the model complexity of PBNs for practical applications.ResultsWe propose a strategy to reduce the state space of the underlying Markov chain of a PBN based on a criterion that the reduction least distorts the proportional change of stationary masses for critical states, for instance, the network attractors. In comparison to previous reduction methods, we reduce the state space directly, without deleting genes. We then derive stationary control policies on the reduced network that can be naturally induced back to the original network. Computational experiments study the effects of the reduction on model complexity and the performance of designed control policies which is measured by the shift of stationary mass away from undesirable states, those associated with undesirable phenotypes. We consider randomly generated networks as well as a 17-gene gastrointestinal cancer network, which, if not reduced, has a 2(17) × 2(17) transition probability matrix. Such a dimension is too large for direct application of many previously proposed PBN intervention strategies.
| S-EPMC3025721 | biostudies-literature
Project description:Despite the well-documented benefits of working in teams, teamwork also results in communication, coordination and management costs, and may lead to personal conflict between team members. In a context where teams play an increasingly important role, it is of major importance to understand conflict and to develop diagnostic tools to avert it. Here, we investigate empirically whether it is possible to quantitatively predict future conflict in small teams using parameter-free models of social network structure. We analyze data of conflict appearance and resolution between 86 team members in 16 small teams, all working in a real project for nine consecutive months. We find that group-based models of complex networks successfully anticipate conflict in small teams whereas micro-based models of structural balance, which have been traditionally used to model conflict, do not.
| S-EPMC3683702 | biostudies-literature
Project description:BackgroundBiomolecular networks dynamically respond to stimuli and implement cellular function. Understanding these dynamic changes is the key challenge for cell biologists. As biomolecular networks grow in size and complexity, the model of a biomolecular network must become more rigorous to keep track of all the components and their interactions. In general this presents the need for computer simulation to manipulate and understand the biomolecular network model.ResultsIn this paper, we present a novel method to model the regulatory system which executes a cellular function and can be represented as a biomolecular network. Our method consists of two steps. First, a novel scale-free network clustering approach is applied to the large-scale biomolecular network to obtain various sub-networks. Second, a state-space model is generated for the sub-networks and simulated to predict their behavior in the cellular context. The modeling results represent hypotheses that are tested against high-throughput data sets (microarrays and/or genetic screens) for both the natural system and perturbations. Notably, the dynamic modeling component of this method depends on the automated network structure generation of the first component and the sub-network clustering, which are both essential to make the solution tractable.ConclusionExperimental results on time series gene expression data for the human cell cycle indicate our approach is promising for sub-network mining and simulation from large-scale biomolecular network.
| S-EPMC2213691 | biostudies-literature
Project description:The notion of centrality is used to identify "important" nodes in social networks. Importance of nodes is not well-defined, and many different notions exist in the literature. The challenge of defining centrality in meaningful ways when network edges can be positively or negatively weighted has not been adequately addressed in the literature. Existing centrality algorithms also have a second shortcoming, i.e., the list of the most central nodes are often clustered in a specific region of the network and are not well represented across the network.We address both by proposing Ablatio Triadum (ATria), an iterative centrality algorithm that uses the concept of "payoffs" from economic theory.We compare our algorithm with other known centrality algorithms and demonstrate how ATria overcomes several of their shortcomings. We demonstrate the applicability of our algorithm to synthetic networks as well as biological networks including bacterial co-occurrence networks, sometimes referred to as microbial social networks.We show evidence that ATria identifies three different kinds of "important" nodes in microbial social networks with different potential roles in the community.
| S-EPMC5471957 | biostudies-literature
Project description:The hippocampus supports a cognitive map of space and is critical for encoding declarative memory (who, what, when and where). Recent studies have implicated hippocampal subfield CA2 in social and contextual memory but how it does so remains unknown. Here we find that in adult male rats, presentation of a social stimulus (novel or familiar rat) or a novel object induces global remapping of place fields in CA2 with no effect on neuronal firing rate or immediate early gene expression. This remapping did not occur in CA1, suggesting this effect is specific for CA2. Thus, modification of existing spatial representations might be a potential mechanism by which CA2 encodes social and novel contextual information.
| S-EPMC4737730 | biostudies-literature
Project description:Faces transmit a wealth of social information. How this information is exchanged between face-processing centers and brain areas supporting social cognition remains largely unclear. Here we identify these routes using resting state functional magnetic resonance imaging in macaque monkeys. We find that face areas functionally connect to specific regions within frontal, temporal, and parietal cortices, as well as subcortical structures supporting emotive, mnemonic, and cognitive functions. This establishes the existence of an extended face-recognition system in the macaque. Furthermore, the face patch resting state networks and the default mode network in monkeys show a pattern of overlap akin to that between the social brain and the default mode network in humans: this overlap specifically includes the posterior superior temporal sulcus, medial parietal, and dorsomedial prefrontal cortex, areas supporting high-level social cognition in humans. Together, these results reveal the embedding of face areas into larger brain networks and suggest that the resting state networks of the face patch system offer a new, easily accessible venue into the functional organization of the social brain and into the evolution of possibly uniquely human social skills.
| S-EPMC4562659 | biostudies-literature
Project description:Stochasticity plays important roles in many molecular networks when molecular concentrations are in the range of 0.1 muM to 10nM (about 100 to 10 copies in a cell). The chemical master equation provides a fundamental framework for studying these networks, and the time-varying landscape probability distribution over the full microstates, i.e., the combination of copy numbers of molecular species, provide a full characterization of the network dynamics. A complete characterization of the space of the microstates is a prerequisite for obtaining the full landscape probability distribution of a network. However, there are neither closed-form solutions nor algorithms fully describing all microstates for a given molecular network.We have developed an algorithm that can exhaustively enumerate the microstates of a molecular network of small copy numbers under the condition that the net gain in newly synthesized molecules is smaller than a predefined limit. We also describe a simple method for computing the exact mean or steady state landscape probability distribution over microstates. We show how the full landscape probability for the gene networks of the self-regulating gene and the toggle-switch in the steady state can be fully characterized. We also give an example using the MAPK cascade network. Data and server will be available at URL: http://scsb.sjtu.edu.cn/statespace.Our algorithm works for networks of small copy numbers buffered with a finite copy number of net molecules that can be synthesized, regardless of the reaction stoichiometry, and is optimal in both storage and time complexity. The algorithm can also be used to calculate the rates of all transitions between microstates from given reactions and reaction rates. The buffer size is limited by the available memory or disk storage. Our algorithm is applicable to a class of biological networks when the copy numbers of molecules are small and the network is closed, or the network is open but the net gain in newly synthesized molecules does not exceed a predefined buffer capacity. For these networks, our method allows full stochastic characterization of the mean landscape probability distribution, and the steady state when it exists.
| S-EPMC2375859 | biostudies-literature