Browse
Submit Data
Databases
API
Help

Dataset Information

13 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

MATria: a unified centrality algorithm.

ABSTRACT: BACKGROUND:Computing centrality is a foundational concept in social networking that involves finding the most "central" or important nodes. In some biological networks defining importance is difficult, which then creates challenges in finding an appropriate centrality algorithm. RESULTS:We instead generalize the results of any k centrality algorithms through our iterative algorithm MATRIA, producing a single ranked and unified set of central nodes. Through tests on three biological networks, we demonstrate evident and balanced correlations with the results of these k algorithms. We also improve its speed through GPU parallelism. CONCLUSIONS:Our results show iteration to be a powerful technique that can eliminate spatial bias among central nodes, increasing the level of agreement between algorithms with various importance definitions. GPU parallelism improves speed and makes iteration a tractable problem for larger networks.

SUBMITTER: Cickovski T

PROVIDER: S-EPMC6551236 | biostudies-literature | 2019 Jun

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

MATria: a unified centrality algorithm.

Cickovski Trevor T Aguiar-Pulido Vanessa V Narasimhan Giri G

BMC bioinformatics 20190606 Suppl 11

<h4>Background</h4>Computing centrality is a foundational concept in social networking that involves finding the most "central" or important nodes. In some biological networks defining importance is difficult, which then creates challenges in finding an appropriate centrality algorithm.<h4>Results</h4>We instead generalize the results of any k centrality algorithms through our iterative algorithm MATRIA, producing a single ranked and unified set of central nodes. Through tests on three biologica ...[more]

PMID: 31167635

Similar Datasets

ATria: a novel centrality algorithm applied to biological networks.

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

Estimation and update of betweenness centrality with progressive algorithm and shortest paths approximation.

Project description:Betweenness centrality is one of the key measures of the node importance in a network. However, it is computationally intractable to calculate the exact betweenness centrality of nodes in large-scale networks. To solve this problem, we present an efficient CBCA (Centroids based Betweenness Centrality Approximation) algorithm based on progressive sampling and shortest paths approximation. Our algorithm firstly approximates the shortest paths by generating the network centroids according to the adjacency information entropy of the nodes; then constructs an efficient error estimator using the Monte Carlo Empirical Rademacher averages to determine the sample size which can achieve a balance with accuracy; finally, we present a novel centroid updating strategy based on network density and clustering coefficient, which can effectively reduce the computation burden of updating shortest paths in dynamic networks. The experimental results show that our CBCA algorithm can efficiently output high-quality approximations of the betweenness centrality of a node in large-scale complex networks.

| S-EPMC10564764 | biostudies-literature

A Unified Treatment Algorithm and Admission Order Set for Pediatric Acute Pancreatitis.

Project description: Not available

| S-EPMC6534431 | biostudies-literature

Student of Games: A unified learning algorithm for both perfect and imperfect information games.

Project description:Games have a long history as benchmarks for progress in artificial intelligence. Approaches using search and learning produced strong performance across many perfect information games, and approaches using game-theoretic reasoning and learning demonstrated strong performance for specific imperfect information poker variants. We introduce Student of Games, a general-purpose algorithm that unifies previous approaches, combining guided search, self-play learning, and game-theoretic reasoning. Student of Games achieves strong empirical performance in large perfect and imperfect information games-an important step toward truly general algorithms for arbitrary environments. We prove that Student of Games is sound, converging to perfect play as available computation and approximation capacity increases. Student of Games reaches strong performance in chess and Go, beats the strongest openly available agent in heads-up no-limit Texas hold'em poker, and defeats the state-of-the-art agent in Scotland Yard, an imperfect information game that illustrates the value of guided search, learning, and game-theoretic reasoning.

| S-EPMC10651118 | biostudies-literature

Computationally Efficient Implementation of a Novel Algorithm for the General Unified Threshold Model of Survival (GUTS).

Project description:The General Unified Threshold model of Survival (GUTS) provides a consistent mathematical framework for survival analysis. However, the calibration of GUTS models is computationally challenging. We present a novel algorithm and its fast implementation in our R package, GUTS, that help to overcome these challenges. We show a step-by-step application example consisting of model calibration and uncertainty estimation as well as making probabilistic predictions and validating the model with new data. Using self-defined wrapper functions, we show how to produce informative text printouts and plots without effort, for the inexperienced as well as the advanced user. The complete ready-to-run script is available as supplemental material. We expect that our software facilitates novel re-analysis of existing survival data as well as asking new research questions in a wide range of sciences. In particular the ability to quickly quantify stressor thresholds in conjunction with dynamic compensating processes, and their uncertainty, is an improvement that complements current survival analysis methods.

| S-EPMC4920405 | biostudies-literature

AGA algorithm

Project description:Aminoglycosides resistance mechanisms inference algorithm

| PRJEB29576 | ENA

Feature selection with the Fisher score followed by the Maximal Clique Centrality algorithm can accurately identify the hub genes of hepatocellular carcinoma.

Project description:This study aimed to select the feature genes of hepatocellular carcinoma (HCC) with the Fisher score algorithm and to identify hub genes with the Maximal Clique Centrality (MCC) algorithm. Gene Ontology (GO) and Kyoto Encyclopedia of Genes and Genomes (KEGG) enrichment analysis was performed to examine the enrichment of terms. Gene set enrichment analysis (GSEA) was used to identify the classes of genes that are overrepresented. Following the construction of a protein-protein interaction network with the feature genes, hub genes were identified with the MCC algorithm. The Kaplan-Meier plotter was utilized to assess the prognosis of patients based on expression of the hub genes. The feature genes were closely associated with cancer and the cell cycle, as revealed by GO, KEGG and GSEA enrichment analyses. Survival analysis showed that the overexpression of the Fisher score-selected hub genes was associated with decreased survival time (P < 0.05). Weighted gene co-expression network analysis (WGCNA), Lasso, ReliefF and random forest were used for comparison with the Fisher score algorithm. The comparison among these approaches showed that the Fisher score algorithm is superior to the Lasso and ReliefF algorithms in terms of hub gene identification and has similar performance to the WGCNA and random forest algorithms. Our results demonstrated that the Fisher score followed by the application of the MCC algorithm can accurately identify hub genes in HCC.

| S-EPMC6872594 | biostudies-literature

Cycle Based Network Centrality.

Project description:Paths and cycles are the two pivotal elements in a network. Here, we demonstrate that paths, particularly the shortest ones, are incomplete in information network. However, based on such paths, many network centrality measures are designed. While extensive explorations on paths have been made, modest studies focus on the cycles on measuring network centrality. We study the relationship between the shortest cycle and the shortest path from extensive real-world networks. The results illustrate the incompleteness of the shortest paths on measuring network centrality. Noticing that the shortest cycle is much more robust than the shortest path, we propose two novel cycle-based network centrality measures to address the incompleteness of paths: the shortest cycle closeness centrality (SCC) and the all cycle betweenness centrality (ACC). Notwithstanding we focus on the network centrality problem, our findings on cycles can be applied to explain the incompleteness of paths in applications and could improve the applicability into more scenarios where the paths are employed in network science.

| S-EPMC6079107 | biostudies-literature

Nodes having a major influence to break cooperation define a novel centrality measure: game centrality.

Project description:Cooperation played a significant role in the self-organization and evolution of living organisms. Both network topology and the initial position of cooperators heavily affect the cooperation of social dilemma games. We developed a novel simulation program package, called 'NetworGame', which is able to simulate any type of social dilemma games on any model, or real world networks with any assignment of initial cooperation or defection strategies to network nodes. The ability of initially defecting single nodes to break overall cooperation was called as 'game centrality'. The efficiency of this measure was verified on well-known social networks, and was extended to 'protein games', i.e. the simulation of cooperation between proteins, or their amino acids. Hubs and in particular, party hubs of yeast protein-protein interaction networks had a large influence to convert the cooperation of other nodes to defection. Simulations on methionyl-tRNA synthetase protein structure network indicated an increased influence of nodes belonging to intra-protein signaling pathways on breaking cooperation. The efficiency of single, initially defecting nodes to convert the cooperation of other nodes to defection in social dilemma games may be an important measure to predict the importance of nodes in the integration and regulation of complex systems. Game centrality may help to design more efficient interventions to cellular networks (in forms of drugs), to ecosystems and social networks.

| S-EPMC3696096 | biostudies-literature

Perturbation centrality and turbine: a novel centrality measure obtained using a versatile network dynamics tool.

Project description:Analysis of network dynamics became a focal point to understand and predict changes of complex systems. Here we introduce Turbine, a generic framework enabling fast simulation of any algorithmically definable dynamics on very large networks. Using a perturbation transmission model inspired by communicating vessels, we define a novel centrality measure: perturbation centrality. Hubs and inter-modular nodes proved to be highly efficient in perturbation propagation. High perturbation centrality nodes of the Met-tRNA synthetase protein structure network were identified as amino acids involved in intra-protein communication by earlier studies. Changes in perturbation centralities of yeast interactome nodes upon various stresses well recapitulated the functional changes of stressed yeast cells. The novelty and usefulness of perturbation centrality was validated in several other model, biological and social networks. The Turbine software and the perturbation centrality measure may provide a large variety of novel options to assess signaling, drug action, environmental and social interventions.

| S-EPMC3804472 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data