Gaussian interaction profile kernels for predicting drug-target interaction.

Science.gov (United States)

van Laarhoven, Twan; Nabuurs, Sander B; Marchiori, Elena

2011-11-01

The in silico prediction of potential interactions between drugs and target proteins is of core importance for the identification of new drugs or novel targets for existing drugs. However, only a tiny portion of all drug-target pairs in current datasets are experimentally validated interactions. This motivates the need for developing computational methods that predict true interaction pairs with high accuracy. We show that a simple machine learning method that uses the drug-target network as the only source of information is capable of predicting true interaction pairs with high accuracy. Specifically, we introduce interaction profiles of drugs (and of targets) in a network, which are binary vectors specifying the presence or absence of interaction with every target (drug) in that network. We define a kernel on these profiles, called the Gaussian Interaction Profile (GIP) kernel, and use a simple classifier, (kernel) Regularized Least Squares (RLS), for prediction drug-target interactions. We test comparatively the effectiveness of RLS with the GIP kernel on four drug-target interaction networks used in previous studies. The proposed algorithm achieves area under the precision-recall curve (AUPR) up to 92.7, significantly improving over results of state-of-the-art methods. Moreover, we show that using also kernels based on chemical and genomic information further increases accuracy, with a neat improvement on small datasets. These results substantiate the relevance of the network topology (in the form of interaction profiles) as source of information for predicting drug-target interactions. Software and Supplementary Material are available at http://cs.ru.nl/~tvanlaarhoven/drugtarget2011/. tvanlaarhoven@cs.ru.nl; elenam@cs.ru.nl. Supplementary data are available at Bioinformatics online.

A network integration approach for drug-target interaction prediction and computational drug repositioning from heterogeneous information.

Science.gov (United States)

Luo, Yunan; Zhao, Xinbin; Zhou, Jingtian; Yang, Jinglin; Zhang, Yanqing; Kuang, Wenhua; Peng, Jian; Chen, Ligong; Zeng, Jianyang

2017-09-18

The emergence of large-scale genomic, chemical and pharmacological data provides new opportunities for drug discovery and repositioning. In this work, we develop a computational pipeline, called DTINet, to predict novel drug-target interactions from a constructed heterogeneous network, which integrates diverse drug-related information. DTINet focuses on learning a low-dimensional vector representation of features, which accurately explains the topological properties of individual nodes in the heterogeneous network, and then makes prediction based on these representations via a vector space projection scheme. DTINet achieves substantial performance improvement over other state-of-the-art methods for drug-target interaction prediction. Moreover, we experimentally validate the novel interactions between three drugs and the cyclooxygenase proteins predicted by DTINet, and demonstrate the new potential applications of these identified cyclooxygenase inhibitors in preventing inflammatory diseases. These results indicate that DTINet can provide a practically useful tool for integrating heterogeneous information to predict new drug-target interactions and repurpose existing drugs.Network-based data integration for drug-target prediction is a promising avenue for drug repositioning, but performance is wanting. Here, the authors introduce DTINet, whose performance is enhanced in the face of noisy, incomplete and high-dimensional biological data by learning low-dimensional vector representations.

Predicting adverse drug reaction profiles by integrating protein interaction networks with drug structures.

Science.gov (United States)

Huang, Liang-Chin; Wu, Xiaogang; Chen, Jake Y

2013-01-01

The prediction of adverse drug reactions (ADRs) has become increasingly important, due to the rising concern on serious ADRs that can cause drugs to fail to reach or stay in the market. We proposed a framework for predicting ADR profiles by integrating protein-protein interaction (PPI) networks with drug structures. We compared ADR prediction performances over 18 ADR categories through four feature groups-only drug targets, drug targets with PPI networks, drug structures, and drug targets with PPI networks plus drug structures. The results showed that the integration of PPI networks and drug structures can significantly improve the ADR prediction performance. The median AUC values for the four groups were 0.59, 0.61, 0.65, and 0.70. We used the protein features in the best two models, "Cardiac disorders" (median-AUC: 0.82) and "Psychiatric disorders" (median-AUC: 0.76), to build ADR-specific PPI networks with literature supports. For validation, we examined 30 drugs withdrawn from the U.S. market to see if our approach can predict their ADR profiles and explain why they were withdrawn. Except for three drugs having ADRs in the categories we did not predict, 25 out of 27 withdrawn drugs (92.6%) having severe ADRs were successfully predicted by our approach. © 2012 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Statistical physics of interacting neural networks

Science.gov (United States)

Kinzel, Wolfgang; Metzler, Richard; Kanter, Ido

2001-12-01

Recent results on the statistical physics of time series generation and prediction are presented. A neural network is trained on quasi-periodic and chaotic sequences and overlaps to the sequence generator as well as the prediction errors are calculated numerically. For each network there exists a sequence for which it completely fails to make predictions. Two interacting networks show a transition to perfect synchronization. A pool of interacting networks shows good coordination in the minority game-a model of competition in a closed market. Finally, as a demonstration, a perceptron predicts bit sequences produced by human beings.

Computational prediction of protein-protein interactions in Leishmania predicted proteomes.

Directory of Open Access Journals (Sweden)

Antonio M Rezende

Full Text Available The Trypanosomatids parasites Leishmania braziliensis, Leishmania major and Leishmania infantum are important human pathogens. Despite of years of study and genome availability, effective vaccine has not been developed yet, and the chemotherapy is highly toxic. Therefore, it is clear just interdisciplinary integrated studies will have success in trying to search new targets for developing of vaccines and drugs. An essential part of this rationale is related to protein-protein interaction network (PPI study which can provide a better understanding of complex protein interactions in biological system. Thus, we modeled PPIs for Trypanosomatids through computational methods using sequence comparison against public database of protein or domain interaction for interaction prediction (Interolog Mapping and developed a dedicated combined system score to address the predictions robustness. The confidence evaluation of network prediction approach was addressed using gold standard positive and negative datasets and the AUC value obtained was 0.94. As result, 39,420, 43,531 and 45,235 interactions were predicted for L. braziliensis, L. major and L. infantum respectively. For each predicted network the top 20 proteins were ranked by MCC topological index. In addition, information related with immunological potential, degree of protein sequence conservation among orthologs and degree of identity compared to proteins of potential parasite hosts was integrated. This information integration provides a better understanding and usefulness of the predicted networks that can be valuable to select new potential biological targets for drug and vaccine development. Network modularity which is a key when one is interested in destabilizing the PPIs for drug or vaccine purposes along with multiple alignments of the predicted PPIs were performed revealing patterns associated with protein turnover. In addition, around 50% of hypothetical protein present in the networks

Combining many interaction networks to predict gene function and analyze gene lists.

Science.gov (United States)

Mostafavi, Sara; Morris, Quaid

2012-05-01

In this article, we review how interaction networks can be used alone or in combination in an automated fashion to provide insight into gene and protein function. We describe the concept of a "gene-recommender system" that can be applied to any large collection of interaction networks to make predictions about gene or protein function based on a query list of proteins that share a function of interest. We discuss these systems in general and focus on one specific system, GeneMANIA, that has unique features and uses different algorithms from the majority of other systems. © 2012 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Construction of ontology augmented networks for protein complex prediction.

Science.gov (United States)

Zhang, Yijia; Lin, Hongfei; Yang, Zhihao; Wang, Jian

2013-01-01

Protein complexes are of great importance in understanding the principles of cellular organization and function. The increase in available protein-protein interaction data, gene ontology and other resources make it possible to develop computational methods for protein complex prediction. Most existing methods focus mainly on the topological structure of protein-protein interaction networks, and largely ignore the gene ontology annotation information. In this article, we constructed ontology augmented networks with protein-protein interaction data and gene ontology, which effectively unified the topological structure of protein-protein interaction networks and the similarity of gene ontology annotations into unified distance measures. After constructing ontology augmented networks, a novel method (clustering based on ontology augmented networks) was proposed to predict protein complexes, which was capable of taking into account the topological structure of the protein-protein interaction network, as well as the similarity of gene ontology annotations. Our method was applied to two different yeast protein-protein interaction datasets and predicted many well-known complexes. The experimental results showed that (i) ontology augmented networks and the unified distance measure can effectively combine the structure closeness and gene ontology annotation similarity; (ii) our method is valuable in predicting protein complexes and has higher F1 and accuracy compared to other competing methods.

Predicting haemodynamic networks using electrophysiology: The role of non-linear and cross-frequency interactions

Science.gov (United States)

Tewarie, P.; Bright, M.G.; Hillebrand, A.; Robson, S.E.; Gascoyne, L.E.; Morris, P.G.; Meier, J.; Van Mieghem, P.; Brookes, M.J.

2016-01-01

Understanding the electrophysiological basis of resting state networks (RSNs) in the human brain is a critical step towards elucidating how inter-areal connectivity supports healthy brain function. In recent years, the relationship between RSNs (typically measured using haemodynamic signals) and electrophysiology has been explored using functional Magnetic Resonance Imaging (fMRI) and magnetoencephalography (MEG). Significant progress has been made, with similar spatial structure observable in both modalities. However, there is a pressing need to understand this relationship beyond simple visual similarity of RSN patterns. Here, we introduce a mathematical model to predict fMRI-based RSNs using MEG. Our unique model, based upon a multivariate Taylor series, incorporates both phase and amplitude based MEG connectivity metrics, as well as linear and non-linear interactions within and between neural oscillations measured in multiple frequency bands. We show that including non-linear interactions, multiple frequency bands and cross-frequency terms significantly improves fMRI network prediction. This shows that fMRI connectivity is not only the result of direct electrophysiological connections, but is also driven by the overlap of connectivity profiles between separate regions. Our results indicate that a complete understanding of the electrophysiological basis of RSNs goes beyond simple frequency-specific analysis, and further exploration of non-linear and cross-frequency interactions will shed new light on distributed network connectivity, and its perturbation in pathology. PMID:26827811

Scoring protein relationships in functional interaction networks predicted from sequence data.

Directory of Open Access Journals (Sweden)

Gaston K Mazandu

Full Text Available UNLABELLED: The abundance of diverse biological data from various sources constitutes a rich source of knowledge, which has the power to advance our understanding of organisms. This requires computational methods in order to integrate and exploit these data effectively and elucidate local and genome wide functional connections between protein pairs, thus enabling functional inferences for uncharacterized proteins. These biological data are primarily in the form of sequences, which determine functions, although functional properties of a protein can often be predicted from just the domains it contains. Thus, protein sequences and domains can be used to predict protein pair-wise functional relationships, and thus contribute to the function prediction process of uncharacterized proteins in order to ensure that knowledge is gained from sequencing efforts. In this work, we introduce information-theoretic based approaches to score protein-protein functional interaction pairs predicted from protein sequence similarity and conserved protein signature matches. The proposed schemes are effective for data-driven scoring of connections between protein pairs. We applied these schemes to the Mycobacterium tuberculosis proteome to produce a homology-based functional network of the organism with a high confidence and coverage. We use the network for predicting functions of uncharacterised proteins. AVAILABILITY: Protein pair-wise functional relationship scores for Mycobacterium tuberculosis strain CDC1551 sequence data and python scripts to compute these scores are available at http://web.cbio.uct.ac.za/~gmazandu/scoringschemes.

Protein-Protein Interactions Prediction Based on Iterative Clique Extension with Gene Ontology Filtering

Directory of Open Access Journals (Sweden)

Lei Yang

2014-01-01

Full Text Available Cliques (maximal complete subnets in protein-protein interaction (PPI network are an important resource used to analyze protein complexes and functional modules. Clique-based methods of predicting PPI complement the data defection from biological experiments. However, clique-based predicting methods only depend on the topology of network. The false-positive and false-negative interactions in a network usually interfere with prediction. Therefore, we propose a method combining clique-based method of prediction and gene ontology (GO annotations to overcome the shortcoming and improve the accuracy of predictions. According to different GO correcting rules, we generate two predicted interaction sets which guarantee the quality and quantity of predicted protein interactions. The proposed method is applied to the PPI network from the Database of Interacting Proteins (DIP and most of the predicted interactions are verified by another biological database, BioGRID. The predicted protein interactions are appended to the original protein network, which leads to clique extension and shows the significance of biological meaning.

Exploration of the dynamic properties of protein complexes predicted from spatially constrained protein-protein interaction networks.

Directory of Open Access Journals (Sweden)

Eric A Yen

2014-05-01

Full Text Available Protein complexes are not static, but rather highly dynamic with subunits that undergo 1-dimensional diffusion with respect to each other. Interactions within protein complexes are modulated through regulatory inputs that alter interactions and introduce new components and deplete existing components through exchange. While it is clear that the structure and function of any given protein complex is coupled to its dynamical properties, it remains a challenge to predict the possible conformations that complexes can adopt. Protein-fragment Complementation Assays detect physical interactions between protein pairs constrained to ≤8 nm from each other in living cells. This method has been used to build networks composed of 1000s of pair-wise interactions. Significantly, these networks contain a wealth of dynamic information, as the assay is fully reversible and the proteins are expressed in their natural context. In this study, we describe a method that extracts this valuable information in the form of predicted conformations, allowing the user to explore the conformational landscape, to search for structures that correlate with an activity state, and estimate the abundance of conformations in the living cell. The generator is based on a Markov Chain Monte Carlo simulation that uses the interaction dataset as input and is constrained by the physical resolution of the assay. We applied this method to an 18-member protein complex composed of the seven core proteins of the budding yeast Arp2/3 complex and 11 associated regulators and effector proteins. We generated 20,480 output structures and identified conformational states using principle component analysis. We interrogated the conformation landscape and found evidence of symmetry breaking, a mixture of likely active and inactive conformational states and dynamic exchange of the core protein Arc15 between core and regulatory components. Our method provides a novel tool for prediction and

PREDICTING RELEVANT EMPTY SPOTS IN SOCIAL INTERACTION

Institute of Scientific and Technical Information of China (English)

Yoshiharu MAENO; Yukio OHSAWA

2008-01-01

An empty spot refers to an empty hard-to-fill space which can be found in the records of the social interaction, and is the clue to the persons in the underlying social network who do not appear in the records. This contribution addresses a problem to predict relevant empty spots in social interaction. Homogeneous and inhomogeneous networks are studied as a model underlying the social interaction. A heuristic predictor function method is presented as a new method to address the problem. Simulation experiment is demonstrated over a homogeneous network. A test data set in the form of market baskets is generated from the simulated communication. Precision to predict the empty spots is calculated to demonstrate the performance of the presented method.

Usefulness and limitations of dK random graph models to predict interactions and functional homogeneity in biological networks under a pseudo-likelihood parameter estimation approach

Directory of Open Access Journals (Sweden)

Luan Yihui

2009-09-01

Full Text Available Abstract Background Many aspects of biological functions can be modeled by biological networks, such as protein interaction networks, metabolic networks, and gene coexpression networks. Studying the statistical properties of these networks in turn allows us to infer biological function. Complex statistical network models can potentially more accurately describe the networks, but it is not clear whether such complex models are better suited to find biologically meaningful subnetworks. Results Recent studies have shown that the degree distribution of the nodes is not an adequate statistic in many molecular networks. We sought to extend this statistic with 2nd and 3rd order degree correlations and developed a pseudo-likelihood approach to estimate the parameters. The approach was used to analyze the MIPS and BIOGRID yeast protein interaction networks, and two yeast coexpression networks. We showed that 2nd order degree correlation information gave better predictions of gene interactions in both protein interaction and gene coexpression networks. However, in the biologically important task of predicting functionally homogeneous modules, degree correlation information performs marginally better in the case of the MIPS and BIOGRID protein interaction networks, but worse in the case of gene coexpression networks. Conclusion Our use of dK models showed that incorporation of degree correlations could increase predictive power in some contexts, albeit sometimes marginally, but, in all contexts, the use of third-order degree correlations decreased accuracy. However, it is possible that other parameter estimation methods, such as maximum likelihood, will show the usefulness of incorporating 2nd and 3rd degree correlations in predicting functionally homogeneous modules.

Usefulness and limitations of dK random graph models to predict interactions and functional homogeneity in biological networks under a pseudo-likelihood parameter estimation approach.

Science.gov (United States)

Wang, Wenhui; Nunez-Iglesias, Juan; Luan, Yihui; Sun, Fengzhu

2009-09-03

Many aspects of biological functions can be modeled by biological networks, such as protein interaction networks, metabolic networks, and gene coexpression networks. Studying the statistical properties of these networks in turn allows us to infer biological function. Complex statistical network models can potentially more accurately describe the networks, but it is not clear whether such complex models are better suited to find biologically meaningful subnetworks. Recent studies have shown that the degree distribution of the nodes is not an adequate statistic in many molecular networks. We sought to extend this statistic with 2nd and 3rd order degree correlations and developed a pseudo-likelihood approach to estimate the parameters. The approach was used to analyze the MIPS and BIOGRID yeast protein interaction networks, and two yeast coexpression networks. We showed that 2nd order degree correlation information gave better predictions of gene interactions in both protein interaction and gene coexpression networks. However, in the biologically important task of predicting functionally homogeneous modules, degree correlation information performs marginally better in the case of the MIPS and BIOGRID protein interaction networks, but worse in the case of gene coexpression networks. Our use of dK models showed that incorporation of degree correlations could increase predictive power in some contexts, albeit sometimes marginally, but, in all contexts, the use of third-order degree correlations decreased accuracy. However, it is possible that other parameter estimation methods, such as maximum likelihood, will show the usefulness of incorporating 2nd and 3rd degree correlations in predicting functionally homogeneous modules.

Effectiveness of link prediction for face-to-face behavioral networks.

Science.gov (United States)

Tsugawa, Sho; Ohsaki, Hiroyuki

2013-01-01

Research on link prediction for social networks has been actively pursued. In link prediction for a given social network obtained from time-windowed observation, new link formation in the network is predicted from the topology of the obtained network. In contrast, recent advances in sensing technology have made it possible to obtain face-to-face behavioral networks, which are social networks representing face-to-face interactions among people. However, the effectiveness of link prediction techniques for face-to-face behavioral networks has not yet been explored in depth. To clarify this point, here we investigate the accuracy of conventional link prediction techniques for networks obtained from the history of face-to-face interactions among participants at an academic conference. Our findings were (1) that conventional link prediction techniques predict new link formation with a precision of 0.30-0.45 and a recall of 0.10-0.20, (2) that prolonged observation of social networks often degrades the prediction accuracy, (3) that the proposed decaying weight method leads to higher prediction accuracy than can be achieved by observing all records of communication and simply using them unmodified, and (4) that the prediction accuracy for face-to-face behavioral networks is relatively high compared to that for non-social networks, but not as high as for other types of social networks.

Social networks predict selective observation and information spread in ravens

Science.gov (United States)

Rubenstein, Daniel I.; Bugnyar, Thomas; Hoppitt, William; Mikus, Nace; Schwab, Christine

2016-01-01

Animals are predicted to selectively observe and learn from the conspecifics with whom they share social connections. Yet, hardly anything is known about the role of different connections in observation and learning. To address the relationships between social connections, observation and learning, we investigated transmission of information in two raven (Corvus corax) groups. First, we quantified social connections in each group by constructing networks on affiliative interactions, aggressive interactions and proximity. We then seeded novel information by training one group member on a novel task and allowing others to observe. In each group, an observation network based on who observed whose task-solving behaviour was strongly correlated with networks based on affiliative interactions and proximity. Ravens with high social centrality (strength, eigenvector, information centrality) in the affiliative interaction network were also central in the observation network, possibly as a result of solving the task sooner. Network-based diffusion analysis revealed that the order that ravens first solved the task was best predicted by connections in the affiliative interaction network in a group of subadult ravens, and by social rank and kinship (which influenced affiliative interactions) in a group of juvenile ravens. Our results demonstrate that not all social connections are equally effective at predicting the patterns of selective observation and information transmission. PMID:27493780

Predicting drug-target interactions using restricted Boltzmann machines.

Science.gov (United States)

Wang, Yuhao; Zeng, Jianyang

2013-07-01

In silico prediction of drug-target interactions plays an important role toward identifying and developing new uses of existing or abandoned drugs. Network-based approaches have recently become a popular tool for discovering new drug-target interactions (DTIs). Unfortunately, most of these network-based approaches can only predict binary interactions between drugs and targets, and information about different types of interactions has not been well exploited for DTI prediction in previous studies. On the other hand, incorporating additional information about drug-target relationships or drug modes of action can improve prediction of DTIs. Furthermore, the predicted types of DTIs can broaden our understanding about the molecular basis of drug action. We propose a first machine learning approach to integrate multiple types of DTIs and predict unknown drug-target relationships or drug modes of action. We cast the new DTI prediction problem into a two-layer graphical model, called restricted Boltzmann machine, and apply a practical learning algorithm to train our model and make predictions. Tests on two public databases show that our restricted Boltzmann machine model can effectively capture the latent features of a DTI network and achieve excellent performance on predicting different types of DTIs, with the area under precision-recall curve up to 89.6. In addition, we demonstrate that integrating multiple types of DTIs can significantly outperform other predictions either by simply mixing multiple types of interactions without distinction or using only a single interaction type. Further tests show that our approach can infer a high fraction of novel DTIs that has been validated by known experiments in the literature or other databases. These results indicate that our approach can have highly practical relevance to DTI prediction and drug repositioning, and hence advance the drug discovery process. Software and datasets are available on request. Supplementary data are

Comprehensive curation and analysis of global interaction networks in Saccharomyces cerevisiae

Science.gov (United States)

Reguly, Teresa; Breitkreutz, Ashton; Boucher, Lorrie; Breitkreutz, Bobby-Joe; Hon, Gary C; Myers, Chad L; Parsons, Ainslie; Friesen, Helena; Oughtred, Rose; Tong, Amy; Stark, Chris; Ho, Yuen; Botstein, David; Andrews, Brenda; Boone, Charles; Troyanskya, Olga G; Ideker, Trey; Dolinski, Kara; Batada, Nizar N; Tyers, Mike

2006-01-01

Background The study of complex biological networks and prediction of gene function has been enabled by high-throughput (HTP) methods for detection of genetic and protein interactions. Sparse coverage in HTP datasets may, however, distort network properties and confound predictions. Although a vast number of well substantiated interactions are recorded in the scientific literature, these data have not yet been distilled into networks that enable system-level inference. Results We describe here a comprehensive database of genetic and protein interactions, and associated experimental evidence, for the budding yeast Saccharomyces cerevisiae, as manually curated from over 31,793 abstracts and online publications. This literature-curated (LC) dataset contains 33,311 interactions, on the order of all extant HTP datasets combined. Surprisingly, HTP protein-interaction datasets currently achieve only around 14% coverage of the interactions in the literature. The LC network nevertheless shares attributes with HTP networks, including scale-free connectivity and correlations between interactions, abundance, localization, and expression. We find that essential genes or proteins are enriched for interactions with other essential genes or proteins, suggesting that the global network may be functionally unified. This interconnectivity is supported by a substantial overlap of protein and genetic interactions in the LC dataset. We show that the LC dataset considerably improves the predictive power of network-analysis approaches. The full LC dataset is available at the BioGRID () and SGD () databases. Conclusion Comprehensive datasets of biological interactions derived from the primary literature provide critical benchmarks for HTP methods, augment functional prediction, and reveal system-level attributes of biological networks. PMID:16762047

Drug-Target Interaction Prediction with Graph Regularized Matrix Factorization.

Science.gov (United States)

Ezzat, Ali; Zhao, Peilin; Wu, Min; Li, Xiao-Li; Kwoh, Chee-Keong

2017-01-01

Experimental determination of drug-target interactions is expensive and time-consuming. Therefore, there is a continuous demand for more accurate predictions of interactions using computational techniques. Algorithms have been devised to infer novel interactions on a global scale where the input to these algorithms is a drug-target network (i.e., a bipartite graph where edges connect pairs of drugs and targets that are known to interact). However, these algorithms had difficulty predicting interactions involving new drugs or targets for which there are no known interactions (i.e., "orphan" nodes in the network). Since data usually lie on or near to low-dimensional non-linear manifolds, we propose two matrix factorization methods that use graph regularization in order to learn such manifolds. In addition, considering that many of the non-occurring edges in the network are actually unknown or missing cases, we developed a preprocessing step to enhance predictions in the "new drug" and "new target" cases by adding edges with intermediate interaction likelihood scores. In our cross validation experiments, our methods achieved better results than three other state-of-the-art methods in most cases. Finally, we simulated some "new drug" and "new target" cases and found that GRMF predicted the left-out interactions reasonably well.

Linking macroecology and community ecology: refining predictions of species distributions using biotic interaction networks.

Science.gov (United States)

Staniczenko, Phillip P A; Sivasubramaniam, Prabu; Suttle, K Blake; Pearson, Richard G

2017-06-01

Macroecological models for predicting species distributions usually only include abiotic environmental conditions as explanatory variables, despite knowledge from community ecology that all species are linked to other species through biotic interactions. This disconnect is largely due to the different spatial scales considered by the two sub-disciplines: macroecologists study patterns at large extents and coarse resolutions, while community ecologists focus on small extents and fine resolutions. A general framework for including biotic interactions in macroecological models would help bridge this divide, as it would allow for rigorous testing of the role that biotic interactions play in determining species ranges. Here, we present an approach that combines species distribution models with Bayesian networks, which enables the direct and indirect effects of biotic interactions to be modelled as propagating conditional dependencies among species' presences. We show that including biotic interactions in distribution models for species from a California grassland community results in better range predictions across the western USA. This new approach will be important for improving estimates of species distributions and their dynamics under environmental change. © 2017 The Authors. Ecology Letters published by CNRS and John Wiley & Sons Ltd.

Unveiling protein functions through the dynamics of the interaction network.

Directory of Open Access Journals (Sweden)

Irene Sendiña-Nadal

Full Text Available Protein interaction networks have become a tool to study biological processes, either for predicting molecular functions or for designing proper new drugs to regulate the main biological interactions. Furthermore, such networks are known to be organized in sub-networks of proteins contributing to the same cellular function. However, the protein function prediction is not accurate and each protein has traditionally been assigned to only one function by the network formalism. By considering the network of the physical interactions between proteins of the yeast together with a manual and single functional classification scheme, we introduce a method able to reveal important information on protein function, at both micro- and macro-scale. In particular, the inspection of the properties of oscillatory dynamics on top of the protein interaction network leads to the identification of misclassification problems in protein function assignments, as well as to unveil correct identification of protein functions. We also demonstrate that our approach can give a network representation of the meta-organization of biological processes by unraveling the interactions between different functional classes.

Enhancing the Functional Content of Eukaryotic Protein Interaction Networks

Science.gov (United States)

Pandey, Gaurav; Arora, Sonali; Manocha, Sahil; Whalen, Sean

2014-01-01

Protein interaction networks are a promising type of data for studying complex biological systems. However, despite the rich information embedded in these networks, these networks face important data quality challenges of noise and incompleteness that adversely affect the results obtained from their analysis. Here, we apply a robust measure of local network structure called common neighborhood similarity (CNS) to address these challenges. Although several CNS measures have been proposed in the literature, an understanding of their relative efficacies for the analysis of interaction networks has been lacking. We follow the framework of graph transformation to convert the given interaction network into a transformed network corresponding to a variety of CNS measures evaluated. The effectiveness of each measure is then estimated by comparing the quality of protein function predictions obtained from its corresponding transformed network with those from the original network. Using a large set of human and fly protein interactions, and a set of over GO terms for both, we find that several of the transformed networks produce more accurate predictions than those obtained from the original network. In particular, the measure and other continuous CNS measures perform well this task, especially for large networks. Further investigation reveals that the two major factors contributing to this improvement are the abilities of CNS measures to prune out noisy edges and enhance functional coherence in the transformed networks. PMID:25275489

Discerning molecular interactions: A comprehensive review on biomolecular interaction databases and network analysis tools.

Science.gov (United States)

Miryala, Sravan Kumar; Anbarasu, Anand; Ramaiah, Sudha

2018-02-05

Computational analysis of biomolecular interaction networks is now gaining a lot of importance to understand the functions of novel genes/proteins. Gene interaction (GI) network analysis and protein-protein interaction (PPI) network analysis play a major role in predicting the functionality of interacting genes or proteins and gives an insight into the functional relationships and evolutionary conservation of interactions among the genes. An interaction network is a graphical representation of gene/protein interactome, where each gene/protein is a node, and interaction between gene/protein is an edge. In this review, we discuss the popular open source databases that serve as data repositories to search and collect protein/gene interaction data, and also tools available for the generation of interaction network, visualization and network analysis. Also, various network analysis approaches like topological approach and clustering approach to study the network properties and functional enrichment server which illustrates the functions and pathway of the genes and proteins has been discussed. Hence the distinctive attribute mentioned in this review is not only to provide an overview of tools and web servers for gene and protein-protein interaction (PPI) network analysis but also to extract useful and meaningful information from the interaction networks. Copyright © 2017 Elsevier B.V. All rights reserved.

Semi-supervised drug-protein interaction prediction from heterogeneous biological spaces.

Science.gov (United States)

Xia, Zheng; Wu, Ling-Yun; Zhou, Xiaobo; Wong, Stephen T C

2010-09-13

Predicting drug-protein interactions from heterogeneous biological data sources is a key step for in silico drug discovery. The difficulty of this prediction task lies in the rarity of known drug-protein interactions and myriad unknown interactions to be predicted. To meet this challenge, a manifold regularization semi-supervised learning method is presented to tackle this issue by using labeled and unlabeled information which often generates better results than using the labeled data alone. Furthermore, our semi-supervised learning method integrates known drug-protein interaction network information as well as chemical structure and genomic sequence data. Using the proposed method, we predicted certain drug-protein interactions on the enzyme, ion channel, GPCRs, and nuclear receptor data sets. Some of them are confirmed by the latest publicly available drug targets databases such as KEGG. We report encouraging results of using our method for drug-protein interaction network reconstruction which may shed light on the molecular interaction inference and new uses of marketed drugs.

Information assessment on predicting protein-protein interactions

Directory of Open Access Journals (Sweden)

Gerstein Mark

2004-10-01

Full Text Available Abstract Background Identifying protein-protein interactions is fundamental for understanding the molecular machinery of the cell. Proteome-wide studies of protein-protein interactions are of significant value, but the high-throughput experimental technologies suffer from high rates of both false positive and false negative predictions. In addition to high-throughput experimental data, many diverse types of genomic data can help predict protein-protein interactions, such as mRNA expression, localization, essentiality, and functional annotation. Evaluations of the information contributions from different evidences help to establish more parsimonious models with comparable or better prediction accuracy, and to obtain biological insights of the relationships between protein-protein interactions and other genomic information. Results Our assessment is based on the genomic features used in a Bayesian network approach to predict protein-protein interactions genome-wide in yeast. In the special case, when one does not have any missing information about any of the features, our analysis shows that there is a larger information contribution from the functional-classification than from expression correlations or essentiality. We also show that in this case alternative models, such as logistic regression and random forest, may be more effective than Bayesian networks for predicting interactions. Conclusions In the restricted problem posed by the complete-information subset, we identified that the MIPS and Gene Ontology (GO functional similarity datasets as the dominating information contributors for predicting the protein-protein interactions under the framework proposed by Jansen et al. Random forests based on the MIPS and GO information alone can give highly accurate classifications. In this particular subset of complete information, adding other genomic data does little for improving predictions. We also found that the data discretizations used in the

Predicting highly-connected hubs in protein interaction networks by QSAR and biological data descriptors

Science.gov (United States)

Hsing, Michael; Byler, Kendall; Cherkasov, Artem

2009-01-01

Hub proteins (those engaged in most physical interactions in a protein interaction network (PIN) have recently gained much research interest due to their essential role in mediating cellular processes and their potential therapeutic value. It is straightforward to identify hubs if the underlying PIN is experimentally determined; however, theoretical hub prediction remains a very challenging task, as physicochemical properties that differentiate hubs from less connected proteins remain mostly uncharacterized. To adequately distinguish hubs from non-hub proteins we have utilized over 1300 protein descriptors, some of which represent QSAR (quantitative structure-activity relationship) parameters, and some reflect sequence-derived characteristics of proteins including domain composition and functional annotations. Those protein descriptors, together with available protein interaction data have been processed by a machine learning method (boosting trees) and resulted in the development of hub classifiers that are capable of predicting highly interacting proteins for four model organisms: Escherichia coli, Saccharomyces cerevisiae, Drosophila melanogaster and Homo sapiens. More importantly, through the analyses of the most relevant protein descriptors, we are able to demonstrate that hub proteins not only share certain common physicochemical and structural characteristics that make them different from non-hub counterparts, but they also exhibit species-specific characteristics that should be taken into account when analyzing different PINs. The developed prediction models can be used for determining highly interacting proteins in the four studied species to assist future proteomics experiments and PIN analyses. Availability The source code and executable program of the hub classifier are available for download at: http://www.cnbi2.ca/hub-analysis/ PMID:20198194

Network information improves cancer outcome prediction.

Science.gov (United States)

Roy, Janine; Winter, Christof; Isik, Zerrin; Schroeder, Michael

2014-07-01

Disease progression in cancer can vary substantially between patients. Yet, patients often receive the same treatment. Recently, there has been much work on predicting disease progression and patient outcome variables from gene expression in order to personalize treatment options. Despite first diagnostic kits in the market, there are open problems such as the choice of random gene signatures or noisy expression data. One approach to deal with these two problems employs protein-protein interaction networks and ranks genes using the random surfer model of Google's PageRank algorithm. In this work, we created a benchmark dataset collection comprising 25 cancer outcome prediction datasets from literature and systematically evaluated the use of networks and a PageRank derivative, NetRank, for signature identification. We show that the NetRank performs significantly better than classical methods such as fold change or t-test. Despite an order of magnitude difference in network size, a regulatory and protein-protein interaction network perform equally well. Experimental evaluation on cancer outcome prediction in all of the 25 underlying datasets suggests that the network-based methodology identifies highly overlapping signatures over all cancer types, in contrast to classical methods that fail to identify highly common gene sets across the same cancer types. Integration of network information into gene expression analysis allows the identification of more reliable and accurate biomarkers and provides a deeper understanding of processes occurring in cancer development and progression. © The Author 2012. Published by Oxford University Press. For Permissions, please email: journals.permissions@oup.com.

Predictability of Genetic Interactions from Functional Gene Modules

Directory of Open Access Journals (Sweden)

Jonathan H. Young

2017-02-01

Full Text Available Characterizing genetic interactions is crucial to understanding cellular and organismal response to gene-level perturbations. Such knowledge can inform the selection of candidate disease therapy targets, yet experimentally determining whether genes interact is technically nontrivial and time-consuming. High-fidelity prediction of different classes of genetic interactions in multiple organisms would substantially alleviate this experimental burden. Under the hypothesis that functionally related genes tend to share common genetic interaction partners, we evaluate a computational approach to predict genetic interactions in Homo sapiens, Drosophila melanogaster, and Saccharomyces cerevisiae. By leveraging knowledge of functional relationships between genes, we cross-validate predictions on known genetic interactions and observe high predictive power of multiple classes of genetic interactions in all three organisms. Additionally, our method suggests high-confidence candidate interaction pairs that can be directly experimentally tested. A web application is provided for users to query genes for predicted novel genetic interaction partners. Finally, by subsampling the known yeast genetic interaction network, we found that novel genetic interactions are predictable even when knowledge of currently known interactions is minimal.

Identification and prediction of dynamic systems using an interactively recurrent self-evolving fuzzy neural network.

Science.gov (United States)

Lin, Yang-Yin; Chang, Jyh-Yeong; Lin, Chin-Teng

2013-02-01

This paper presents a novel recurrent fuzzy neural network, called an interactively recurrent self-evolving fuzzy neural network (IRSFNN), for prediction and identification of dynamic systems. The recurrent structure in an IRSFNN is formed as an external loops and internal feedback by feeding the rule firing strength of each rule to others rules and itself. The consequent part in the IRSFNN is composed of a Takagi-Sugeno-Kang (TSK) or functional-link-based type. The proposed IRSFNN employs a functional link neural network (FLNN) to the consequent part of fuzzy rules for promoting the mapping ability. Unlike a TSK-type fuzzy neural network, the FLNN in the consequent part is a nonlinear function of input variables. An IRSFNNs learning starts with an empty rule base and all of the rules are generated and learned online through a simultaneous structure and parameter learning. An on-line clustering algorithm is effective in generating fuzzy rules. The consequent update parameters are derived by a variable-dimensional Kalman filter algorithm. The premise and recurrent parameters are learned through a gradient descent algorithm. We test the IRSFNN for the prediction and identification of dynamic plants and compare it to other well-known recurrent FNNs. The proposed model obtains enhanced performance results.

Specific non-monotonous interactions increase persistence of ecological networks.

Science.gov (United States)

Yan, Chuan; Zhang, Zhibin

2014-03-22

The relationship between stability and biodiversity has long been debated in ecology due to opposing empirical observations and theoretical predictions. Species interaction strength is often assumed to be monotonically related to population density, but the effects on stability of ecological networks of non-monotonous interactions that change signs have not been investigated previously. We demonstrate that for four kinds of non-monotonous interactions, shifting signs to negative or neutral interactions at high population density increases persistence (a measure of stability) of ecological networks, while for the other two kinds of non-monotonous interactions shifting signs to positive interactions at high population density decreases persistence of networks. Our results reveal a novel mechanism of network stabilization caused by specific non-monotonous interaction types through either increasing stable equilibrium points or reducing unstable equilibrium points (or both). These specific non-monotonous interactions may be important in maintaining stable and complex ecological networks, as well as other networks such as genes, neurons, the internet and human societies.

Statistical Mechanics of Temporal and Interacting Networks

Science.gov (United States)

Zhao, Kun

In the last ten years important breakthroughs in the understanding of the topology of complexity have been made in the framework of network science. Indeed it has been found that many networks belong to the universality classes called small-world networks or scale-free networks. Moreover it was found that the complex architecture of real world networks strongly affects the critical phenomena defined on these structures. Nevertheless the main focus of the research has been the characterization of single and static networks. Recently, temporal networks and interacting networks have attracted large interest. Indeed many networks are interacting or formed by a multilayer structure. Example of these networks are found in social networks where an individual might be at the same time part of different social networks, in economic and financial networks, in physiology or in infrastructure systems. Moreover, many networks are temporal, i.e. the links appear and disappear on the fast time scale. Examples of these networks are social networks of contacts such as face-to-face interactions or mobile-phone communication, the time-dependent correlations in the brain activity and etc. Understanding the evolution of temporal and multilayer networks and characterizing critical phenomena in these systems is crucial if we want to describe, predict and control the dynamics of complex system. In this thesis, we investigate several statistical mechanics models of temporal and interacting networks, to shed light on the dynamics of this new generation of complex networks. First, we investigate a model of temporal social networks aimed at characterizing human social interactions such as face-to-face interactions and phone-call communication. Indeed thanks to the availability of data on these interactions, we are now in the position to compare the proposed model to the real data finding good agreement. Second, we investigate the entropy of temporal networks and growing networks , to provide

Cytoprophet: a Cytoscape plug-in for protein and domain interaction networks inference.

Science.gov (United States)

Morcos, Faruck; Lamanna, Charles; Sikora, Marcin; Izaguirre, Jesús

2008-10-01

Cytoprophet is a software tool that allows prediction and visualization of protein and domain interaction networks. It is implemented as a plug-in of Cytoscape, an open source software framework for analysis and visualization of molecular networks. Cytoprophet implements three algorithms that predict new potential physical interactions using the domain composition of proteins and experimental assays. The algorithms for protein and domain interaction inference include maximum likelihood estimation (MLE) using expectation maximization (EM); the set cover approach maximum specificity set cover (MSSC) and the sum-product algorithm (SPA). After accepting an input set of proteins with Uniprot ID/Accession numbers and a selected prediction algorithm, Cytoprophet draws a network of potential interactions with probability scores and GO distances as edge attributes. A network of domain interactions between the domains of the initial protein list can also be generated. Cytoprophet was designed to take advantage of the visual capabilities of Cytoscape and be simple to use. An example of inference in a signaling network of myxobacterium Myxococcus xanthus is presented and available at Cytoprophet's website. http://cytoprophet.cse.nd.edu.

Prediction of protein–protein interactions: unifying evolution and structure at protein interfaces

International Nuclear Information System (INIS)

Tuncbag, Nurcan; Gursoy, Attila; Keskin, Ozlem

2011-01-01

The vast majority of the chores in the living cell involve protein–protein interactions. Providing details of protein interactions at the residue level and incorporating them into protein interaction networks are crucial toward the elucidation of a dynamic picture of cells. Despite the rapid increase in the number of structurally known protein complexes, we are still far away from a complete network. Given experimental limitations, computational modeling of protein interactions is a prerequisite to proceed on the way to complete structural networks. In this work, we focus on the question 'how do proteins interact?' rather than 'which proteins interact?' and we review structure-based protein–protein interaction prediction approaches. As a sample approach for modeling protein interactions, PRISM is detailed which combines structural similarity and evolutionary conservation in protein interfaces to infer structures of complexes in the protein interaction network. This will ultimately help us to understand the role of protein interfaces in predicting bound conformations

Predictive networks: a flexible, open source, web application for integration and analysis of human gene networks.

Science.gov (United States)

Haibe-Kains, Benjamin; Olsen, Catharina; Djebbari, Amira; Bontempi, Gianluca; Correll, Mick; Bouton, Christopher; Quackenbush, John

2012-01-01

Genomics provided us with an unprecedented quantity of data on the genes that are activated or repressed in a wide range of phenotypes. We have increasingly come to recognize that defining the networks and pathways underlying these phenotypes requires both the integration of multiple data types and the development of advanced computational methods to infer relationships between the genes and to estimate the predictive power of the networks through which they interact. To address these issues we have developed Predictive Networks (PN), a flexible, open-source, web-based application and data services framework that enables the integration, navigation, visualization and analysis of gene interaction networks. The primary goal of PN is to allow biomedical researchers to evaluate experimentally derived gene lists in the context of large-scale gene interaction networks. The PN analytical pipeline involves two key steps. The first is the collection of a comprehensive set of known gene interactions derived from a variety of publicly available sources. The second is to use these 'known' interactions together with gene expression data to infer robust gene networks. The PN web application is accessible from http://predictivenetworks.org. The PN code base is freely available at https://sourceforge.net/projects/predictivenets/.

Offspring social network structure predicts fitness in families.

Science.gov (United States)

Royle, Nick J; Pike, Thomas W; Heeb, Philipp; Richner, Heinz; Kölliker, Mathias

2012-12-22

Social structures such as families emerge as outcomes of behavioural interactions among individuals, and can evolve over time if families with particular types of social structures tend to leave more individuals in subsequent generations. The social behaviour of interacting individuals is typically analysed as a series of multiple dyadic (pair-wise) interactions, rather than a network of interactions among multiple individuals. However, in species where parents feed dependant young, interactions within families nearly always involve more than two individuals simultaneously. Such social networks of interactions at least partly reflect conflicts of interest over the provision of costly parental investment. Consequently, variation in family network structure reflects variation in how conflicts of interest are resolved among family members. Despite its importance in understanding the evolution of emergent properties of social organization such as family life and cooperation, nothing is currently known about how selection acts on the structure of social networks. Here, we show that the social network structure of broods of begging nestling great tits Parus major predicts fitness in families. Although selection at the level of the individual favours large nestlings, selection at the level of the kin-group primarily favours families that resolve conflicts most effectively.

Predictive regulatory models in Drosophila melanogaster by integrative inference of transcriptional networks

Science.gov (United States)

Marbach, Daniel; Roy, Sushmita; Ay, Ferhat; Meyer, Patrick E.; Candeias, Rogerio; Kahveci, Tamer; Bristow, Christopher A.; Kellis, Manolis

2012-01-01

Gaining insights on gene regulation from large-scale functional data sets is a grand challenge in systems biology. In this article, we develop and apply methods for transcriptional regulatory network inference from diverse functional genomics data sets and demonstrate their value for gene function and gene expression prediction. We formulate the network inference problem in a machine-learning framework and use both supervised and unsupervised methods to predict regulatory edges by integrating transcription factor (TF) binding, evolutionarily conserved sequence motifs, gene expression, and chromatin modification data sets as input features. Applying these methods to Drosophila melanogaster, we predict ∼300,000 regulatory edges in a network of ∼600 TFs and 12,000 target genes. We validate our predictions using known regulatory interactions, gene functional annotations, tissue-specific expression, protein–protein interactions, and three-dimensional maps of chromosome conformation. We use the inferred network to identify putative functions for hundreds of previously uncharacterized genes, including many in nervous system development, which are independently confirmed based on their tissue-specific expression patterns. Last, we use the regulatory network to predict target gene expression levels as a function of TF expression, and find significantly higher predictive power for integrative networks than for motif or ChIP-based networks. Our work reveals the complementarity between physical evidence of regulatory interactions (TF binding, motif conservation) and functional evidence (coordinated expression or chromatin patterns) and demonstrates the power of data integration for network inference and studies of gene regulation at the systems level. PMID:22456606

Predictive regulatory models in Drosophila melanogaster by integrative inference of transcriptional networks.

Science.gov (United States)

Marbach, Daniel; Roy, Sushmita; Ay, Ferhat; Meyer, Patrick E; Candeias, Rogerio; Kahveci, Tamer; Bristow, Christopher A; Kellis, Manolis

2012-07-01

Gaining insights on gene regulation from large-scale functional data sets is a grand challenge in systems biology. In this article, we develop and apply methods for transcriptional regulatory network inference from diverse functional genomics data sets and demonstrate their value for gene function and gene expression prediction. We formulate the network inference problem in a machine-learning framework and use both supervised and unsupervised methods to predict regulatory edges by integrating transcription factor (TF) binding, evolutionarily conserved sequence motifs, gene expression, and chromatin modification data sets as input features. Applying these methods to Drosophila melanogaster, we predict ∼300,000 regulatory edges in a network of ∼600 TFs and 12,000 target genes. We validate our predictions using known regulatory interactions, gene functional annotations, tissue-specific expression, protein-protein interactions, and three-dimensional maps of chromosome conformation. We use the inferred network to identify putative functions for hundreds of previously uncharacterized genes, including many in nervous system development, which are independently confirmed based on their tissue-specific expression patterns. Last, we use the regulatory network to predict target gene expression levels as a function of TF expression, and find significantly higher predictive power for integrative networks than for motif or ChIP-based networks. Our work reveals the complementarity between physical evidence of regulatory interactions (TF binding, motif conservation) and functional evidence (coordinated expression or chromatin patterns) and demonstrates the power of data integration for network inference and studies of gene regulation at the systems level.

Functional Interaction Network Construction and Analysis for Disease Discovery.

Science.gov (United States)

Wu, Guanming; Haw, Robin

2017-01-01

Network-based approaches project seemingly unrelated genes or proteins onto a large-scale network context, therefore providing a holistic visualization and analysis platform for genomic data generated from high-throughput experiments, reducing the dimensionality of data via using network modules and increasing the statistic analysis power. Based on the Reactome database, the most popular and comprehensive open-source biological pathway knowledgebase, we have developed a highly reliable protein functional interaction network covering around 60 % of total human genes and an app called ReactomeFIViz for Cytoscape, the most popular biological network visualization and analysis platform. In this chapter, we describe the detailed procedures on how this functional interaction network is constructed by integrating multiple external data sources, extracting functional interactions from human curated pathway databases, building a machine learning classifier called a Naïve Bayesian Classifier, predicting interactions based on the trained Naïve Bayesian Classifier, and finally constructing the functional interaction database. We also provide an example on how to use ReactomeFIViz for performing network-based data analysis for a list of genes.

Disentangling the co-structure of multilayer interaction networks: degree distribution and module composition in two-layer bipartite networks.

Science.gov (United States)

Astegiano, Julia; Altermatt, Florian; Massol, François

2017-11-13

Species establish different interactions (e.g. antagonistic, mutualistic) with multiple species, forming multilayer ecological networks. Disentangling network co-structure in multilayer networks is crucial to predict how biodiversity loss may affect the persistence of multispecies assemblages. Existing methods to analyse multilayer networks often fail to consider network co-structure. We present a new method to evaluate the modular co-structure of multilayer networks through the assessment of species degree co-distribution and network module composition. We focus on modular structure because of its high prevalence among ecological networks. We apply our method to two Lepidoptera-plant networks, one describing caterpillar-plant herbivory interactions and one representing adult Lepidoptera nectaring on flowers, thereby possibly pollinating them. More than 50% of the species established either herbivory or visitation interactions, but not both. These species were over-represented among plants and lepidopterans, and were present in most modules in both networks. Similarity in module composition between networks was high but not different from random expectations. Our method clearly delineates the importance of interpreting multilayer module composition similarity in the light of the constraints imposed by network structure to predict the potential indirect effects of species loss through interconnected modular networks.

Boosting compound-protein interaction prediction by deep learning.

Science.gov (United States)

Tian, Kai; Shao, Mingyu; Wang, Yang; Guan, Jihong; Zhou, Shuigeng

2016-11-01

The identification of interactions between compounds and proteins plays an important role in network pharmacology and drug discovery. However, experimentally identifying compound-protein interactions (CPIs) is generally expensive and time-consuming, computational approaches are thus introduced. Among these, machine-learning based methods have achieved a considerable success. However, due to the nonlinear and imbalanced nature of biological data, many machine learning approaches have their own limitations. Recently, deep learning techniques show advantages over many state-of-the-art machine learning methods in some applications. In this study, we aim at improving the performance of CPI prediction based on deep learning, and propose a method called DL-CPI (the abbreviation of Deep Learning for Compound-Protein Interactions prediction), which employs deep neural network (DNN) to effectively learn the representations of compound-protein pairs. Extensive experiments show that DL-CPI can learn useful features of compound-protein pairs by a layerwise abstraction, and thus achieves better prediction performance than existing methods on both balanced and imbalanced datasets. Copyright © 2016 Elsevier Inc. All rights reserved.

Evaluating factors that predict the structure of a commensalistic epiphyte–phorophyte network

Science.gov (United States)

Sáyago, Roberto; Lopezaraiza-Mikel, Martha; Quesada, Mauricio; Álvarez-Añorve, Mariana Yolotl; Cascante-Marín, Alfredo; Bastida, Jesus Ma.

2013-01-01

A central issue in ecology is the understanding of the establishment of biotic interactions. We studied the factors that affect the assembly of the commensalistic interactions between vascular epiphytes and their host plants. We used an analytical approach that considers all individuals and species of epiphytic bromeliads and woody hosts and non-hosts at study plots. We built models of interaction probabilities among species to assess if host traits and abundance and spatial overlap of species predict the quantitative epiphyte–host network. Species abundance, species spatial overlap and host size largely predicted pairwise interactions and several network metrics. Wood density and bark texture of hosts also contributed to explain network structure. Epiphytes were more common on large hosts, on abundant woody species, with denser wood and/or rougher bark. The network had a low level of specialization, although several interactions were more frequent than expected by the models. We did not detect a phylogenetic signal on the network structure. The effect of host size on the establishment of epiphytes indicates that mature forests are necessary to preserve diverse bromeliad communities. PMID:23407832

Empirical evaluation of neutral interactions in host-parasite networks.

Science.gov (United States)

Canard, E F; Mouquet, N; Mouillot, D; Stanko, M; Miklisova, D; Gravel, D

2014-04-01

While niche-based processes have been invoked extensively to explain the structure of interaction networks, recent studies propose that neutrality could also be of great importance. Under the neutral hypothesis, network structure would simply emerge from random encounters between individuals and thus would be directly linked to species abundance. We investigated the impact of species abundance distributions on qualitative and quantitative metrics of 113 host-parasite networks. We analyzed the concordance between neutral expectations and empirical observations at interaction, species, and network levels. We found that species abundance accurately predicts network metrics at all levels. Despite host-parasite systems being constrained by physiology and immunology, our results suggest that neutrality could also explain, at least partially, their structure. We hypothesize that trait matching would determine potential interactions between species, while abundance would determine their realization.

Predicting rates of interspecific interaction from phylogenetic trees.

Science.gov (United States)

Nuismer, Scott L; Harmon, Luke J

2015-01-01

Integrating phylogenetic information can potentially improve our ability to explain species' traits, patterns of community assembly, the network structure of communities, and ecosystem function. In this study, we use mathematical models to explore the ecological and evolutionary factors that modulate the explanatory power of phylogenetic information for communities of species that interact within a single trophic level. We find that phylogenetic relationships among species can influence trait evolution and rates of interaction among species, but only under particular models of species interaction. For example, when interactions within communities are mediated by a mechanism of phenotype matching, phylogenetic trees make specific predictions about trait evolution and rates of interaction. In contrast, if interactions within a community depend on a mechanism of phenotype differences, phylogenetic information has little, if any, predictive power for trait evolution and interaction rate. Together, these results make clear and testable predictions for when and how evolutionary history is expected to influence contemporary rates of species interaction. © 2014 John Wiley & Sons Ltd/CNRS.

The integration of weighted human gene association networks based on link prediction.

Science.gov (United States)

Yang, Jian; Yang, Tinghong; Wu, Duzhi; Lin, Limei; Yang, Fan; Zhao, Jing

2017-01-31

Physical and functional interplays between genes or proteins have important biological meaning for cellular functions. Some efforts have been made to construct weighted gene association meta-networks by integrating multiple biological resources, where the weight indicates the confidence of the interaction. However, it is found that these existing human gene association networks share only quite limited overlapped interactions, suggesting their incompleteness and noise. Here we proposed a workflow to construct a weighted human gene association network using information of six existing networks, including two weighted specific PPI networks and four gene association meta-networks. We applied link prediction algorithm to predict possible missing links of the networks, cross-validation approach to refine each network and finally integrated the refined networks to get the final integrated network. The common information among the refined networks increases notably, suggesting their higher reliability. Our final integrated network owns much more links than most of the original networks, meanwhile its links still keep high functional relevance. Being used as background network in a case study of disease gene prediction, the final integrated network presents good performance, implying its reliability and application significance. Our workflow could be insightful for integrating and refining existing gene association data.

Network-based prediction and knowledge mining of disease genes.

Science.gov (United States)

Carson, Matthew B; Lu, Hui

2015-01-01

In recent years, high-throughput protein interaction identification methods have generated a large amount of data. When combined with the results from other in vivo and in vitro experiments, a complex set of relationships between biological molecules emerges. The growing popularity of network analysis and data mining has allowed researchers to recognize indirect connections between these molecules. Due to the interdependent nature of network entities, evaluating proteins in this context can reveal relationships that may not otherwise be evident. We examined the human protein interaction network as it relates to human illness using the Disease Ontology. After calculating several topological metrics, we trained an alternating decision tree (ADTree) classifier to identify disease-associated proteins. Using a bootstrapping method, we created a tree to highlight conserved characteristics shared by many of these proteins. Subsequently, we reviewed a set of non-disease-associated proteins that were misclassified by the algorithm with high confidence and searched for evidence of a disease relationship. Our classifier was able to predict disease-related genes with 79% area under the receiver operating characteristic (ROC) curve (AUC), which indicates the tradeoff between sensitivity and specificity and is a good predictor of how a classifier will perform on future data sets. We found that a combination of several network characteristics including degree centrality, disease neighbor ratio, eccentricity, and neighborhood connectivity help to distinguish between disease- and non-disease-related proteins. Furthermore, the ADTree allowed us to understand which combinations of strongly predictive attributes contributed most to protein-disease classification. In our post-processing evaluation, we found several examples of potential novel disease-related proteins and corresponding literature evidence. In addition, we showed that first- and second-order neighbors in the PPI network

iGPCR-drug: a web server for predicting interaction between GPCRs and drugs in cellular networking.

Directory of Open Access Journals (Sweden)

Xuan Xiao

Full Text Available Involved in many diseases such as cancer, diabetes, neurodegenerative, inflammatory and respiratory disorders, G-protein-coupled receptors (GPCRs are among the most frequent targets of therapeutic drugs. It is time-consuming and expensive to determine whether a drug and a GPCR are to interact with each other in a cellular network purely by means of experimental techniques. Although some computational methods were developed in this regard based on the knowledge of the 3D (dimensional structure of protein, unfortunately their usage is quite limited because the 3D structures for most GPCRs are still unknown. To overcome the situation, a sequence-based classifier, called "iGPCR-drug", was developed to predict the interactions between GPCRs and drugs in cellular networking. In the predictor, the drug compound is formulated by a 2D (dimensional fingerprint via a 256D vector, GPCR by the PseAAC (pseudo amino acid composition generated with the grey model theory, and the prediction engine is operated by the fuzzy K-nearest neighbour algorithm. Moreover, a user-friendly web-server for iGPCR-drug was established at http://www.jci-bioinfo.cn/iGPCR-Drug/. For the convenience of most experimental scientists, a step-by-step guide is provided on how to use the web-server to get the desired results without the need to follow the complicated math equations presented in this paper just for its integrity. The overall success rate achieved by iGPCR-drug via the jackknife test was 85.5%, which is remarkably higher than the rate by the existing peer method developed in 2010 although no web server was ever established for it. It is anticipated that iGPCR-Drug may become a useful high throughput tool for both basic research and drug development, and that the approach presented here can also be extended to study other drug - target interaction networks.

Prediction of the anti-inflammatory mechanisms of curcumin by module-based protein interaction network analysis

Directory of Open Access Journals (Sweden)

Yanxiong Gan

2015-11-01

Full Text Available Curcumin, the medically active component from Curcuma longa (Turmeric, is widely used to treat inflammatory diseases. Protein interaction network (PIN analysis was used to predict its mechanisms of molecular action. Targets of curcumin were obtained based on ChEMBL and STITCH databases. Protein–protein interactions (PPIs were extracted from the String database. The PIN of curcumin was constructed by Cytoscape and the function modules identified by gene ontology (GO enrichment analysis based on molecular complex detection (MCODE. A PIN of curcumin with 482 nodes and 1688 interactions was constructed, which has scale-free, small world and modular properties. Based on analysis of these function modules, the mechanism of curcumin is proposed. Two modules were found to be intimately associated with inflammation. With function modules analysis, the anti-inflammatory effects of curcumin were related to SMAD, ERG and mediation by the TLR family. TLR9 may be a potential target of curcumin to treat inflammation.

The Prediction of Key Cytoskeleton Components Involved in Glomerular Diseases Based on a Protein-Protein Interaction Network.

Science.gov (United States)

Ding, Fangrui; Tan, Aidi; Ju, Wenjun; Li, Xuejuan; Li, Shao; Ding, Jie

2016-01-01

Maintenance of the physiological morphologies of different types of cells and tissues is essential for the normal functioning of each system in the human body. Dynamic variations in cell and tissue morphologies depend on accurate adjustments of the cytoskeletal system. The cytoskeletal system in the glomerulus plays a key role in the normal process of kidney filtration. To enhance the understanding of the possible roles of the cytoskeleton in glomerular diseases, we constructed the Glomerular Cytoskeleton Network (GCNet), which shows the protein-protein interaction network in the glomerulus, and identified several possible key cytoskeletal components involved in glomerular diseases. In this study, genes/proteins annotated to the cytoskeleton were detected by Gene Ontology analysis, and glomerulus-enriched genes were selected from nine available glomerular expression datasets. Then, the GCNet was generated by combining these two sets of information. To predict the possible key cytoskeleton components in glomerular diseases, we then examined the common regulation of the genes in GCNet in the context of five glomerular diseases based on their transcriptomic data. As a result, twenty-one cytoskeleton components as potential candidate were highlighted for consistently down- or up-regulating in all five glomerular diseases. And then, these candidates were examined in relation to existing known glomerular diseases and genes to determine their possible functions and interactions. In addition, the mRNA levels of these candidates were also validated in a puromycin aminonucleoside(PAN) induced rat nephropathy model and were also matched with existing Diabetic Nephropathy (DN) transcriptomic data. As a result, there are 15 of 21 candidates in PAN induced nephropathy model were consistent with our predication and also 12 of 21 candidates were matched with differentially expressed genes in the DN transcriptomic data. By providing a novel interaction network and prediction, GCNet

Efficient prediction of human protein-protein interactions at a global scale.

Science.gov (United States)

Schoenrock, Andrew; Samanfar, Bahram; Pitre, Sylvain; Hooshyar, Mohsen; Jin, Ke; Phillips, Charles A; Wang, Hui; Phanse, Sadhna; Omidi, Katayoun; Gui, Yuan; Alamgir, Md; Wong, Alex; Barrenäs, Fredrik; Babu, Mohan; Benson, Mikael; Langston, Michael A; Green, James R; Dehne, Frank; Golshani, Ashkan

2014-12-10

Our knowledge of global protein-protein interaction (PPI) networks in complex organisms such as humans is hindered by technical limitations of current methods. On the basis of short co-occurring polypeptide regions, we developed a tool called MP-PIPE capable of predicting a global human PPI network within 3 months. With a recall of 23% at a precision of 82.1%, we predicted 172,132 putative PPIs. We demonstrate the usefulness of these predictions through a range of experiments. The speed and accuracy associated with MP-PIPE can make this a potential tool to study individual human PPI networks (from genomic sequences alone) for personalized medicine.

Systems pharmacology - Towards the modeling of network interactions.

Science.gov (United States)

Danhof, Meindert

2016-10-30

Mechanism-based pharmacokinetic and pharmacodynamics (PKPD) and disease system (DS) models have been introduced in drug discovery and development research, to predict in a quantitative manner the effect of drug treatment in vivo in health and disease. This requires consideration of several fundamental properties of biological systems behavior including: hysteresis, non-linearity, variability, interdependency, convergence, resilience, and multi-stationarity. Classical physiology-based PKPD models consider linear transduction pathways, connecting processes on the causal path between drug administration and effect, as the basis of drug action. Depending on the drug and its biological target, such models may contain expressions to characterize i) the disposition and the target site distribution kinetics of the drug under investigation, ii) the kinetics of target binding and activation and iii) the kinetics of transduction. When connected to physiology-based DS models, PKPD models can characterize the effect on disease progression in a mechanistic manner. These models have been found useful to characterize hysteresis and non-linearity, yet they fail to explain the effects of the other fundamental properties of biological systems behavior. Recently systems pharmacology has been introduced as novel approach to predict in vivo drug effects, in which biological networks rather than single transduction pathways are considered as the basis of drug action and disease progression. These models contain expressions to characterize the functional interactions within a biological network. Such interactions are relevant when drugs act at multiple targets in the network or when homeostatic feedback mechanisms are operative. As a result systems pharmacology models are particularly useful to describe complex patterns of drug action (i.e. synergy, oscillatory behavior) and disease progression (i.e. episodic disorders). In this contribution it is shown how physiology-based PKPD and

A domain-based approach to predict protein-protein interactions

Directory of Open Access Journals (Sweden)

Resat Haluk

2007-06-01

Full Text Available Abstract Background Knowing which proteins exist in a certain organism or cell type and how these proteins interact with each other are necessary for the understanding of biological processes at the whole cell level. The determination of the protein-protein interaction (PPI networks has been the subject of extensive research. Despite the development of reasonably successful methods, serious technical difficulties still exist. In this paper we present DomainGA, a quantitative computational approach that uses the information about the domain-domain interactions to predict the interactions between proteins. Results DomainGA is a multi-parameter optimization method in which the available PPI information is used to derive a quantitative scoring scheme for the domain-domain pairs. Obtained domain interaction scores are then used to predict whether a pair of proteins interacts. Using the yeast PPI data and a series of tests, we show the robustness and insensitivity of the DomainGA method to the selection of the parameter sets, score ranges, and detection rules. Our DomainGA method achieves very high explanation ratios for the positive and negative PPIs in yeast. Based on our cross-verification tests on human PPIs, comparison of the optimized scores with the structurally observed domain interactions obtained from the iPFAM database, and sensitivity and specificity analysis; we conclude that our DomainGA method shows great promise to be applicable across multiple organisms. Conclusion We envision the DomainGA as a first step of a multiple tier approach to constructing organism specific PPIs. As it is based on fundamental structural information, the DomainGA approach can be used to create potential PPIs and the accuracy of the constructed interaction template can be further improved using complementary methods. Explanation ratios obtained in the reported test case studies clearly show that the false prediction rates of the template networks constructed

Correlated miR-mRNA expression signatures of mouse hematopoietic stem and progenitor cell subsets predict "Stemness" and "Myeloid" interaction networks.

Directory of Open Access Journals (Sweden)

Diane Heiser

Full Text Available Several individual miRNAs (miRs have been implicated as potent regulators of important processes during normal and malignant hematopoiesis. In addition, many miRs have been shown to fine-tune intricate molecular networks, in concert with other regulatory elements. In order to study hematopoietic networks as a whole, we first created a map of global miR expression during early murine hematopoiesis. Next, we determined the copy number per cell for each miR in each of the examined stem and progenitor cell types. As data is emerging indicating that miRs function robustly mainly when they are expressed above a certain threshold (∼100 copies per cell, our database provides a resource for determining which miRs are expressed at a potentially functional level in each cell type. Finally, we combine our miR expression map with matched mRNA expression data and external prediction algorithms, using a Bayesian modeling approach to create a global landscape of predicted miR-mRNA interactions within each of these hematopoietic stem and progenitor cell subsets. This approach implicates several interaction networks comprising a "stemness" signature in the most primitive hematopoietic stem cell (HSC populations, as well as "myeloid" patterns associated with two branches of myeloid development.

Correlated miR-mRNA expression signatures of mouse hematopoietic stem and progenitor cell subsets predict "Stemness" and "Myeloid" interaction networks.

Science.gov (United States)

Heiser, Diane; Tan, Yee Sun; Kaplan, Ian; Godsey, Brian; Morisot, Sebastien; Cheng, Wen-Chih; Small, Donald; Civin, Curt I

2014-01-01

Several individual miRNAs (miRs) have been implicated as potent regulators of important processes during normal and malignant hematopoiesis. In addition, many miRs have been shown to fine-tune intricate molecular networks, in concert with other regulatory elements. In order to study hematopoietic networks as a whole, we first created a map of global miR expression during early murine hematopoiesis. Next, we determined the copy number per cell for each miR in each of the examined stem and progenitor cell types. As data is emerging indicating that miRs function robustly mainly when they are expressed above a certain threshold (∼100 copies per cell), our database provides a resource for determining which miRs are expressed at a potentially functional level in each cell type. Finally, we combine our miR expression map with matched mRNA expression data and external prediction algorithms, using a Bayesian modeling approach to create a global landscape of predicted miR-mRNA interactions within each of these hematopoietic stem and progenitor cell subsets. This approach implicates several interaction networks comprising a "stemness" signature in the most primitive hematopoietic stem cell (HSC) populations, as well as "myeloid" patterns associated with two branches of myeloid development.

Reconstruction and validation of RefRec: a global model for the yeast molecular interaction network.

Directory of Open Access Journals (Sweden)

Tommi Aho

2010-05-01

Full Text Available Molecular interaction networks establish all cell biological processes. The networks are under intensive research that is facilitated by new high-throughput measurement techniques for the detection, quantification, and characterization of molecules and their physical interactions. For the common model organism yeast Saccharomyces cerevisiae, public databases store a significant part of the accumulated information and, on the way to better understanding of the cellular processes, there is a need to integrate this information into a consistent reconstruction of the molecular interaction network. This work presents and validates RefRec, the most comprehensive molecular interaction network reconstruction currently available for yeast. The reconstruction integrates protein synthesis pathways, a metabolic network, and a protein-protein interaction network from major biological databases. The core of the reconstruction is based on a reference object approach in which genes, transcripts, and proteins are identified using their primary sequences. This enables their unambiguous identification and non-redundant integration. The obtained total number of different molecular species and their connecting interactions is approximately 67,000. In order to demonstrate the capacity of RefRec for functional predictions, it was used for simulating the gene knockout damage propagation in the molecular interaction network in approximately 590,000 experimentally validated mutant strains. Based on the simulation results, a statistical classifier was subsequently able to correctly predict the viability of most of the strains. The results also showed that the usage of different types of molecular species in the reconstruction is important for accurate phenotype prediction. In general, the findings demonstrate the benefits of global reconstructions of molecular interaction networks. With all the molecular species and their physical interactions explicitly modeled, our

Common neighbours and the local-community-paradigm for topological link prediction in bipartite networks

International Nuclear Information System (INIS)

Daminelli, Simone; Thomas, Josephine Maria; Durán, Claudio; Vittorio Cannistraci, Carlo

2015-01-01

Bipartite networks are powerful descriptions of complex systems characterized by two different classes of nodes and connections allowed only across but not within the two classes. Unveiling physical principles, building theories and suggesting physical models to predict bipartite links such as product-consumer connections in recommendation systems or drug–target interactions in molecular networks can provide priceless information to improve e-commerce or to accelerate pharmaceutical research. The prediction of nonobserved connections starting from those already present in the topology of a network is known as the link-prediction problem. It represents an important subject both in many-body interaction theory in physics and in new algorithms for applied tools in computer science. The rationale is that the existing connectivity structure of a network can suggest where new connections can appear with higher likelihood in an evolving network, or where nonobserved connections are missing in a partially known network. Surprisingly, current complex network theory presents a theoretical bottle-neck: a general framework for local-based link prediction directly in the bipartite domain is missing. Here, we overcome this theoretical obstacle and present a formal definition of common neighbour index and local-community-paradigm (LCP) for bipartite networks. As a consequence, we are able to introduce the first node-neighbourhood-based and LCP-based models for topological link prediction that utilize the bipartite domain. We performed link prediction evaluations in several networks of different size and of disparate origin, including technological, social and biological systems. Our models significantly improve topological prediction in many bipartite networks because they exploit local physical driving-forces that participate in the formation and organization of many real-world bipartite networks. Furthermore, we present a local-based formalism that allows to intuitively

Common neighbours and the local-community-paradigm for topological link prediction in bipartite networks

Science.gov (United States)

Daminelli, Simone; Thomas, Josephine Maria; Durán, Claudio; Vittorio Cannistraci, Carlo

2015-11-01

Bipartite networks are powerful descriptions of complex systems characterized by two different classes of nodes and connections allowed only across but not within the two classes. Unveiling physical principles, building theories and suggesting physical models to predict bipartite links such as product-consumer connections in recommendation systems or drug-target interactions in molecular networks can provide priceless information to improve e-commerce or to accelerate pharmaceutical research. The prediction of nonobserved connections starting from those already present in the topology of a network is known as the link-prediction problem. It represents an important subject both in many-body interaction theory in physics and in new algorithms for applied tools in computer science. The rationale is that the existing connectivity structure of a network can suggest where new connections can appear with higher likelihood in an evolving network, or where nonobserved connections are missing in a partially known network. Surprisingly, current complex network theory presents a theoretical bottle-neck: a general framework for local-based link prediction directly in the bipartite domain is missing. Here, we overcome this theoretical obstacle and present a formal definition of common neighbour index and local-community-paradigm (LCP) for bipartite networks. As a consequence, we are able to introduce the first node-neighbourhood-based and LCP-based models for topological link prediction that utilize the bipartite domain. We performed link prediction evaluations in several networks of different size and of disparate origin, including technological, social and biological systems. Our models significantly improve topological prediction in many bipartite networks because they exploit local physical driving-forces that participate in the formation and organization of many real-world bipartite networks. Furthermore, we present a local-based formalism that allows to intuitively

A comprehensive comparison of network similarities for link prediction and spurious link elimination

Science.gov (United States)

Zhang, Peng; Qiu, Dan; Zeng, An; Xiao, Jinghua

2018-06-01

Identifying missing interactions in complex networks, known as link prediction, is realized by estimating the likelihood of the existence of a link between two nodes according to the observed links and nodes' attributes. Similar approaches have also been employed to identify and remove spurious links in networks which is crucial for improving the reliability of network data. In network science, the likelihood for two nodes having a connection strongly depends on their structural similarity. The key to address these two problems thus becomes how to objectively measure the similarity between nodes in networks. In the literature, numerous network similarity metrics have been proposed and their accuracy has been discussed independently in previous works. In this paper, we systematically compare the accuracy of 18 similarity metrics in both link prediction and spurious link elimination when the observed networks are very sparse or consist of inaccurate linking information. Interestingly, some methods have high prediction accuracy, they tend to perform low accuracy in identification spurious interaction. We further find that methods can be classified into several cluster according to their behaviors. This work is useful for guiding future use of these similarity metrics for different purposes.

Protein secondary structure prediction using modular reciprocal bidirectional recurrent neural networks.

Science.gov (United States)

Babaei, Sepideh; Geranmayeh, Amir; Seyyedsalehi, Seyyed Ali

2010-12-01

The supervised learning of recurrent neural networks well-suited for prediction of protein secondary structures from the underlying amino acids sequence is studied. Modular reciprocal recurrent neural networks (MRR-NN) are proposed to model the strong correlations between adjacent secondary structure elements. Besides, a multilayer bidirectional recurrent neural network (MBR-NN) is introduced to capture the long-range intramolecular interactions between amino acids in formation of the secondary structure. The final modular prediction system is devised based on the interactive integration of the MRR-NN and the MBR-NN structures to arbitrarily engage the neighboring effects of the secondary structure types concurrent with memorizing the sequential dependencies of amino acids along the protein chain. The advanced combined network augments the percentage accuracy (Q₃) to 79.36% and boosts the segment overlap (SOV) up to 70.09% when tested on the PSIPRED dataset in three-fold cross-validation. Copyright © 2010 Elsevier Ireland Ltd. All rights reserved.

Predicting metabolic pathways by sub-network extraction.

Science.gov (United States)

Faust, Karoline; van Helden, Jacques

2012-01-01

Various methods result in groups of functionally related genes obtained from genomes (operons, regulons, syntheny groups, and phylogenetic profiles), transcriptomes (co-expression groups) and proteomes (modules of interacting proteins). When such groups contain two or more enzyme-coding genes, graph analysis methods can be applied to extract a metabolic pathway that interconnects them. We describe here the way to use the Pathway extraction tool available on the NeAT Web server ( http://rsat.ulb.ac.be/neat/ ) to piece together the metabolic pathway from a group of associated, enzyme-coding genes. The tool identifies the reactions that can be catalyzed by the products of the query genes (seed reactions), and applies sub-graph extraction algorithms to extract from a metabolic network a sub-network that connects the seed reactions. This sub-network represents the predicted metabolic pathway. We describe here the pathway prediction process in a step-by-step way, give hints about the main parametric choices, and illustrate how this tool can be used to extract metabolic pathways from bacterial genomes, on the basis of two study cases: the isoleucine-valine operon in Escherichia coli and a predicted operon in Cupriavidus (Ralstonia) metallidurans.

Multiple genetic interaction experiments provide complementary information useful for gene function prediction.

Directory of Open Access Journals (Sweden)

Magali Michaut

Full Text Available Genetic interactions help map biological processes and their functional relationships. A genetic interaction is defined as a deviation from the expected phenotype when combining multiple genetic mutations. In Saccharomyces cerevisiae, most genetic interactions are measured under a single phenotype - growth rate in standard laboratory conditions. Recently genetic interactions have been collected under different phenotypic readouts and experimental conditions. How different are these networks and what can we learn from their differences? We conducted a systematic analysis of quantitative genetic interaction networks in yeast performed under different experimental conditions. We find that networks obtained using different phenotypic readouts, in different conditions and from different laboratories overlap less than expected and provide significant unique information. To exploit this information, we develop a novel method to combine individual genetic interaction data sets and show that the resulting network improves gene function prediction performance, demonstrating that individual networks provide complementary information. Our results support the notion that using diverse phenotypic readouts and experimental conditions will substantially increase the amount of gene function information produced by genetic interaction screens.

COMPUTING THERAPY FOR PRECISION MEDICINE: COLLABORATIVE FILTERING INTEGRATES AND PREDICTS MULTI-ENTITY INTERACTIONS.

Science.gov (United States)

Regenbogen, Sam; Wilkins, Angela D; Lichtarge, Olivier

2016-01-01

Biomedicine produces copious information it cannot fully exploit. Specifically, there is considerable need to integrate knowledge from disparate studies to discover connections across domains. Here, we used a Collaborative Filtering approach, inspired by online recommendation algorithms, in which non-negative matrix factorization (NMF) predicts interactions among chemicals, genes, and diseases only from pairwise information about their interactions. Our approach, applied to matrices derived from the Comparative Toxicogenomics Database, successfully recovered Chemical-Disease, Chemical-Gene, and Disease-Gene networks in 10-fold cross-validation experiments. Additionally, we could predict each of these interaction matrices from the other two. Integrating all three CTD interaction matrices with NMF led to good predictions of STRING, an independent, external network of protein-protein interactions. Finally, this approach could integrate the CTD and STRING interaction data to improve Chemical-Gene cross-validation performance significantly, and, in a time-stamped study, it predicted information added to CTD after a given date, using only data prior to that date. We conclude that collaborative filtering can integrate information across multiple types of biological entities, and that as a first step towards precision medicine it can compute drug repurposing hypotheses.

DiffSLC: A graph centrality method to detect essential proteins of a protein-protein interaction network.

Science.gov (United States)

Mistry, Divya; Wise, Roger P; Dickerson, Julie A

2017-01-01

Identification of central genes and proteins in biomolecular networks provides credible candidates for pathway analysis, functional analysis, and essentiality prediction. The DiffSLC centrality measure predicts central and essential genes and proteins using a protein-protein interaction network. Network centrality measures prioritize nodes and edges based on their importance to the network topology. These measures helped identify critical genes and proteins in biomolecular networks. The proposed centrality measure, DiffSLC, combines the number of interactions of a protein and the gene coexpression values of genes from which those proteins were translated, as a weighting factor to bias the identification of essential proteins in a protein interaction network. Potentially essential proteins with low node degree are promoted through eigenvector centrality. Thus, the gene coexpression values are used in conjunction with the eigenvector of the network's adjacency matrix and edge clustering coefficient to improve essentiality prediction. The outcome of this prediction is shown using three variations: (1) inclusion or exclusion of gene co-expression data, (2) impact of different coexpression measures, and (3) impact of different gene expression data sets. For a total of seven networks, DiffSLC is compared to other centrality measures using Saccharomyces cerevisiae protein interaction networks and gene expression data. Comparisons are also performed for the top ranked proteins against the known essential genes from the Saccharomyces Gene Deletion Project, which show that DiffSLC detects more essential proteins and has a higher area under the ROC curve than other compared methods. This makes DiffSLC a stronger alternative to other centrality methods for detecting essential genes using a protein-protein interaction network that obeys centrality-lethality principle. DiffSLC is implemented using the igraph package in R, and networkx package in Python. The python package can be

Minimum curvilinearity to enhance topological prediction of protein interactions by network embedding

KAUST Repository

Cannistraci, Carlo; Alanis Lobato, Gregorio; Ravasi, Timothy

2013-01-01

Motivation: Most functions within the cell emerge thanks to protein-protein interactions (PPIs), yet experimental determination of PPIs is both expensive and time-consuming. PPI networks present significant levels of noise and incompleteness

Digital Ecology: Coexistence and Domination among Interacting Networks

Science.gov (United States)

Kleineberg, Kaj-Kolja; Boguñá, Marián

2015-05-01

The overwhelming success of Web 2.0, within which online social networks are key actors, has induced a paradigm shift in the nature of human interactions. The user-driven character of Web 2.0 services has allowed researchers to quantify large-scale social patterns for the first time. However, the mechanisms that determine the fate of networks at the system level are still poorly understood. For instance, the simultaneous existence of multiple digital services naturally raises questions concerning which conditions these services can coexist under. Analogously to the case of population dynamics, the digital world forms a complex ecosystem of interacting networks. The fitness of each network depends on its capacity to attract and maintain users’ attention, which constitutes a limited resource. In this paper, we introduce an ecological theory of the digital world which exhibits stable coexistence of several networks as well as the dominance of an individual one, in contrast to the competitive exclusion principle. Interestingly, our theory also predicts that the most probable outcome is the coexistence of a moderate number of services, in agreement with empirical observations.

Network traffic anomaly prediction using Artificial Neural Network

Science.gov (United States)

Ciptaningtyas, Hening Titi; Fatichah, Chastine; Sabila, Altea

2017-03-01

As the excessive increase of internet usage, the malicious software (malware) has also increase significantly. Malware is software developed by hacker for illegal purpose(s), such as stealing data and identity, causing computer damage, or denying service to other user[1]. Malware which attack computer or server often triggers network traffic anomaly phenomena. Based on Sophos's report[2], Indonesia is the riskiest country of malware attack and it also has high network traffic anomaly. This research uses Artificial Neural Network (ANN) to predict network traffic anomaly based on malware attack in Indonesia which is recorded by Id-SIRTII/CC (Indonesia Security Incident Response Team on Internet Infrastructure/Coordination Center). The case study is the highest malware attack (SQL injection) which has happened in three consecutive years: 2012, 2013, and 2014[4]. The data series is preprocessed first, then the network traffic anomaly is predicted using Artificial Neural Network and using two weight update algorithms: Gradient Descent and Momentum. Error of prediction is calculated using Mean Squared Error (MSE) [7]. The experimental result shows that MSE for SQL Injection is 0.03856. So, this approach can be used to predict network traffic anomaly.

Supervised maximum-likelihood weighting of composite protein networks for complex prediction

Directory of Open Access Journals (Sweden)

Yong Chern Han

2012-12-01

Full Text Available Abstract Background Protein complexes participate in many important cellular functions, so finding the set of existent complexes is essential for understanding the organization and regulation of processes in the cell. With the availability of large amounts of high-throughput protein-protein interaction (PPI data, many algorithms have been proposed to discover protein complexes from PPI networks. However, such approaches are hindered by the high rate of noise in high-throughput PPI data, including spurious and missing interactions. Furthermore, many transient interactions are detected between proteins that are not from the same complex, while not all proteins from the same complex may actually interact. As a result, predicted complexes often do not match true complexes well, and many true complexes go undetected. Results We address these challenges by integrating PPI data with other heterogeneous data sources to construct a composite protein network, and using a supervised maximum-likelihood approach to weight each edge based on its posterior probability of belonging to a complex. We then use six different clustering algorithms, and an aggregative clustering strategy, to discover complexes in the weighted network. We test our method on Saccharomyces cerevisiae and Homo sapiens, and show that complex discovery is improved: compared to previously proposed supervised and unsupervised weighting approaches, our method recalls more known complexes, achieves higher precision at all recall levels, and generates novel complexes of greater functional similarity. Furthermore, our maximum-likelihood approach allows learned parameters to be used to visualize and evaluate the evidence of novel predictions, aiding human judgment of their credibility. Conclusions Our approach integrates multiple data sources with supervised learning to create a weighted composite protein network, and uses six clustering algorithms with an aggregative clustering strategy to

Integration of relational and hierarchical network information for protein function prediction

Directory of Open Access Journals (Sweden)

Jiang Xiaoyu

2008-08-01

Full Text Available Abstract Background In the current climate of high-throughput computational biology, the inference of a protein's function from related measurements, such as protein-protein interaction relations, has become a canonical task. Most existing technologies pursue this task as a classification problem, on a term-by-term basis, for each term in a database, such as the Gene Ontology (GO database, a popular rigorous vocabulary for biological functions. However, ontology structures are essentially hierarchies, with certain top to bottom annotation rules which protein function predictions should in principle follow. Currently, the most common approach to imposing these hierarchical constraints on network-based classifiers is through the use of transitive closure to predictions. Results We propose a probabilistic framework to integrate information in relational data, in the form of a protein-protein interaction network, and a hierarchically structured database of terms, in the form of the GO database, for the purpose of protein function prediction. At the heart of our framework is a factorization of local neighborhood information in the protein-protein interaction network across successive ancestral terms in the GO hierarchy. We introduce a classifier within this framework, with computationally efficient implementation, that produces GO-term predictions that naturally obey a hierarchical 'true-path' consistency from root to leaves, without the need for further post-processing. Conclusion A cross-validation study, using data from the yeast Saccharomyces cerevisiae, shows our method offers substantial improvements over both standard 'guilt-by-association' (i.e., Nearest-Neighbor and more refined Markov random field methods, whether in their original form or when post-processed to artificially impose 'true-path' consistency. Further analysis of the results indicates that these improvements are associated with increased predictive capabilities (i.e., increased

Design of a tripartite network for the prediction of drug targets

Science.gov (United States)

Kunimoto, Ryo; Bajorath, Jürgen

2018-02-01

Drug-target networks have aided in many target prediction studies aiming at drug repurposing or the analysis of side effects. Conventional drug-target networks are bipartite. They contain two different types of nodes representing drugs and targets, respectively, and edges indicating pairwise drug-target interactions. In this work, we introduce a tripartite network consisting of drugs, other bioactive compounds, and targets from different sources. On the basis of analog relationships captured in the network and so-called neighbor targets of drugs, new drug targets can be inferred. The tripartite network was found to have a stable structure and simulated network growth was accompanied by a steady increase in assortativity, reflecting increasing correlation between degrees of connected nodes leading to even network connectivity. Local drug environments in the tripartite network typically contained neighbor targets and revealed interesting drug-compound-target relationships for further analysis. Candidate targets were prioritized. The tripartite network design extends standard drug-target networks and provides additional opportunities for drug target prediction.

Prediction of Protein–Protein Interactions by Evidence Combining Methods

Directory of Open Access Journals (Sweden)

Ji-Wei Chang

2016-11-01

Full Text Available Most cellular functions involve proteins’ features based on their physical interactions with other partner proteins. Sketching a map of protein–protein interactions (PPIs is therefore an important inception step towards understanding the basics of cell functions. Several experimental techniques operating in vivo or in vitro have made significant contributions to screening a large number of protein interaction partners, especially high-throughput experimental methods. However, computational approaches for PPI predication supported by rapid accumulation of data generated from experimental techniques, 3D structure definitions, and genome sequencing have boosted the map sketching of PPIs. In this review, we shed light on in silico PPI prediction methods that integrate evidence from multiple sources, including evolutionary relationship, function annotation, sequence/structure features, network topology and text mining. These methods are developed for integration of multi-dimensional evidence, for designing the strategies to predict novel interactions, and for making the results consistent with the increase of prediction coverage and accuracy.

Revealing the hidden networks of interaction in mobile animal groups allows prediction of complex behavioral contagion.

Science.gov (United States)

Rosenthal, Sara Brin; Twomey, Colin R; Hartnett, Andrew T; Wu, Hai Shan; Couzin, Iain D

2015-04-14

Coordination among social animals requires rapid and efficient transfer of information among individuals, which may depend crucially on the underlying structure of the communication network. Establishing the decision-making circuits and networks that give rise to individual behavior has been a central goal of neuroscience. However, the analogous problem of determining the structure of the communication network among organisms that gives rise to coordinated collective behavior, such as is exhibited by schooling fish and flocking birds, has remained almost entirely neglected. Here, we study collective evasion maneuvers, manifested through rapid waves, or cascades, of behavioral change (a ubiquitous behavior among taxa) in schooling fish (Notemigonus crysoleucas). We automatically track the positions and body postures, calculate visual fields of all individuals in schools of ∼150 fish, and determine the functional mapping between socially generated sensory input and motor response during collective evasion. We find that individuals use simple, robust measures to assess behavioral changes in neighbors, and that the resulting networks by which behavior propagates throughout groups are complex, being weighted, directed, and heterogeneous. By studying these interaction networks, we reveal the (complex, fractional) nature of social contagion and establish that individuals with relatively few, but strongly connected, neighbors are both most socially influential and most susceptible to social influence. Furthermore, we demonstrate that we can predict complex cascades of behavioral change at their moment of initiation, before they actually occur. Consequently, despite the intrinsic stochasticity of individual behavior, establishing the hidden communication networks in large self-organized groups facilitates a quantitative understanding of behavioral contagion.

Spatiotemporal Recurrent Convolutional Networks for Traffic Prediction in Transportation Networks

Directory of Open Access Journals (Sweden)

Haiyang Yu

2017-06-01

Full Text Available Predicting large-scale transportation network traffic has become an important and challenging topic in recent decades. Inspired by the domain knowledge of motion prediction, in which the future motion of an object can be predicted based on previous scenes, we propose a network grid representation method that can retain the fine-scale structure of a transportation network. Network-wide traffic speeds are converted into a series of static images and input into a novel deep architecture, namely, spatiotemporal recurrent convolutional networks (SRCNs, for traffic forecasting. The proposed SRCNs inherit the advantages of deep convolutional neural networks (DCNNs and long short-term memory (LSTM neural networks. The spatial dependencies of network-wide traffic can be captured by DCNNs, and the temporal dynamics can be learned by LSTMs. An experiment on a Beijing transportation network with 278 links demonstrates that SRCNs outperform other deep learning-based algorithms in both short-term and long-term traffic prediction.

Spatiotemporal Recurrent Convolutional Networks for Traffic Prediction in Transportation Networks.

Science.gov (United States)

Yu, Haiyang; Wu, Zhihai; Wang, Shuqin; Wang, Yunpeng; Ma, Xiaolei

2017-06-26

Predicting large-scale transportation network traffic has become an important and challenging topic in recent decades. Inspired by the domain knowledge of motion prediction, in which the future motion of an object can be predicted based on previous scenes, we propose a network grid representation method that can retain the fine-scale structure of a transportation network. Network-wide traffic speeds are converted into a series of static images and input into a novel deep architecture, namely, spatiotemporal recurrent convolutional networks (SRCNs), for traffic forecasting. The proposed SRCNs inherit the advantages of deep convolutional neural networks (DCNNs) and long short-term memory (LSTM) neural networks. The spatial dependencies of network-wide traffic can be captured by DCNNs, and the temporal dynamics can be learned by LSTMs. An experiment on a Beijing transportation network with 278 links demonstrates that SRCNs outperform other deep learning-based algorithms in both short-term and long-term traffic prediction.

Genes2Networks: connecting lists of gene symbols using mammalian protein interactions databases

Directory of Open Access Journals (Sweden)

Ma'ayan Avi

2007-10-01

Full Text Available Abstract Background In recent years, mammalian protein-protein interaction network databases have been developed. The interactions in these databases are either extracted manually from low-throughput experimental biomedical research literature, extracted automatically from literature using techniques such as natural language processing (NLP, generated experimentally using high-throughput methods such as yeast-2-hybrid screens, or interactions are predicted using an assortment of computational approaches. Genes or proteins identified as significantly changing in proteomic experiments, or identified as susceptibility disease genes in genomic studies, can be placed in the context of protein interaction networks in order to assign these genes and proteins to pathways and protein complexes. Results Genes2Networks is a software system that integrates the content of ten mammalian interaction network datasets. Filtering techniques to prune low-confidence interactions were implemented. Genes2Networks is delivered as a web-based service using AJAX. The system can be used to extract relevant subnetworks created from "seed" lists of human Entrez gene symbols. The output includes a dynamic linkable three color web-based network map, with a statistical analysis report that identifies significant intermediate nodes used to connect the seed list. Conclusion Genes2Networks is powerful web-based software that can help experimental biologists to interpret lists of genes and proteins such as those commonly produced through genomic and proteomic experiments, as well as lists of genes and proteins associated with disease processes. This system can be used to find relationships between genes and proteins from seed lists, and predict additional genes or proteins that may play key roles in common pathways or protein complexes.

Community detection, link prediction, and layer interdependence in multilayer networks

Science.gov (United States)

De Bacco, Caterina; Power, Eleanor A.; Larremore, Daniel B.; Moore, Cristopher

2017-04-01

Complex systems are often characterized by distinct types of interactions between the same entities. These can be described as a multilayer network where each layer represents one type of interaction. These layers may be interdependent in complicated ways, revealing different kinds of structure in the network. In this work we present a generative model, and an efficient expectation-maximization algorithm, which allows us to perform inference tasks such as community detection and link prediction in this setting. Our model assumes overlapping communities that are common between the layers, while allowing these communities to affect each layer in a different way, including arbitrary mixtures of assortative, disassortative, or directed structure. It also gives us a mathematically principled way to define the interdependence between layers, by measuring how much information about one layer helps us predict links in another layer. In particular, this allows us to bundle layers together to compress redundant information and identify small groups of layers which suffice to predict the remaining layers accurately. We illustrate these findings by analyzing synthetic data and two real multilayer networks, one representing social support relationships among villagers in South India and the other representing shared genetic substring material between genes of the malaria parasite.

Human cancer protein-protein interaction network: a structural perspective.

Directory of Open Access Journals (Sweden)

Gozde Kar

2009-12-01

Full Text Available Protein-protein interaction networks provide a global picture of cellular function and biological processes. Some proteins act as hub proteins, highly connected to others, whereas some others have few interactions. The dysfunction of some interactions causes many diseases, including cancer. Proteins interact through their interfaces. Therefore, studying the interface properties of cancer-related proteins will help explain their role in the interaction networks. Similar or overlapping binding sites should be used repeatedly in single interface hub proteins, making them promiscuous. Alternatively, multi-interface hub proteins make use of several distinct binding sites to bind to different partners. We propose a methodology to integrate protein interfaces into cancer interaction networks (ciSPIN, cancer structural protein interface network. The interactions in the human protein interaction network are replaced by interfaces, coming from either known or predicted complexes. We provide a detailed analysis of cancer related human protein-protein interfaces and the topological properties of the cancer network. The results reveal that cancer-related proteins have smaller, more planar, more charged and less hydrophobic binding sites than non-cancer proteins, which may indicate low affinity and high specificity of the cancer-related interactions. We also classified the genes in ciSPIN according to phenotypes. Within phenotypes, for breast cancer, colorectal cancer and leukemia, interface properties were found to be discriminating from non-cancer interfaces with an accuracy of 71%, 67%, 61%, respectively. In addition, cancer-related proteins tend to interact with their partners through distinct interfaces, corresponding mostly to multi-interface hubs, which comprise 56% of cancer-related proteins, and constituting the nodes with higher essentiality in the network (76%. We illustrate the interface related affinity properties of two cancer-related hub

Network-based ranking methods for prediction of novel disease associated microRNAs.

Science.gov (United States)

Le, Duc-Hau

2015-10-01

Many studies have shown roles of microRNAs on human disease and a number of computational methods have been proposed to predict such associations by ranking candidate microRNAs according to their relevance to a disease. Among them, machine learning-based methods usually have a limitation in specifying non-disease microRNAs as negative training samples. Meanwhile, network-based methods are becoming dominant since they well exploit a "disease module" principle in microRNA functional similarity networks. Of which, random walk with restart (RWR) algorithm-based method is currently state-of-the-art. The use of this algorithm was inspired from its success in predicting disease gene because the "disease module" principle also exists in protein interaction networks. Besides, many algorithms designed for webpage ranking have been successfully applied in ranking disease candidate genes because web networks share topological properties with protein interaction networks. However, these algorithms have not yet been utilized for disease microRNA prediction. We constructed microRNA functional similarity networks based on shared targets of microRNAs, and then we integrated them with a microRNA functional synergistic network, which was recently identified. After analyzing topological properties of these networks, in addition to RWR, we assessed the performance of (i) PRINCE (PRIoritizatioN and Complex Elucidation), which was proposed for disease gene prediction; (ii) PageRank with Priors (PRP) and K-Step Markov (KSM), which were used for studying web networks; and (iii) a neighborhood-based algorithm. Analyses on topological properties showed that all microRNA functional similarity networks are small-worldness and scale-free. The performance of each algorithm was assessed based on average AUC values on 35 disease phenotypes and average rankings of newly discovered disease microRNAs. As a result, the performance on the integrated network was better than that on individual ones. In

Bayesian network model for identification of pathways by integrating protein interaction with genetic interaction data.

Science.gov (United States)

Fu, Changhe; Deng, Su; Jin, Guangxu; Wang, Xinxin; Yu, Zu-Guo

2017-09-21

Molecular interaction data at proteomic and genetic levels provide physical and functional insights into a molecular biosystem and are helpful for the construction of pathway structures complementarily. Despite advances in inferring biological pathways using genetic interaction data, there still exists weakness in developed models, such as, activity pathway networks (APN), when integrating the data from proteomic and genetic levels. It is necessary to develop new methods to infer pathway structure by both of interaction data. We utilized probabilistic graphical model to develop a new method that integrates genetic interaction and protein interaction data and infers exquisitely detailed pathway structure. We modeled the pathway network as Bayesian network and applied this model to infer pathways for the coherent subsets of the global genetic interaction profiles, and the available data set of endoplasmic reticulum genes. The protein interaction data were derived from the BioGRID database. Our method can accurately reconstruct known cellular pathway structures, including SWR complex, ER-Associated Degradation (ERAD) pathway, N-Glycan biosynthesis pathway, Elongator complex, Retromer complex, and Urmylation pathway. By comparing N-Glycan biosynthesis pathway and Urmylation pathway identified from our approach with that from APN, we found that our method is able to overcome its weakness (certain edges are inexplicable). According to underlying protein interaction network, we defined a simple scoring function that only adopts genetic interaction information to avoid the balance difficulty in the APN. Using the effective stochastic simulation algorithm, the performance of our proposed method is significantly high. We developed a new method based on Bayesian network to infer detailed pathway structures from interaction data at proteomic and genetic levels. The results indicate that the developed method performs better in predicting signaling pathways than previously

Network-based prediction and analysis of HIV dependency factors.

Directory of Open Access Journals (Sweden)

T M Murali

2011-09-01

Full Text Available HIV Dependency Factors (HDFs are a class of human proteins that are essential for HIV replication, but are not lethal to the host cell when silenced. Three previous genome-wide RNAi experiments identified HDF sets with little overlap. We combine data from these three studies with a human protein interaction network to predict new HDFs, using an intuitive algorithm called SinkSource and four other algorithms published in the literature. Our algorithm achieves high precision and recall upon cross validation, as do the other methods. A number of HDFs that we predict are known to interact with HIV proteins. They belong to multiple protein complexes and biological processes that are known to be manipulated by HIV. We also demonstrate that many predicted HDF genes show significantly different programs of expression in early response to SIV infection in two non-human primate species that differ in AIDS progression. Our results suggest that many HDFs are yet to be discovered and that they have potential value as prognostic markers to determine pathological outcome and the likelihood of AIDS development. More generally, if multiple genome-wide gene-level studies have been performed at independent labs to study the same biological system or phenomenon, our methodology is applicable to interpret these studies simultaneously in the context of molecular interaction networks and to ask if they reinforce or contradict each other.

Prediction of Narcissism, Perception of Social Interactions and Marital Conflicts Based on the Use of Social Networks

Directory of Open Access Journals (Sweden)

رویا رضاپور

2017-09-01

Full Text Available The prevalence of social networks and the excessive use of them by couples have had a significant impact on various aspects of their lives. The aim of this study was to investigate the role of social networks in the formation of narcissism, perception of social interaction and marital conflicts in couples who use these social networks. The study design was correlational and the statistical population included couples of Zanjan city who use social networks. 120 couples which widely used social networks were selected by random sampling. The questionnaires of Internet Addiction (Young, 1998, Narcissistic Personality (Ames and et al, 2006, Perception of Social Interaction (Glass, 1994 and Marital Conflict (Sanaei, 2000 were used. Pearson correlation coefficient and Regression were used for data analysis. This study showed that there is a significant negative relationship between the use of social networks with perception of social interaction, and a significant positive relationship between the use of social networks with narcissism and marital conflicts (P<0/01. Also narcissism has a significant positive relationship with marital conflicts, and a significant negative relationship with perception of social interaction (P<0/01. Social networks have a negative effect on couple's relationship and their feelings towards each other, as well as strengthening narcissism, which can cause communication problems, decreased positive feelings of couples towards each other and marital conflicts.

Exploration of the omics evidence landscape: adding qualitative labels to predicted protein-protein interactions.

NARCIS (Netherlands)

Noort, V. van; Snel, B.; Huynen, M.A.

2007-01-01

BACKGROUND: In the post-genomic era various functional genomics, proteomics and computational techniques have been developed to elucidate the protein interaction network. While some of these techniques are specific for a certain type of interaction, most predict a mixture of interactions.

EVALUATING AUSTRALIAN FOOTBALL LEAGUE PLAYER CONTRIBUTIONS USING INTERACTIVE NETWORK SIMULATION

Directory of Open Access Journals (Sweden)

Jonathan Sargent

2013-03-01

Full Text Available This paper focuses on the contribution of Australian Football League (AFL players to their team's on-field network by simulating player interactions within a chosen team list and estimating the net effect on final score margin. A Visual Basic computer program was written, firstly, to isolate the effective interactions between players from a particular team in all 2011 season matches and, secondly, to generate a symmetric interaction matrix for each match. Negative binomial distributions were fitted to each player pairing in the Geelong Football Club for the 2011 season, enabling an interactive match simulation model given the 22 chosen players. Dynamic player ratings were calculated from the simulated network using eigenvector centrality, a method that recognises and rewards interactions with more prominent players in the team network. The centrality ratings were recorded after every network simulation and then applied in final score margin predictions so that each player's match contribution-and, hence, an optimal team-could be estimated. The paper ultimately demonstrates that the presence of highly rated players, such as Geelong's Jimmy Bartel, provides the most utility within a simulated team network. It is anticipated that these findings will facilitate optimal AFL team selection and player substitutions, which are key areas of interest to coaches. Network simulations are also attractive for use within betting markets, specifically to provide information on the likelihood of a chosen AFL team list "covering the line".

Predicting Drug-Target Interactions Based on Small Positive Samples.

Science.gov (United States)

Hu, Pengwei; Chan, Keith C C; Hu, Yanxing

2018-01-01

A basic task in drug discovery is to find new medication in the form of candidate compounds that act on a target protein. In other words, a drug has to interact with a target and such drug-target interaction (DTI) is not expected to be random. Significant and interesting patterns are expected to be hidden in them. If these patterns can be discovered, new drugs are expected to be more easily discoverable. Currently, a number of computational methods have been proposed to predict DTIs based on their similarity. However, such as approach does not allow biochemical features to be directly considered. As a result, some methods have been proposed to try to discover patterns in physicochemical interactions. Since the number of potential negative DTIs are very high both in absolute terms and in comparison to that of the known ones, these methods are rather computationally expensive and they can only rely on subsets, rather than the full set, of negative DTIs for training and validation. As there is always a relatively high chance for negative DTIs to be falsely identified and as only partial subset of such DTIs is considered, existing approaches can be further improved to better predict DTIs. In this paper, we present a novel approach, called ODT (one class drug target interaction prediction), for such purpose. One main task of ODT is to discover association patterns between interacting drugs and proteins from the chemical structure of the former and the protein sequence network of the latter. ODT does so in two phases. First, the DTI-network is transformed to a representation by structural properties. Second, it applies a oneclass classification algorithm to build a prediction model based only on known positive interactions. We compared the best AUROC scores of the ODT with several state-of-art approaches on Gold standard data. The prediction accuracy of the ODT is superior in comparison with all the other methods at GPCRs dataset and Ion channels dataset. Performance

Identification of human disease genes from interactome network using graphlet interaction.

Directory of Open Access Journals (Sweden)

Xiao-Dong Wang

Full Text Available Identifying genes related to human diseases, such as cancer and cardiovascular disease, etc., is an important task in biomedical research because of its applications in disease diagnosis and treatment. Interactome networks, especially protein-protein interaction networks, had been used to disease genes identification based on the hypothesis that strong candidate genes tend to closely relate to each other in some kinds of measure on the network. We proposed a new measure to analyze the relationship between network nodes which was called graphlet interaction. The graphlet interaction contained 28 different isomers. The results showed that the numbers of the graphlet interaction isomers between disease genes in interactome networks were significantly larger than random picked genes, while graphlet signatures were not. Then, we designed a new type of score, based on the network properties, to identify disease genes using graphlet interaction. The genes with higher scores were more likely to be disease genes, and all candidate genes were ranked according to their scores. Then the approach was evaluated by leave-one-out cross-validation. The precision of the current approach achieved 90% at about 10% recall, which was apparently higher than the previous three predominant algorithms, random walk, Endeavour and neighborhood based method. Finally, the approach was applied to predict new disease genes related to 4 common diseases, most of which were identified by other independent experimental researches. In conclusion, we demonstrate that the graphlet interaction is an effective tool to analyze the network properties of disease genes, and the scores calculated by graphlet interaction is more precise in identifying disease genes.

Identification of Human Disease Genes from Interactome Network Using Graphlet Interaction

Science.gov (United States)

Yang, Lun; Wei, Dong-Qing; Qi, Ying-Xin; Jiang, Zong-Lai

2014-01-01

Identifying genes related to human diseases, such as cancer and cardiovascular disease, etc., is an important task in biomedical research because of its applications in disease diagnosis and treatment. Interactome networks, especially protein-protein interaction networks, had been used to disease genes identification based on the hypothesis that strong candidate genes tend to closely relate to each other in some kinds of measure on the network. We proposed a new measure to analyze the relationship between network nodes which was called graphlet interaction. The graphlet interaction contained 28 different isomers. The results showed that the numbers of the graphlet interaction isomers between disease genes in interactome networks were significantly larger than random picked genes, while graphlet signatures were not. Then, we designed a new type of score, based on the network properties, to identify disease genes using graphlet interaction. The genes with higher scores were more likely to be disease genes, and all candidate genes were ranked according to their scores. Then the approach was evaluated by leave-one-out cross-validation. The precision of the current approach achieved 90% at about 10% recall, which was apparently higher than the previous three predominant algorithms, random walk, Endeavour and neighborhood based method. Finally, the approach was applied to predict new disease genes related to 4 common diseases, most of which were identified by other independent experimental researches. In conclusion, we demonstrate that the graphlet interaction is an effective tool to analyze the network properties of disease genes, and the scores calculated by graphlet interaction is more precise in identifying disease genes. PMID:24465923

A Preliminary Examination of the Relationship Between Social Networking Interactions, Internet Use, and Thwarted Belongingness.

Science.gov (United States)

Moberg, Fallon B; Anestis, Michael D

2015-01-01

Joiner's (2005) interpersonal-psychological theory of suicide hypothesizes that suicidal desire develops in response to the joint presence of thwarted belongingness and perceived burdensomeness. To consider the potential influence of online interactions and behaviors on these outcomes. To address this, we administered an online protocol assessing suicidal desire and online interactions in a sample of 305 undergraduates (83.6% female). We hypothesized negative interactions on social networking sites and a preference for online social interactions would be associated with thwarted belongingness. We also conducted an exploratory analysis examining the associations between Internet usage and perceived burdensomeness. Higher levels of negative interactions on social networking sites, but no other variables, significantly predicted thwarted belongingness. Our exploratory analysis showed that none of our predictors were associated with perceived burdensomeness after accounting for demographics, depression, and thwarted belongingness. Our findings indicate that a general tendency to have negative interactions on social networking sites could possibly impact suicidal desire and that these effects are significant above and beyond depression symptoms. Furthermore, no other aspect of problematic Internet use significantly predicted our outcomes in multivariate analyses, indicating that social networking in particular may have a robust effect on thwarted belongingness.

Exploration of the omics evidence landscape: adding qualitative labels to predicted protein-protein interactions

NARCIS (Netherlands)

Noort, V. van; Snel, B.; Huynen, M.A.

2007-01-01

ABSTRACT: BACKGROUND: In the post-genomic era various functional genomics, proteomics and computational techniques have been developed to elucidate the protein interaction network. While some of these techniques are specific for a certain type of interaction, most predict a mixture of interactions.

Exploitation of complex network topology for link prediction in biological interactomes

KAUST Repository

Alanis Lobato, Gregorio

2014-06-01

The network representation of the interactions between proteins and genes allows for a holistic perspective of the complex machinery underlying the living cell. However, the large number of interacting entities within the cell makes network construction a daunting and arduous task, prone to errors and missing information. Fortunately, the structure of biological networks is not different from that of other complex systems, such as social networks, the world-wide web or power grids, for which growth models have been proposed to better understand their structure and function. This means that we can design tools based on these models in order to exploit the topology of biological interactomes with the aim to construct more complete and reliable maps of the cell. In this work, we propose three novel and powerful approaches for the prediction of interactions in biological networks and conclude that it is possible to mine the topology of these complex system representations and produce reliable and biologically meaningful information that enriches the datasets to which we have access today.

Exploitation of complex network topology for link prediction in biological interactomes

KAUST Repository

Alanis Lobato, Gregorio

2014-01-01

In this work, we propose three novel and powerful approaches for the prediction of interactions in biological networks and conclude that it is possible to mine the topology of these complex system representations and produce reliable

State-dependent intrinsic predictability of cortical network dynamics.

Directory of Open Access Journals (Sweden)

Leila Fakhraei

Full Text Available The information encoded in cortical circuit dynamics is fleeting, changing from moment to moment as new input arrives and ongoing intracortical interactions progress. A combination of deterministic and stochastic biophysical mechanisms governs how cortical dynamics at one moment evolve from cortical dynamics in recently preceding moments. Such temporal continuity of cortical dynamics is fundamental to many aspects of cortex function but is not well understood. Here we study temporal continuity by attempting to predict cortical population dynamics (multisite local field potential based on its own recent history in somatosensory cortex of anesthetized rats and in a computational network-level model. We found that the intrinsic predictability of cortical dynamics was dependent on multiple factors including cortical state, synaptic inhibition, and how far into the future the prediction extends. By pharmacologically tuning synaptic inhibition, we obtained a continuum of cortical states with asynchronous population activity at one extreme and stronger, spatially extended synchrony at the other extreme. Intermediate between these extremes we observed evidence for a special regime of population dynamics called criticality. Predictability of the near future (10-100 ms increased as the cortical state was tuned from asynchronous to synchronous. Predictability of the more distant future (>1 s was generally poor, but, surprisingly, was higher for asynchronous states compared to synchronous states. These experimental results were confirmed in a computational network model of spiking excitatory and inhibitory neurons. Our findings demonstrate that determinism and predictability of network dynamics depend on cortical state and the time-scale of the dynamics.

Predicting and understanding comprehensive drug-drug interactions via semi-nonnegative matrix factorization.

Science.gov (United States)

Yu, Hui; Mao, Kui-Tao; Shi, Jian-Yu; Huang, Hua; Chen, Zhi; Dong, Kai; Yiu, Siu-Ming

2018-04-11

Drug-drug interactions (DDIs) always cause unexpected and even adverse drug reactions. It is important to identify DDIs before drugs are used in the market. However, preclinical identification of DDIs requires much money and time. Computational approaches have exhibited their abilities to predict potential DDIs on a large scale by utilizing pre-market drug properties (e.g. chemical structure). Nevertheless, none of them can predict two comprehensive types of DDIs, including enhancive and degressive DDIs, which increases and decreases the behaviors of the interacting drugs respectively. There is a lack of systematic analysis on the structural relationship among known DDIs. Revealing such a relationship is very important, because it is able to help understand how DDIs occur. Both the prediction of comprehensive DDIs and the discovery of structural relationship among them play an important guidance when making a co-prescription. In this work, treating a set of comprehensive DDIs as a signed network, we design a novel model (DDINMF) for the prediction of enhancive and degressive DDIs based on semi-nonnegative matrix factorization. Inspiringly, DDINMF achieves the conventional DDI prediction (AUROC = 0.872 and AUPR = 0.605) and the comprehensive DDI prediction (AUROC = 0.796 and AUPR = 0.579). Compared with two state-of-the-art approaches, DDINMF shows it superiority. Finally, representing DDIs as a binary network and a signed network respectively, an analysis based on NMF reveals crucial knowledge hidden among DDIs. Our approach is able to predict not only conventional binary DDIs but also comprehensive DDIs. More importantly, it reveals several key points about the DDI network: (1) both binary and signed networks show fairly clear clusters, in which both drug degree and the difference between positive degree and negative degree show significant distribution; (2) the drugs having large degrees tend to have a larger difference between positive degree

Defining the protein interaction network of human malaria parasite Plasmodium falciparum

KAUST Repository

Ramaprasad, Abhinay

2012-02-01

Malaria, caused by the protozoan parasite Plasmodium falciparum, affects around 225. million people yearly and a huge international effort is directed towards combating this grave threat to world health and economic development. Considerable advances have been made in malaria research triggered by the sequencing of its genome in 2002, followed by several high-throughput studies defining the malaria transcriptome and proteome. A protein-protein interaction (PPI) network seeks to trace the dynamic interactions between proteins, thereby elucidating their local and global functional relationships. Experimentally derived PPI network from high-throughput methods such as yeast two hybrid (Y2H) screens are inherently noisy, but combining these independent datasets by computational methods tends to give a greater accuracy and coverage. This review aims to discuss the computational approaches used till date to construct a malaria protein interaction network and to catalog the functional predictions and biological inferences made from analysis of the PPI network. © 2011 Elsevier Inc.

Modeling interacting dynamic networks: II. Systematic study of the statistical properties of cross-links between two networks with preferred degrees

International Nuclear Information System (INIS)

Liu, Wenjia; Schmittmann, B; Zia, R K P

2014-01-01

In a recent work (Liu et al, 2013 J. Stat. Mech. P08001), we introduced dynamic networks with preferred degrees and presented simulation and analytic studies of a single, homogeneous system as well as two interacting networks. Here, we extend these studies to a wider range of parameter space, in a more systematic fashion. Though the interaction we introduced seems simple and intuitive, it produced dramatically different behavior in the single- and two-network systems. Specifically, partitioning the single network into two identical sectors, we find the cross-link distribution to be a sharply peaked Gaussian. In stark contrast, we find a very broad and flat plateau in the case of two interacting identical networks. A sound understanding of this phenomenon remains elusive. Exploring more asymmetric interacting networks, we discover a kind of ‘universal behavior’ for systems in which the ‘introverts’ (nodes with smaller preferred degree) are far outnumbered. Remarkably, an approximation scheme for their degree distribution can be formulated, leading to very successful predictions. (paper)

Predicting Genes Involved in Human Cancer Using Network Contextual Information

Directory of Open Access Journals (Sweden)

Rahmani Hossein

2012-03-01

Full Text Available Protein-Protein Interaction (PPI networks have been widely used for the task of predicting proteins involved in cancer. Previous research has shown that functional information about the protein for which a prediction is made, proximity to specific other proteins in the PPI network, as well as local network structure are informative features in this respect. In this work, we introduce two new types of input features, reflecting additional information: (1 Functional Context: the functions of proteins interacting with the target protein (rather than the protein itself; and (2 Structural Context: the relative position of the target protein with respect to specific other proteins selected according to a novel ANOVA (analysis of variance based measure. We also introduce a selection strategy to pinpoint the most informative features. Results show that the proposed feature types and feature selection strategy yield informative features. A standard machine learning method (Naive Bayes that uses the features proposed here outperforms the current state-of-the-art methods by more than 5% with respect to F-measure. In addition, manual inspection confirms the biological relevance of the top-ranked features.

Prediction of host - pathogen protein interactions between Mycobacterium tuberculosis and Homo sapiens using sequence motifs.

Science.gov (United States)

Huo, Tong; Liu, Wei; Guo, Yu; Yang, Cheng; Lin, Jianping; Rao, Zihe

2015-03-26

Emergence of multiple drug resistant strains of M. tuberculosis (MDR-TB) threatens to derail global efforts aimed at reigning in the pathogen. Co-infections of M. tuberculosis with HIV are difficult to treat. To counter these new challenges, it is essential to study the interactions between M. tuberculosis and the host to learn how these bacteria cause disease. We report a systematic flow to predict the host pathogen interactions (HPIs) between M. tuberculosis and Homo sapiens based on sequence motifs. First, protein sequences were used as initial input for identifying the HPIs by 'interolog' method. HPIs were further filtered by prediction of domain-domain interactions (DDIs). Functional annotations of protein and publicly available experimental results were applied to filter the remaining HPIs. Using such a strategy, 118 pairs of HPIs were identified, which involve 43 proteins from M. tuberculosis and 48 proteins from Homo sapiens. A biological interaction network between M. tuberculosis and Homo sapiens was then constructed using the predicted inter- and intra-species interactions based on the 118 pairs of HPIs. Finally, a web accessible database named PATH (Protein interactions of M. tuberculosis and Human) was constructed to store these predicted interactions and proteins. This interaction network will facilitate the research on host-pathogen protein-protein interactions, and may throw light on how M. tuberculosis interacts with its host.

Effective comparative analysis of protein-protein interaction networks by measuring the steady-state network flow using a Markov model.

Science.gov (United States)

Jeong, Hyundoo; Qian, Xiaoning; Yoon, Byung-Jun

2016-10-06

Comparative analysis of protein-protein interaction (PPI) networks provides an effective means of detecting conserved functional network modules across different species. Such modules typically consist of orthologous proteins with conserved interactions, which can be exploited to computationally predict the modules through network comparison. In this work, we propose a novel probabilistic framework for comparing PPI networks and effectively predicting the correspondence between proteins, represented as network nodes, that belong to conserved functional modules across the given PPI networks. The basic idea is to estimate the steady-state network flow between nodes that belong to different PPI networks based on a Markov random walk model. The random walker is designed to make random moves to adjacent nodes within a PPI network as well as cross-network moves between potential orthologous nodes with high sequence similarity. Based on this Markov random walk model, we estimate the steady-state network flow - or the long-term relative frequency of the transitions that the random walker makes - between nodes in different PPI networks, which can be used as a probabilistic score measuring their potential correspondence. Subsequently, the estimated scores can be used for detecting orthologous proteins in conserved functional modules through network alignment. Through evaluations based on multiple real PPI networks, we demonstrate that the proposed scheme leads to improved alignment results that are biologically more meaningful at reduced computational cost, outperforming the current state-of-the-art algorithms. The source code and datasets can be downloaded from http://www.ece.tamu.edu/~bjyoon/CUFID .

Module discovery by exhaustive search for densely connected, co-expressed regions in biomolecular interaction networks.

Directory of Open Access Journals (Sweden)

Recep Colak

2010-10-01

Full Text Available Computational prediction of functionally related groups of genes (functional modules from large-scale data is an important issue in computational biology. Gene expression experiments and interaction networks are well studied large-scale data sources, available for many not yet exhaustively annotated organisms. It has been well established, when analyzing these two data sources jointly, modules are often reflected by highly interconnected (dense regions in the interaction networks whose participating genes are co-expressed. However, the tractability of the problem had remained unclear and methods by which to exhaustively search for such constellations had not been presented.We provide an algorithmic framework, referred to as Densely Connected Biclustering (DECOB, by which the aforementioned search problem becomes tractable. To benchmark the predictive power inherent to the approach, we computed all co-expressed, dense regions in physical protein and genetic interaction networks from human and yeast. An automatized filtering procedure reduces our output which results in smaller collections of modules, comparable to state-of-the-art approaches. Our results performed favorably in a fair benchmarking competition which adheres to standard criteria. We demonstrate the usefulness of an exhaustive module search, by using the unreduced output to more quickly perform GO term related function prediction tasks. We point out the advantages of our exhaustive output by predicting functional relationships using two examples.We demonstrate that the computation of all densely connected and co-expressed regions in interaction networks is an approach to module discovery of considerable value. Beyond confirming the well settled hypothesis that such co-expressed, densely connected interaction network regions reflect functional modules, we open up novel computational ways to comprehensively analyze the modular organization of an organism based on prevalent and largely

Module discovery by exhaustive search for densely connected, co-expressed regions in biomolecular interaction networks.

Science.gov (United States)

Colak, Recep; Moser, Flavia; Chu, Jeffrey Shih-Chieh; Schönhuth, Alexander; Chen, Nansheng; Ester, Martin

2010-10-25

Computational prediction of functionally related groups of genes (functional modules) from large-scale data is an important issue in computational biology. Gene expression experiments and interaction networks are well studied large-scale data sources, available for many not yet exhaustively annotated organisms. It has been well established, when analyzing these two data sources jointly, modules are often reflected by highly interconnected (dense) regions in the interaction networks whose participating genes are co-expressed. However, the tractability of the problem had remained unclear and methods by which to exhaustively search for such constellations had not been presented. We provide an algorithmic framework, referred to as Densely Connected Biclustering (DECOB), by which the aforementioned search problem becomes tractable. To benchmark the predictive power inherent to the approach, we computed all co-expressed, dense regions in physical protein and genetic interaction networks from human and yeast. An automatized filtering procedure reduces our output which results in smaller collections of modules, comparable to state-of-the-art approaches. Our results performed favorably in a fair benchmarking competition which adheres to standard criteria. We demonstrate the usefulness of an exhaustive module search, by using the unreduced output to more quickly perform GO term related function prediction tasks. We point out the advantages of our exhaustive output by predicting functional relationships using two examples. We demonstrate that the computation of all densely connected and co-expressed regions in interaction networks is an approach to module discovery of considerable value. Beyond confirming the well settled hypothesis that such co-expressed, densely connected interaction network regions reflect functional modules, we open up novel computational ways to comprehensively analyze the modular organization of an organism based on prevalent and largely available large

A network approach to predict pathogenic genes for Fusarium graminearum.

Science.gov (United States)

Liu, Xiaoping; Tang, Wei-Hua; Zhao, Xing-Ming; Chen, Luonan

2010-10-04

Fusarium graminearum is the pathogenic agent of Fusarium head blight (FHB), which is a destructive disease on wheat and barley, thereby causing huge economic loss and health problems to human by contaminating foods. Identifying pathogenic genes can shed light on pathogenesis underlying the interaction between F. graminearum and its plant host. However, it is difficult to detect pathogenic genes for this destructive pathogen by time-consuming and expensive molecular biological experiments in lab. On the other hand, computational methods provide an alternative way to solve this problem. Since pathogenesis is a complicated procedure that involves complex regulations and interactions, the molecular interaction network of F. graminearum can give clues to potential pathogenic genes. Furthermore, the gene expression data of F. graminearum before and after its invasion into plant host can also provide useful information. In this paper, a novel systems biology approach is presented to predict pathogenic genes of F. graminearum based on molecular interaction network and gene expression data. With a small number of known pathogenic genes as seed genes, a subnetwork that consists of potential pathogenic genes is identified from the protein-protein interaction network (PPIN) of F. graminearum, where the genes in the subnetwork are further required to be differentially expressed before and after the invasion of the pathogenic fungus. Therefore, the candidate genes in the subnetwork are expected to be involved in the same biological processes as seed genes, which imply that they are potential pathogenic genes. The prediction results show that most of the pathogenic genes of F. graminearum are enriched in two important signal transduction pathways, including G protein coupled receptor pathway and MAPK signaling pathway, which are known related to pathogenesis in other fungi. In addition, several pathogenic genes predicted by our method are verified in other pathogenic fungi, which

A network approach to predict pathogenic genes for Fusarium graminearum.

Directory of Open Access Journals (Sweden)

Xiaoping Liu

Full Text Available Fusarium graminearum is the pathogenic agent of Fusarium head blight (FHB, which is a destructive disease on wheat and barley, thereby causing huge economic loss and health problems to human by contaminating foods. Identifying pathogenic genes can shed light on pathogenesis underlying the interaction between F. graminearum and its plant host. However, it is difficult to detect pathogenic genes for this destructive pathogen by time-consuming and expensive molecular biological experiments in lab. On the other hand, computational methods provide an alternative way to solve this problem. Since pathogenesis is a complicated procedure that involves complex regulations and interactions, the molecular interaction network of F. graminearum can give clues to potential pathogenic genes. Furthermore, the gene expression data of F. graminearum before and after its invasion into plant host can also provide useful information. In this paper, a novel systems biology approach is presented to predict pathogenic genes of F. graminearum based on molecular interaction network and gene expression data. With a small number of known pathogenic genes as seed genes, a subnetwork that consists of potential pathogenic genes is identified from the protein-protein interaction network (PPIN of F. graminearum, where the genes in the subnetwork are further required to be differentially expressed before and after the invasion of the pathogenic fungus. Therefore, the candidate genes in the subnetwork are expected to be involved in the same biological processes as seed genes, which imply that they are potential pathogenic genes. The prediction results show that most of the pathogenic genes of F. graminearum are enriched in two important signal transduction pathways, including G protein coupled receptor pathway and MAPK signaling pathway, which are known related to pathogenesis in other fungi. In addition, several pathogenic genes predicted by our method are verified in other

Functional enrichment analyses and construction of functional similarity networks with high confidence function prediction by PFP

Directory of Open Access Journals (Sweden)

Kihara Daisuke

2010-05-01

Full Text Available Abstract Background A new paradigm of biological investigation takes advantage of technologies that produce large high throughput datasets, including genome sequences, interactions of proteins, and gene expression. The ability of biologists to analyze and interpret such data relies on functional annotation of the included proteins, but even in highly characterized organisms many proteins can lack the functional evidence necessary to infer their biological relevance. Results Here we have applied high confidence function predictions from our automated prediction system, PFP, to three genome sequences, Escherichia coli, Saccharomyces cerevisiae, and Plasmodium falciparum (malaria. The number of annotated genes is increased by PFP to over 90% for all of the genomes. Using the large coverage of the function annotation, we introduced the functional similarity networks which represent the functional space of the proteomes. Four different functional similarity networks are constructed for each proteome, one each by considering similarity in a single Gene Ontology (GO category, i.e. Biological Process, Cellular Component, and Molecular Function, and another one by considering overall similarity with the funSim score. The functional similarity networks are shown to have higher modularity than the protein-protein interaction network. Moreover, the funSim score network is distinct from the single GO-score networks by showing a higher clustering degree exponent value and thus has a higher tendency to be hierarchical. In addition, examining function assignments to the protein-protein interaction network and local regions of genomes has identified numerous cases where subnetworks or local regions have functionally coherent proteins. These results will help interpreting interactions of proteins and gene orders in a genome. Several examples of both analyses are highlighted. Conclusion The analyses demonstrate that applying high confidence predictions from PFP

Automatic selection of reference taxa for protein-protein interaction prediction with phylogenetic profiling

DEFF Research Database (Denmark)

Simonsen, Martin; Maetschke, S.R.; Ragan, M.A.

2012-01-01

Motivation: Phylogenetic profiling methods can achieve good accuracy in predicting protein–protein interactions, especially in prokaryotes. Recent studies have shown that the choice of reference taxa (RT) is critical for accurate prediction, but with more than 2500 fully sequenced taxa publicly......: We present three novel methods for automating the selection of RT, using machine learning based on known protein–protein interaction networks. One of these methods in particular, Tree-Based Search, yields greatly improved prediction accuracies. We further show that different methods for constituting...... phylogenetic profiles often require very different RT sets to support high prediction accuracy....

Predicting Information Flows in Network Traffic.

Science.gov (United States)

Hinich, Melvin J.; Molyneux, Robert E.

2003-01-01

Discusses information flow in networks and predicting network traffic and describes a study that uses time series analysis on a day's worth of Internet log data. Examines nonlinearity and traffic invariants, and suggests that prediction of network traffic may not be possible with current techniques. (Author/LRW)

Network of microRNAs-mRNAs Interactions in Pancreatic Cancer

Science.gov (United States)

Naderi, Elnaz; Mostafaei, Mehdi; Pourshams, Akram

2014-01-01

Background. MicroRNAs are small RNA molecules that regulate the expression of certain genes through interaction with mRNA targets and are mainly involved in human cancer. This study was conducted to make the network of miRNAs-mRNAs interactions in pancreatic cancer as the fourth leading cause of cancer death. Methods. 56 miRNAs that were exclusively expressed and 1176 genes that were downregulated or silenced in pancreas cancer were extracted from beforehand investigations. MiRNA–mRNA interactions data analysis and related networks were explored using MAGIA tool and Cytoscape 3 software. Functional annotations of candidate genes in pancreatic cancer were identified by DAVID annotation tool. Results. This network is made of 217 nodes for mRNA, 15 nodes for miRNA, and 241 edges that show 241 regulations between 15 miRNAs and 217 target genes. The miR-24 was the most significantly powerful miRNA that regulated series of important genes. ACVR2B, GFRA1, and MTHFR were significant target genes were that downregulated. Conclusion. Although the collected previous data seems to be a treasure trove, there was no study simultaneous to analysis of miRNAs and mRNAs interaction. Network of miRNA-mRNA interactions will help to corroborate experimental remarks and could be used to refine miRNA target predictions for developing new therapeutic approaches. PMID:24895587

Network of microRNAs-mRNAs Interactions in Pancreatic Cancer

Directory of Open Access Journals (Sweden)

Elnaz Naderi

2014-01-01

Full Text Available Background. MicroRNAs are small RNA molecules that regulate the expression of certain genes through interaction with mRNA targets and are mainly involved in human cancer. This study was conducted to make the network of miRNAs-mRNAs interactions in pancreatic cancer as the fourth leading cause of cancer death. Methods. 56 miRNAs that were exclusively expressed and 1176 genes that were downregulated or silenced in pancreas cancer were extracted from beforehand investigations. MiRNA–mRNA interactions data analysis and related networks were explored using MAGIA tool and Cytoscape 3 software. Functional annotations of candidate genes in pancreatic cancer were identified by DAVID annotation tool. Results. This network is made of 217 nodes for mRNA, 15 nodes for miRNA, and 241 edges that show 241 regulations between 15 miRNAs and 217 target genes. The miR-24 was the most significantly powerful miRNA that regulated series of important genes. ACVR2B, GFRA1, and MTHFR were significant target genes were that downregulated. Conclusion. Although the collected previous data seems to be a treasure trove, there was no study simultaneous to analysis of miRNAs and mRNAs interaction. Network of miRNA-mRNA interactions will help to corroborate experimental remarks and could be used to refine miRNA target predictions for developing new therapeutic approaches.

Link prediction in multiplex online social networks

Science.gov (United States)

Jalili, Mahdi; Orouskhani, Yasin; Asgari, Milad; Alipourfard, Nazanin; Perc, Matjaž

2017-02-01

Online social networks play a major role in modern societies, and they have shaped the way social relationships evolve. Link prediction in social networks has many potential applications such as recommending new items to users, friendship suggestion and discovering spurious connections. Many real social networks evolve the connections in multiple layers (e.g. multiple social networking platforms). In this article, we study the link prediction problem in multiplex networks. As an example, we consider a multiplex network of Twitter (as a microblogging service) and Foursquare (as a location-based social network). We consider social networks of the same users in these two platforms and develop a meta-path-based algorithm for predicting the links. The connectivity information of the two layers is used to predict the links in Foursquare network. Three classical classifiers (naive Bayes, support vector machines (SVM) and K-nearest neighbour) are used for the classification task. Although the networks are not highly correlated in the layers, our experiments show that including the cross-layer information significantly improves the prediction performance. The SVM classifier results in the best performance with an average accuracy of 89%.

From link-prediction in brain connectomes and protein interactomes to the local-community-paradigm in complex networks.

KAUST Repository

Cannistraci, C.V.

2013-04-08

Growth and remodelling impact the network topology of complex systems, yet a general theory explaining how new links arise between existing nodes has been lacking, and little is known about the topological properties that facilitate link-prediction. Here we investigate the extent to which the connectivity evolution of a network might be predicted by mere topological features. We show how a link/community-based strategy triggers substantial prediction improvements because it accounts for the singular topology of several real networks organised in multiple local communities - a tendency here named local-community-paradigm (LCP). We observe that LCP networks are mainly formed by weak interactions and characterise heterogeneous and dynamic systems that use self-organisation as a major adaptation strategy. These systems seem designed for global delivery of information and processing via multiple local modules. Conversely, non-LCP networks have steady architectures formed by strong interactions, and seem designed for systems in which information/energy storage is crucial.

Network structure beyond food webs: mapping non-trophic and trophic interactions on Chilean rocky shores.

Science.gov (United States)

Sonia Kéfi; Berlow, Eric L; Wieters, Evie A; Joppa, Lucas N; Wood, Spencer A; Brose, Ulrich; Navarrete, Sergio A

2015-01-01

How multiple types of non-trophic interactions map onto trophic networks in real communities remains largely unknown. We present the first effort, to our knowledge, describing a comprehensive ecological network that includes all known trophic and diverse non-trophic links among >100 coexisting species for the marine rocky intertidal community of the central Chilean coast. Our results suggest that non-trophic interactions exhibit highly nonrandom structures both alone and with respect to food web structure. The occurrence of different types of interactions, relative to all possible links, was well predicted by trophic structure and simple traits of the source and target species. In this community, competition for space and positive interactions related to habitat/refuge provisioning by sessile and/or basal species were by far the most abundant non-trophic interactions. If these patterns are orroborated in other ecosystems, they may suggest potentially important dynamic constraints on the combined architecture of trophic and non-trophic interactions. The nonrandom patterning of non-trophic interactions suggests a path forward for developing a more comprehensive ecological network theory to predict the functioning and resilience of ecological communities.

Network Physiology: How Organ Systems Dynamically Interact

Science.gov (United States)

Bartsch, Ronny P.; Liu, Kang K. L.; Bashan, Amir; Ivanov, Plamen Ch.

2015-01-01

We systematically study how diverse physiologic systems in the human organism dynamically interact and collectively behave to produce distinct physiologic states and functions. This is a fundamental question in the new interdisciplinary field of Network Physiology, and has not been previously explored. Introducing the novel concept of Time Delay Stability (TDS), we develop a computational approach to identify and quantify networks of physiologic interactions from long-term continuous, multi-channel physiological recordings. We also develop a physiologically-motivated visualization framework to map networks of dynamical organ interactions to graphical objects encoded with information about the coupling strength of network links quantified using the TDS measure. Applying a system-wide integrative approach, we identify distinct patterns in the network structure of organ interactions, as well as the frequency bands through which these interactions are mediated. We establish first maps representing physiologic organ network interactions and discover basic rules underlying the complex hierarchical reorganization in physiologic networks with transitions across physiologic states. Our findings demonstrate a direct association between network topology and physiologic function, and provide new insights into understanding how health and distinct physiologic states emerge from networked interactions among nonlinear multi-component complex systems. The presented here investigations are initial steps in building a first atlas of dynamic interactions among organ systems. PMID:26555073

Network Physiology: How Organ Systems Dynamically Interact.

Science.gov (United States)

Bartsch, Ronny P; Liu, Kang K L; Bashan, Amir; Ivanov, Plamen Ch

2015-01-01

We systematically study how diverse physiologic systems in the human organism dynamically interact and collectively behave to produce distinct physiologic states and functions. This is a fundamental question in the new interdisciplinary field of Network Physiology, and has not been previously explored. Introducing the novel concept of Time Delay Stability (TDS), we develop a computational approach to identify and quantify networks of physiologic interactions from long-term continuous, multi-channel physiological recordings. We also develop a physiologically-motivated visualization framework to map networks of dynamical organ interactions to graphical objects encoded with information about the coupling strength of network links quantified using the TDS measure. Applying a system-wide integrative approach, we identify distinct patterns in the network structure of organ interactions, as well as the frequency bands through which these interactions are mediated. We establish first maps representing physiologic organ network interactions and discover basic rules underlying the complex hierarchical reorganization in physiologic networks with transitions across physiologic states. Our findings demonstrate a direct association between network topology and physiologic function, and provide new insights into understanding how health and distinct physiologic states emerge from networked interactions among nonlinear multi-component complex systems. The presented here investigations are initial steps in building a first atlas of dynamic interactions among organ systems.

Link Prediction Methods and Their Accuracy for Different Social Networks and Network Metrics

Directory of Open Access Journals (Sweden)

Fei Gao

2015-01-01

Full Text Available Currently, we are experiencing a rapid growth of the number of social-based online systems. The availability of the vast amounts of data gathered in those systems brings new challenges that we face when trying to analyse it. One of the intensively researched topics is the prediction of social connections between users. Although a lot of effort has been made to develop new prediction approaches, the existing methods are not comprehensively analysed. In this paper we investigate the correlation between network metrics and accuracy of different prediction methods. We selected six time-stamped real-world social networks and ten most widely used link prediction methods. The results of the experiments show that the performance of some methods has a strong correlation with certain network metrics. We managed to distinguish “prediction friendly” networks, for which most of the prediction methods give good performance, as well as “prediction unfriendly” networks, for which most of the methods result in high prediction error. Correlation analysis between network metrics and prediction accuracy of prediction methods may form the basis of a metalearning system where based on network characteristics it will be able to recommend the right prediction method for a given network.

Application of Machine Learning Approaches for Protein-protein Interactions Prediction.

Science.gov (United States)

Zhang, Mengying; Su, Qiang; Lu, Yi; Zhao, Manman; Niu, Bing

2017-01-01

Proteomics endeavors to study the structures, functions and interactions of proteins. Information of the protein-protein interactions (PPIs) helps to improve our knowledge of the functions and the 3D structures of proteins. Thus determining the PPIs is essential for the study of the proteomics. In this review, in order to study the application of machine learning in predicting PPI, some machine learning approaches such as support vector machine (SVM), artificial neural networks (ANNs) and random forest (RF) were selected, and the examples of its applications in PPIs were listed. SVM and RF are two commonly used methods. Nowadays, more researchers predict PPIs by combining more than two methods. This review presents the application of machine learning approaches in predicting PPI. Many examples of success in identification and prediction in the area of PPI prediction have been discussed, and the PPIs research is still in progress. Copyright© Bentham Science Publishers; For any queries, please email at epub@benthamscience.org.

A link prediction method for heterogeneous networks based on BP neural network

Science.gov (United States)

Li, Ji-chao; Zhao, Dan-ling; Ge, Bing-Feng; Yang, Ke-Wei; Chen, Ying-Wu

2018-04-01

Most real-world systems, composed of different types of objects connected via many interconnections, can be abstracted as various complex heterogeneous networks. Link prediction for heterogeneous networks is of great significance for mining missing links and reconfiguring networks according to observed information, with considerable applications in, for example, friend and location recommendations and disease-gene candidate detection. In this paper, we put forward a novel integrated framework, called MPBP (Meta-Path feature-based BP neural network model), to predict multiple types of links for heterogeneous networks. More specifically, the concept of meta-path is introduced, followed by the extraction of meta-path features for heterogeneous networks. Next, based on the extracted meta-path features, a supervised link prediction model is built with a three-layer BP neural network. Then, the solution algorithm of the proposed link prediction model is put forward to obtain predicted results by iteratively training the network. Last, numerical experiments on the dataset of examples of a gene-disease network and a combat network are conducted to verify the effectiveness and feasibility of the proposed MPBP. It shows that the MPBP with very good performance is superior to the baseline methods.

Cascaded bidirectional recurrent neural networks for protein secondary structure prediction.

Science.gov (United States)

Chen, Jinmiao; Chaudhari, Narendra

2007-01-01

Protein secondary structure (PSS) prediction is an important topic in bioinformatics. Our study on a large set of non-homologous proteins shows that long-range interactions commonly exist and negatively affect PSS prediction. Besides, we also reveal strong correlations between secondary structure (SS) elements. In order to take into account the long-range interactions and SS-SS correlations, we propose a novel prediction system based on cascaded bidirectional recurrent neural network (BRNN). We compare the cascaded BRNN against another two BRNN architectures, namely the original BRNN architecture used for speech recognition as well as Pollastri's BRNN that was proposed for PSS prediction. Our cascaded BRNN achieves an overall three state accuracy Q3 of 74.38\\%, and reaches a high Segment OVerlap (SOV) of 66.0455. It outperforms the original BRNN and Pollastri's BRNN in both Q3 and SOV. Specifically, it improves the SOV score by 4-6%.

BIPS: BIANA Interolog Prediction Server. A tool for protein-protein interaction inference.

Science.gov (United States)

Garcia-Garcia, Javier; Schleker, Sylvia; Klein-Seetharaman, Judith; Oliva, Baldo

2012-07-01

Protein-protein interactions (PPIs) play a crucial role in biology, and high-throughput experiments have greatly increased the coverage of known interactions. Still, identification of complete inter- and intraspecies interactomes is far from being complete. Experimental data can be complemented by the prediction of PPIs within an organism or between two organisms based on the known interactions of the orthologous genes of other organisms (interologs). Here, we present the BIANA (Biologic Interactions and Network Analysis) Interolog Prediction Server (BIPS), which offers a web-based interface to facilitate PPI predictions based on interolog information. BIPS benefits from the capabilities of the framework BIANA to integrate the several PPI-related databases. Additional metadata can be used to improve the reliability of the predicted interactions. Sensitivity and specificity of the server have been calculated using known PPIs from different interactomes using a leave-one-out approach. The specificity is between 72 and 98%, whereas sensitivity varies between 1 and 59%, depending on the sequence identity cut-off used to calculate similarities between sequences. BIPS is freely accessible at http://sbi.imim.es/BIPS.php.

Interactive social contagions and co-infections on complex networks

Science.gov (United States)

Liu, Quan-Hui; Zhong, Lin-Feng; Wang, Wei; Zhou, Tao; Eugene Stanley, H.

2018-01-01

What we are learning about the ubiquitous interactions among multiple social contagion processes on complex networks challenges existing theoretical methods. We propose an interactive social behavior spreading model, in which two behaviors sequentially spread on a complex network, one following the other. Adopting the first behavior has either a synergistic or an inhibiting effect on the spread of the second behavior. We find that the inhibiting effect of the first behavior can cause the continuous phase transition of the second behavior spreading to become discontinuous. This discontinuous phase transition of the second behavior can also become a continuous one when the effect of adopting the first behavior becomes synergistic. This synergy allows the second behavior to be more easily adopted and enlarges the co-existence region of both behaviors. We establish an edge-based compartmental method, and our theoretical predictions match well with the simulation results. Our findings provide helpful insights into better understanding the spread of interactive social behavior in human society.

Evidence for the additions of clustered interacting nodes during the evolution of protein interaction networks from network motifs

Directory of Open Access Journals (Sweden)

Guo Hao

2011-05-01

Full Text Available Abstract Background High-throughput screens have revealed large-scale protein interaction networks defining most cellular functions. How the proteins were added to the protein interaction network during its growth is a basic and important issue. Network motifs represent the simplest building blocks of cellular machines and are of biological significance. Results Here we study the evolution of protein interaction networks from the perspective of network motifs. We find that in current protein interaction networks, proteins of the same age class tend to form motifs and such co-origins of motif constituents are affected by their topologies and biological functions. Further, we find that the proteins within motifs whose constituents are of the same age class tend to be densely interconnected, co-evolve and share the same biological functions, and these motifs tend to be within protein complexes. Conclusions Our findings provide novel evidence for the hypothesis of the additions of clustered interacting nodes and point out network motifs, especially the motifs with the dense topology and specific function may play important roles during this process. Our results suggest functional constraints may be the underlying driving force for such additions of clustered interacting nodes.

Trading network predicts stock price.

Science.gov (United States)

Sun, Xiao-Qian; Shen, Hua-Wei; Cheng, Xue-Qi

2014-01-16

Stock price prediction is an important and challenging problem for studying financial markets. Existing studies are mainly based on the time series of stock price or the operation performance of listed company. In this paper, we propose to predict stock price based on investors' trading behavior. For each stock, we characterize the daily trading relationship among its investors using a trading network. We then classify the nodes of trading network into three roles according to their connectivity pattern. Strong Granger causality is found between stock price and trading relationship indices, i.e., the fraction of trading relationship among nodes with different roles. We further predict stock price by incorporating these trading relationship indices into a neural network based on time series of stock price. Experimental results on 51 stocks in two Chinese Stock Exchanges demonstrate the accuracy of stock price prediction is significantly improved by the inclusion of trading relationship indices.

Characterizing and predicting the robustness of power-law networks

International Nuclear Information System (INIS)

LaRocca, Sarah; Guikema, Seth D.

2015-01-01

Power-law networks such as the Internet, terrorist cells, species relationships, and cellular metabolic interactions are susceptible to node failures, yet maintaining network connectivity is essential for network functionality. Disconnection of the network leads to fragmentation and, in some cases, collapse of the underlying system. However, the influences of the topology of networks on their ability to withstand node failures are poorly understood. Based on a study of the response of 2000 randomly-generated power-law networks to node failures, we find that networks with higher nodal degree and clustering coefficient, lower betweenness centrality, and lower variability in path length and clustering coefficient maintain their cohesion better during such events. We also find that network robustness, i.e., the ability to withstand node failures, can be accurately predicted a priori for power-law networks across many fields. These results provide a basis for designing new, more robust networks, improving the robustness of existing networks such as the Internet and cellular metabolic pathways, and efficiently degrading networks such as terrorist cells. - Highlights: • Examine relationship between network topology and robustness to failures. • Relationship is statistically significant for scale-free networks. • Use statistical models to estimate robustness to failures for real-world networks

Hazard interactions and interaction networks (cascades) within multi-hazard methodologies

Science.gov (United States)

Gill, Joel C.; Malamud, Bruce D.

2016-08-01

This paper combines research and commentary to reinforce the importance of integrating hazard interactions and interaction networks (cascades) into multi-hazard methodologies. We present a synthesis of the differences between multi-layer single-hazard approaches and multi-hazard approaches that integrate such interactions. This synthesis suggests that ignoring interactions between important environmental and anthropogenic processes could distort management priorities, increase vulnerability to other spatially relevant hazards or underestimate disaster risk. In this paper we proceed to present an enhanced multi-hazard framework through the following steps: (i) description and definition of three groups (natural hazards, anthropogenic processes and technological hazards/disasters) as relevant components of a multi-hazard environment, (ii) outlining of three types of interaction relationship (triggering, increased probability, and catalysis/impedance), and (iii) assessment of the importance of networks of interactions (cascades) through case study examples (based on the literature, field observations and semi-structured interviews). We further propose two visualisation frameworks to represent these networks of interactions: hazard interaction matrices and hazard/process flow diagrams. Our approach reinforces the importance of integrating interactions between different aspects of the Earth system, together with human activity, into enhanced multi-hazard methodologies. Multi-hazard approaches support the holistic assessment of hazard potential and consequently disaster risk. We conclude by describing three ways by which understanding networks of interactions contributes to the theoretical and practical understanding of hazards, disaster risk reduction and Earth system management. Understanding interactions and interaction networks helps us to better (i) model the observed reality of disaster events, (ii) constrain potential changes in physical and social vulnerability

Exploring hierarchical and overlapping modular structure in the yeast protein interaction network

Directory of Open Access Journals (Sweden)

Zhao Yi

2010-12-01

Full Text Available Abstract Background Developing effective strategies to reveal modular structures in protein interaction networks is crucial for better understanding of molecular mechanisms of underlying biological processes. In this paper, we propose a new density-based algorithm (ADHOC for clustering vertices of a protein interaction network using a novel subgraph density measurement. Results By statistically evaluating several independent criteria, we found that ADHOC could significantly improve the outcome as compared with five previously reported density-dependent methods. We further applied ADHOC to investigate the hierarchical and overlapping modular structure in the yeast PPI network. Our method could effectively detect both protein modules and the overlaps between them, and thus greatly promote the precise prediction of protein functions. Moreover, by further assaying the intermodule layer of the yeast PPI network, we classified hubs into two types, module hubs and inter-module hubs. Each type presents distinct characteristics both in network topology and biological functions, which could conduce to the better understanding of relationship between network architecture and biological implications. Conclusions Our proposed algorithm based on the novel subgraph density measurement makes it possible to more precisely detect hierarchical and overlapping modular structures in protein interaction networks. In addition, our method also shows a strong robustness against the noise in network, which is quite critical for analyzing such a high noise network.

Hepatitis C Virus Protein Interaction Network Analysis Based on Hepatocellular Carcinoma.

Directory of Open Access Journals (Sweden)

Yuewen Han

Full Text Available Epidemiological studies have validated the association between hepatitis C virus (HCV infection and hepatocellular carcinoma (HCC. An increasing number of studies show that protein-protein interactions (PPIs between HCV proteins and host proteins play a vital role in infection and mediate HCC progression. In this work, we collected all published interaction between HCV and human proteins, which include 455 unique human proteins participating in 524 HCV-human interactions. Then, we construct the HCV-human and HCV-HCC protein interaction networks, which display the biological knowledge regarding the mechanism of HCV pathogenesis, particularly with respect to pathogenesis of HCC. Through in-depth analysis of the HCV-HCC interaction network, we found that interactors are enriched in the JAK/STAT, p53, MAPK, TNF, Wnt, and cell cycle pathways. Using a random walk with restart algorithm, we predicted the importance of each protein in the HCV-HCC network and found that AKT1 may play a key role in the HCC progression. Moreover, we found that NS5A promotes HCC cells proliferation and metastasis by activating AKT/GSK3β/β-catenin pathway. This work provides a basis for a detailed map tracking new cellular interactions of HCV and identifying potential targets for HCV-related hepatocellular carcinoma treatment.

Probability weighted ensemble transfer learning for predicting interactions between HIV-1 and human proteins.

Directory of Open Access Journals (Sweden)

Suyu Mei

Full Text Available Reconstruction of host-pathogen protein interaction networks is of great significance to reveal the underlying microbic pathogenesis. However, the current experimentally-derived networks are generally small and should be augmented by computational methods for less-biased biological inference. From the point of view of computational modelling, data scarcity, data unavailability and negative data sampling are the three major problems for host-pathogen protein interaction networks reconstruction. In this work, we are motivated to address the three concerns and propose a probability weighted ensemble transfer learning model for HIV-human protein interaction prediction (PWEN-TLM, where support vector machine (SVM is adopted as the individual classifier of the ensemble model. In the model, data scarcity and data unavailability are tackled by homolog knowledge transfer. The importance of homolog knowledge is measured by the ROC-AUC metric of the individual classifiers, whose outputs are probability weighted to yield the final decision. In addition, we further validate the assumption that only the homolog knowledge is sufficient to train a satisfactory model for host-pathogen protein interaction prediction. Thus the model is more robust against data unavailability with less demanding data constraint. As regards with negative data construction, experiments show that exclusiveness of subcellular co-localized proteins is unbiased and more reliable than random sampling. Last, we conduct analysis of overlapped predictions between our model and the existing models, and apply the model to novel host-pathogen PPIs recognition for further biological research.

Predicting Hidden Links in Supply Networks

Directory of Open Access Journals (Sweden)

A. Brintrup

2018-01-01

Full Text Available Manufacturing companies often lack visibility of the procurement interdependencies between the suppliers within their supply network. However, knowledge of these interdependencies is useful to plan for potential operational disruptions. In this paper, we develop the Supply Network Link Predictor (SNLP method to infer supplier interdependencies using the manufacturer’s incomplete knowledge of the network. SNLP uses topological data to extract relational features from the known network to train a classifier for predicting potential links. Using a test case from the automotive industry, four features are extracted: (i number of existing supplier links, (ii overlaps between supplier product portfolios, (iii product outsourcing associations, and (iv likelihood of buyers purchasing from two suppliers together. Naïve Bayes and Logistic Regression are then employed to predict whether these features can help predict interdependencies between two suppliers. Our results show that these features can indeed be used to predict interdependencies in the network and that predictive accuracy is maximised by (i and (iii. The findings give rise to the exciting possibility of using data analytics for improving supply chain visibility. We then proceed to discuss to what extent such approaches can be adopted and their limitations, highlighting next steps for future work in this area.

Context-specific protein network miner - an online system for exploring context-specific protein interaction networks from the literature

KAUST Repository

Chowdhary, Rajesh

2012-04-06

Background: Protein interaction networks (PINs) specific within a particular context contain crucial information regarding many cellular biological processes. For example, PINs may include information on the type and directionality of interaction (e.g. phosphorylation), location of interaction (i.e. tissues, cells), and related diseases. Currently, very few tools are capable of deriving context-specific PINs for conducting exploratory analysis. Results: We developed a literature-based online system, Context-specific Protein Network Miner (CPNM), which derives context-specific PINs in real-time from the PubMed database based on a set of user-input keywords and enhanced PubMed query system. CPNM reports enriched information on protein interactions (with type and directionality), their network topology with summary statistics (e.g. most densely connected proteins in the network; most densely connected protein-pairs; and proteins connected by most inbound/outbound links) that can be explored via a user-friendly interface. Some of the novel features of the CPNM system include PIN generation, ontology-based PubMed query enhancement, real-time, user-queried, up-to-date PubMed document processing, and prediction of PIN directionality. Conclusions: CPNM provides a tool for biologists to explore PINs. It is freely accessible at http://www.biotextminer.com/CPNM/. © 2012 Chowdhary et al.

Context-specific protein network miner - an online system for exploring context-specific protein interaction networks from the literature

KAUST Repository

Chowdhary, Rajesh; Tan, Sin Lam; Zhang, Jinfeng; Karnik, Shreyas; Bajic, Vladimir B.; Liu, Jun S.

2012-01-01

Background: Protein interaction networks (PINs) specific within a particular context contain crucial information regarding many cellular biological processes. For example, PINs may include information on the type and directionality of interaction (e.g. phosphorylation), location of interaction (i.e. tissues, cells), and related diseases. Currently, very few tools are capable of deriving context-specific PINs for conducting exploratory analysis. Results: We developed a literature-based online system, Context-specific Protein Network Miner (CPNM), which derives context-specific PINs in real-time from the PubMed database based on a set of user-input keywords and enhanced PubMed query system. CPNM reports enriched information on protein interactions (with type and directionality), their network topology with summary statistics (e.g. most densely connected proteins in the network; most densely connected protein-pairs; and proteins connected by most inbound/outbound links) that can be explored via a user-friendly interface. Some of the novel features of the CPNM system include PIN generation, ontology-based PubMed query enhancement, real-time, user-queried, up-to-date PubMed document processing, and prediction of PIN directionality. Conclusions: CPNM provides a tool for biologists to explore PINs. It is freely accessible at http://www.biotextminer.com/CPNM/. © 2012 Chowdhary et al.

Predicting protein-protein interactions from multimodal biological data sources via nonnegative matrix tri-factorization.

Science.gov (United States)

Wang, Hua; Huang, Heng; Ding, Chris; Nie, Feiping

2013-04-01

Protein interactions are central to all the biological processes and structural scaffolds in living organisms, because they orchestrate a number of cellular processes such as metabolic pathways and immunological recognition. Several high-throughput methods, for example, yeast two-hybrid system and mass spectrometry method, can help determine protein interactions, which, however, suffer from high false-positive rates. Moreover, many protein interactions predicted by one method are not supported by another. Therefore, computational methods are necessary and crucial to complete the interactome expeditiously. In this work, we formulate the problem of predicting protein interactions from a new mathematical perspective--sparse matrix completion, and propose a novel nonnegative matrix factorization (NMF)-based matrix completion approach to predict new protein interactions from existing protein interaction networks. Through using manifold regularization, we further develop our method to integrate different biological data sources, such as protein sequences, gene expressions, protein structure information, etc. Extensive experimental results on four species, Saccharomyces cerevisiae, Drosophila melanogaster, Homo sapiens, and Caenorhabditis elegans, have shown that our new methods outperform related state-of-the-art protein interaction prediction methods.

An approach for reduction of false predictions in reverse engineering of gene regulatory networks.

Science.gov (United States)

Khan, Abhinandan; Saha, Goutam; Pal, Rajat Kumar

2018-05-14

A gene regulatory network discloses the regulatory interactions amongst genes, at a particular condition of the human body. The accurate reconstruction of such networks from time-series genetic expression data using computational tools offers a stiff challenge for contemporary computer scientists. This is crucial to facilitate the understanding of the proper functioning of a living organism. Unfortunately, the computational methods produce many false predictions along with the correct predictions, which is unwanted. Investigations in the domain focus on the identification of as many correct regulations as possible in the reverse engineering of gene regulatory networks to make it more reliable and biologically relevant. One way to achieve this is to reduce the number of incorrect predictions in the reconstructed networks. In the present investigation, we have proposed a novel scheme to decrease the number of false predictions by suitably combining several metaheuristic techniques. We have implemented the same using a dataset ensemble approach (i.e. combining multiple datasets) also. We have employed the proposed methodology on real-world experimental datasets of the SOS DNA Repair network of Escherichia coli and the IMRA network of Saccharomyces cerevisiae. Subsequently, we have experimented upon somewhat larger, in silico networks, namely, DREAM3 and DREAM4 Challenge networks, and 15-gene and 20-gene networks extracted from the GeneNetWeaver database. To study the effect of multiple datasets on the quality of the inferred networks, we have used four datasets in each experiment. The obtained results are encouraging enough as the proposed methodology can reduce the number of false predictions significantly, without using any supplementary prior biological information for larger gene regulatory networks. It is also observed that if a small amount of prior biological information is incorporated here, the results improve further w.r.t. the prediction of true positives

Linking plant specialization to dependence in interactions for seed set in pollination networks.

Science.gov (United States)

Tur, Cristina; Castro-Urgal, Rocío; Traveset, Anna

2013-01-01

Studies on pollination networks have provided valuable information on the number, frequency, distribution and identity of interactions between plants and pollinators. However, little is still known on the functional effect of these interactions on plant reproductive success. Information on the extent to which plants depend on such interactions will help to make more realistic predictions of the potential impacts of disturbances on plant-pollinator networks. Plant functional dependence on pollinators (all interactions pooled) can be estimated by comparing seed set with and without pollinators (i.e. bagging flowers to exclude them). Our main goal in this study was thus to determine whether plant dependence on current insect interactions is related to plant specialization in a pollination network. We studied two networks from different communities, one in a coastal dune and one in a mountain. For ca. 30% of plant species in each community, we obtained the following specialization measures: (i) linkage level (number of interactions), (ii) diversity of interactions, and (iii) closeness centrality (a measure of how much a species is connected to other plants via shared pollinators). Phylogenetically controlled regression analyses revealed that, for the largest and most diverse coastal community, plants highly dependent on pollinators were the most generalists showing the highest number and diversity of interactions as well as occupying central positions in the network. The mountain community, by contrast, did not show such functional relationship, what might be attributable to their lower flower-resource heterogeneity and diversity of interactions. We conclude that plants with a wide array of pollinator interactions tend to be those that are more strongly dependent upon them for seed production and thus might be those more functionally vulnerable to the loss of network interaction, although these outcomes might be context-dependent.

Linking plant specialization to dependence in interactions for seed set in pollination networks.

Directory of Open Access Journals (Sweden)

Cristina Tur

Full Text Available Studies on pollination networks have provided valuable information on the number, frequency, distribution and identity of interactions between plants and pollinators. However, little is still known on the functional effect of these interactions on plant reproductive success. Information on the extent to which plants depend on such interactions will help to make more realistic predictions of the potential impacts of disturbances on plant-pollinator networks. Plant functional dependence on pollinators (all interactions pooled can be estimated by comparing seed set with and without pollinators (i.e. bagging flowers to exclude them. Our main goal in this study was thus to determine whether plant dependence on current insect interactions is related to plant specialization in a pollination network. We studied two networks from different communities, one in a coastal dune and one in a mountain. For ca. 30% of plant species in each community, we obtained the following specialization measures: (i linkage level (number of interactions, (ii diversity of interactions, and (iii closeness centrality (a measure of how much a species is connected to other plants via shared pollinators. Phylogenetically controlled regression analyses revealed that, for the largest and most diverse coastal community, plants highly dependent on pollinators were the most generalists showing the highest number and diversity of interactions as well as occupying central positions in the network. The mountain community, by contrast, did not show such functional relationship, what might be attributable to their lower flower-resource heterogeneity and diversity of interactions. We conclude that plants with a wide array of pollinator interactions tend to be those that are more strongly dependent upon them for seed production and thus might be those more functionally vulnerable to the loss of network interaction, although these outcomes might be context-dependent.

A semi-supervised learning approach to predict synthetic genetic interactions by combining functional and topological properties of functional gene network

Directory of Open Access Journals (Sweden)

Han Kyungsook

2010-06-01

Full Text Available Abstract Background Genetic interaction profiles are highly informative and helpful for understanding the functional linkages between genes, and therefore have been extensively exploited for annotating gene functions and dissecting specific pathway structures. However, our understanding is rather limited to the relationship between double concurrent perturbation and various higher level phenotypic changes, e.g. those in cells, tissues or organs. Modifier screens, such as synthetic genetic arrays (SGA can help us to understand the phenotype caused by combined gene mutations. Unfortunately, exhaustive tests on all possible combined mutations in any genome are vulnerable to combinatorial explosion and are infeasible either technically or financially. Therefore, an accurate computational approach to predict genetic interaction is highly desirable, and such methods have the potential of alleviating the bottleneck on experiment design. Results In this work, we introduce a computational systems biology approach for the accurate prediction of pairwise synthetic genetic interactions (SGI. First, a high-coverage and high-precision functional gene network (FGN is constructed by integrating protein-protein interaction (PPI, protein complex and gene expression data; then, a graph-based semi-supervised learning (SSL classifier is utilized to identify SGI, where the topological properties of protein pairs in weighted FGN is used as input features of the classifier. We compare the proposed SSL method with the state-of-the-art supervised classifier, the support vector machines (SVM, on a benchmark dataset in S. cerevisiae to validate our method's ability to distinguish synthetic genetic interactions from non-interaction gene pairs. Experimental results show that the proposed method can accurately predict genetic interactions in S. cerevisiae (with a sensitivity of 92% and specificity of 91%. Noticeably, the SSL method is more efficient than SVM, especially for

Improving protein disorder prediction by deep bidirectional long short-term memory recurrent neural networks.

Science.gov (United States)

Hanson, Jack; Yang, Yuedong; Paliwal, Kuldip; Zhou, Yaoqi

2017-03-01

Capturing long-range interactions between structural but not sequence neighbors of proteins is a long-standing challenging problem in bioinformatics. Recently, long short-term memory (LSTM) networks have significantly improved the accuracy of speech and image classification problems by remembering useful past information in long sequential events. Here, we have implemented deep bidirectional LSTM recurrent neural networks in the problem of protein intrinsic disorder prediction. The new method, named SPOT-Disorder, has steadily improved over a similar method using a traditional, window-based neural network (SPINE-D) in all datasets tested without separate training on short and long disordered regions. Independent tests on four other datasets including the datasets from critical assessment of structure prediction (CASP) techniques and >10 000 annotated proteins from MobiDB, confirmed SPOT-Disorder as one of the best methods in disorder prediction. Moreover, initial studies indicate that the method is more accurate in predicting functional sites in disordered regions. These results highlight the usefulness combining LSTM with deep bidirectional recurrent neural networks in capturing non-local, long-range interactions for bioinformatics applications. SPOT-disorder is available as a web server and as a standalone program at: http://sparks-lab.org/server/SPOT-disorder/index.php . j.hanson@griffith.edu.au or yuedong.yang@griffith.edu.au or yaoqi.zhou@griffith.edu.au. Supplementary data is available at Bioinformatics online. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

Network Traffic Prediction Based on Deep Belief Network and Spatiotemporal Compressive Sensing in Wireless Mesh Backbone Networks

Directory of Open Access Journals (Sweden)

Laisen Nie

2018-01-01

Full Text Available Wireless mesh network is prevalent for providing a decentralized access for users and other intelligent devices. Meanwhile, it can be employed as the infrastructure of the last few miles connectivity for various network applications, for example, Internet of Things (IoT and mobile networks. For a wireless mesh backbone network, it has obtained extensive attention because of its large capacity and low cost. Network traffic prediction is important for network planning and routing configurations that are implemented to improve the quality of service for users. This paper proposes a network traffic prediction method based on a deep learning architecture and the Spatiotemporal Compressive Sensing method. The proposed method first adopts discrete wavelet transform to extract the low-pass component of network traffic that describes the long-range dependence of itself. Then, a prediction model is built by learning a deep architecture based on the deep belief network from the extracted low-pass component. Otherwise, for the remaining high-pass component that expresses the gusty and irregular fluctuations of network traffic, the Spatiotemporal Compressive Sensing method is adopted to predict it. Based on the predictors of two components, we can obtain a predictor of network traffic. From the simulation, the proposed prediction method outperforms three existing methods.

Time-Predictable Communication on a Time-Division Multiplexing Network-on-Chip Multicore

DEFF Research Database (Denmark)

Sørensen, Rasmus Bo

This thesis presents time-predictable inter-core communication on a multicore platform with a time-division multiplexing (TDM) network-on-chip (NoC) for hard real-time systems. The thesis is structured as a collection of papers that contribute within the areas of: reconfigurable TDM NoCs, static...... TDM scheduling, and time-predictable inter-core communication. More specifically, the work presented in this thesis investigates the interaction between hardware and software involved in time-predictable inter-core communication on the multicore platform. The thesis presents: a new generation...... of the Argo NoC network interface (NI) that supports instantaneous reconfiguration, a TDM traffic scheduler that generates virtual circuit (VC) configurations for the Argo NoC, and software functions for two types of intercore communication. The new generation of the Argo NoC adds the capability...

Novel Methods for Drug-Target Interaction Prediction using Graph Mining

KAUST Repository

Ba Alawi, Wail

2016-08-31

The problem of developing drugs that can be used to cure diseases is important and requires a careful approach. Since pursuing the wrong candidate drug for a particular disease could be very costly in terms of time and money, there is a strong interest in minimizing such risks. Drug repositioning has become a hot topic of research, as it helps reduce these risks significantly at the early stages of drug development by reusing an approved drug for the treatment of a different disease. Still, finding new usage for a drug is non-trivial, as it is necessary to find out strong supporting evidence that the proposed new uses of drugs are plausible. Many computational approaches were developed to narrow the list of possible candidate drug-target interactions (DTIs) before any experiments are done. However, many of these approaches suffer from unacceptable levels of false positives. We developed two novel methods based on graph mining networks of drugs and targets. The first method (DASPfind) finds all non-cyclic paths that connect a drug and a target, and using a function that we define, calculates a score from all the paths. This score describes our confidence that DTI is correct. We show that DASPfind significantly outperforms other state-of-the-art methods in predicting the top ranked target for each drug. We demonstrate the utility of DASPfind by predicting 15 novel DTIs over a set of ion channel proteins, and confirming 12 out of these 15 DTIs through experimental evidence reported in literature and online drug databases. The second method (DASPfind+) modifies DASPfind in order to increase the confidence and reliability of the resultant predictions. Based on the structure of the drug-target interaction (DTI) networks, we introduced an optimization scheme that incrementally alters the network structure locally for each drug to achieve more robust top 1 ranked predictions. Moreover, we explored effects of several similarity measures between the targets on the prediction

Game theory in communication networks cooperative resolution of interactive networking scenarios

CERN Document Server

Antoniou, Josephina

2012-01-01

A mathematical tool for scientists and researchers who work with computer and communication networks, Game Theory in Communication Networks: Cooperative Resolution of Interactive Networking Scenarios addresses the question of how to promote cooperative behavior in interactive situations between heterogeneous entities in communication networking scenarios. It explores network design and management from a theoretical perspective, using game theory and graph theory to analyze strategic situations and demonstrate profitable behaviors of the cooperative entities. The book promotes the use of Game T

A Network-Based Approach to Modeling and Predicting Product Coconsideration Relations

Directory of Open Access Journals (Sweden)

Zhenghui Sha

2018-01-01

Full Text Available Understanding customer preferences in consideration decisions is critical to choice modeling in engineering design. While existing literature has shown that the exogenous effects (e.g., product and customer attributes are deciding factors in customers’ consideration decisions, it is not clear how the endogenous effects (e.g., the intercompetition among products would influence such decisions. This paper presents a network-based approach based on Exponential Random Graph Models to study customers’ consideration behaviors according to engineering design. Our proposed approach is capable of modeling the endogenous effects among products through various network structures (e.g., stars and triangles besides the exogenous effects and predicting whether two products would be conisdered together. To assess the proposed model, we compare it against the dyadic network model that only considers exogenous effects. Using buyer survey data from the China automarket in 2013 and 2014, we evaluate the goodness of fit and the predictive power of the two models. The results show that our model has a better fit and predictive accuracy than the dyadic network model. This underscores the importance of the endogenous effects on customers’ consideration decisions. The insights gained from this research help explain how endogenous effects interact with exogeous effects in affecting customers’ decision-making.

Predicting local field potentials with recurrent neural networks.

Science.gov (United States)

Kim, Louis; Harer, Jacob; Rangamani, Akshay; Moran, James; Parks, Philip D; Widge, Alik; Eskandar, Emad; Dougherty, Darin; Chin, Sang Peter

2016-08-01

We present a Recurrent Neural Network using LSTM (Long Short Term Memory) that is capable of modeling and predicting Local Field Potentials. We train and test the network on real data recorded from epilepsy patients. We construct networks that predict multi-channel LFPs for 1, 10, and 100 milliseconds forward in time. Our results show that prediction using LSTM outperforms regression when predicting 10 and 100 millisecond forward in time.

Unraveling spurious properties of interaction networks with tailored random networks.

Directory of Open Access Journals (Sweden)

Stephan Bialonski

Full Text Available We investigate interaction networks that we derive from multivariate time series with methods frequently employed in diverse scientific fields such as biology, quantitative finance, physics, earth and climate sciences, and the neurosciences. Mimicking experimental situations, we generate time series with finite length and varying frequency content but from independent stochastic processes. Using the correlation coefficient and the maximum cross-correlation, we estimate interdependencies between these time series. With clustering coefficient and average shortest path length, we observe unweighted interaction networks, derived via thresholding the values of interdependence, to possess non-trivial topologies as compared to Erdös-Rényi networks, which would indicate small-world characteristics. These topologies reflect the mostly unavoidable finiteness of the data, which limits the reliability of typically used estimators of signal interdependence. We propose random networks that are tailored to the way interaction networks are derived from empirical data. Through an exemplary investigation of multichannel electroencephalographic recordings of epileptic seizures--known for their complex spatial and temporal dynamics--we show that such random networks help to distinguish network properties of interdependence structures related to seizure dynamics from those spuriously induced by the applied methods of analysis.

Predicted Bacterial Interactions Affect in Vivo Microbial Colonization Dynamics in Nematostella

Science.gov (United States)

Domin, Hanna; Zurita-Gutiérrez, Yazmín H.; Scotti, Marco; Buttlar, Jann; Hentschel Humeida, Ute; Fraune, Sebastian

2018-01-01

The maintenance and resilience of host-associated microbiota during development is a fundamental process influencing the fitness of many organisms. Several host properties were identified as influencing factors on bacterial colonization, including the innate immune system, mucus composition, and diet. In contrast, the importance of bacteria–bacteria interactions on host colonization is less understood. Here, we use bacterial abundance data of the marine model organism Nematostella vectensis to reconstruct potential bacteria–bacteria interactions through co-occurrence networks. The analysis indicates that bacteria–bacteria interactions are dynamic during host colonization and change according to the host’s developmental stage. To assess the predictive power of inferred interactions, we tested bacterial isolates with predicted cooperative or competitive behavior for their ability to influence bacterial recolonization dynamics. Within 3 days of recolonization, all tested bacterial isolates affected bacterial community structure, while only competitive bacteria increased bacterial diversity. Only 1 week after recolonization, almost no differences in bacterial community structure could be observed between control and treatments. These results show that predicted competitive bacteria can influence community structure for a short period of time, verifying the in silico predictions. However, within 1 week, the effects of the bacterial isolates are neutralized, indicating a high degree of resilience of the bacterial community. PMID:29740401

Predicted Bacterial Interactions Affect in Vivo Microbial Colonization Dynamics in Nematostella

Directory of Open Access Journals (Sweden)

Hanna Domin

2018-04-01

Full Text Available The maintenance and resilience of host-associated microbiota during development is a fundamental process influencing the fitness of many organisms. Several host properties were identified as influencing factors on bacterial colonization, including the innate immune system, mucus composition, and diet. In contrast, the importance of bacteria–bacteria interactions on host colonization is less understood. Here, we use bacterial abundance data of the marine model organism Nematostella vectensis to reconstruct potential bacteria–bacteria interactions through co-occurrence networks. The analysis indicates that bacteria–bacteria interactions are dynamic during host colonization and change according to the host’s developmental stage. To assess the predictive power of inferred interactions, we tested bacterial isolates with predicted cooperative or competitive behavior for their ability to influence bacterial recolonization dynamics. Within 3 days of recolonization, all tested bacterial isolates affected bacterial community structure, while only competitive bacteria increased bacterial diversity. Only 1 week after recolonization, almost no differences in bacterial community structure could be observed between control and treatments. These results show that predicted competitive bacteria can influence community structure for a short period of time, verifying the in silico predictions. However, within 1 week, the effects of the bacterial isolates are neutralized, indicating a high degree of resilience of the bacterial community.

Link Prediction in Social Networks: the State-of-the-Art

OpenAIRE

Wang, Peng; Xu, Baowen; Wu, Yurong; Zhou, Xiaoyu

2014-01-01

In social networks, link prediction predicts missing links in current networks and new or dissolution links in future networks, is important for mining and analyzing the evolution of social networks. In the past decade, many works have been done about the link prediction in social networks. The goal of this paper is to comprehensively review, analyze and discuss the state-of-the-art of the link prediction in social networks. A systematical category for link prediction techniques and problems ...

Prediction of Narcissism, Perception of Social Interactions and Marital Conflicts Based on the Use of Social Networks

OpenAIRE

رویا رضاپور; محمد مهدی ذاکری; لقمان ابراهیمی

2017-01-01

The prevalence of social networks and the excessive use of them by couples have had a significant impact on various aspects of their lives. The aim of this study was to investigate the role of social networks in the formation of narcissism, perception of social interaction and marital conflicts in couples who use these social networks. The study design was correlational and the statistical population included couples of Zanjan city who use social networks. 120 couples which widely used social...

Neural networks to predict exosphere temperature corrections

Science.gov (United States)

Choury, Anna; Bruinsma, Sean; Schaeffer, Philippe

2013-10-01

Precise orbit prediction requires a forecast of the atmospheric drag force with a high degree of accuracy. Artificial neural networks are universal approximators derived from artificial intelligence and are widely used for prediction. This paper presents a method of artificial neural networking for prediction of the thermosphere density by forecasting exospheric temperature, which will be used by the semiempirical thermosphere Drag Temperature Model (DTM) currently developed. Artificial neural network has shown to be an effective and robust forecasting model for temperature prediction. The proposed model can be used for any mission from which temperature can be deduced accurately, i.e., it does not require specific training. Although the primary goal of the study was to create a model for 1 day ahead forecast, the proposed architecture has been generalized to 2 and 3 days prediction as well. The impact of artificial neural network predictions has been quantified for the low-orbiting satellite Gravity Field and Steady-State Ocean Circulation Explorer in 2011, and an order of magnitude smaller orbit errors were found when compared with orbits propagated using the thermosphere model DTM2009.

Predicting forest insect flight activity: A Bayesian network approach.

Directory of Open Access Journals (Sweden)

Stephen M Pawson

Full Text Available Daily flight activity patterns of forest insects are influenced by temporal and meteorological conditions. Temperature and time of day are frequently cited as key drivers of activity; however, complex interactions between multiple contributing factors have also been proposed. Here, we report individual Bayesian network models to assess the probability of flight activity of three exotic insects, Hylurgus ligniperda, Hylastes ater, and Arhopalus ferus in a managed plantation forest context. Models were built from 7,144 individual hours of insect sampling, temperature, wind speed, relative humidity, photon flux density, and temporal data. Discretized meteorological and temporal variables were used to build naïve Bayes tree augmented networks. Calibration results suggested that the H. ater and A. ferus Bayesian network models had the best fit for low Type I and overall errors, and H. ligniperda had the best fit for low Type II errors. Maximum hourly temperature and time since sunrise had the largest influence on H. ligniperda flight activity predictions, whereas time of day and year had the greatest influence on H. ater and A. ferus activity. Type II model errors for the prediction of no flight activity is improved by increasing the model's predictive threshold. Improvements in model performance can be made by further sampling, increasing the sensitivity of the flight intercept traps, and replicating sampling in other regions. Predicting insect flight informs an assessment of the potential phytosanitary risks of wood exports. Quantifying this risk allows mitigation treatments to be targeted to prevent the spread of invasive species via international trade pathways.

Financial time series prediction using spiking neural networks.

Science.gov (United States)

Reid, David; Hussain, Abir Jaafar; Tawfik, Hissam

2014-01-01

In this paper a novel application of a particular type of spiking neural network, a Polychronous Spiking Network, was used for financial time series prediction. It is argued that the inherent temporal capabilities of this type of network are suited to non-stationary data such as this. The performance of the spiking neural network was benchmarked against three systems: two "traditional", rate-encoded, neural networks; a Multi-Layer Perceptron neural network and a Dynamic Ridge Polynomial neural network, and a standard Linear Predictor Coefficients model. For this comparison three non-stationary and noisy time series were used: IBM stock data; US/Euro exchange rate data, and the price of Brent crude oil. The experiments demonstrated favourable prediction results for the Spiking Neural Network in terms of Annualised Return and prediction error for 5-Step ahead predictions. These results were also supported by other relevant metrics such as Maximum Drawdown and Signal-To-Noise ratio. This work demonstrated the applicability of the Polychronous Spiking Network to financial data forecasting and this in turn indicates the potential of using such networks over traditional systems in difficult to manage non-stationary environments.

Defaunation leads to interaction deficits, not interaction compensation, in an island seed dispersal network.

Science.gov (United States)

Fricke, Evan C; Tewksbury, Joshua J; Rogers, Haldre S

2018-01-01

Following defaunation, the loss of interactions with mutualists such as pollinators or seed dispersers may be compensated through increased interactions with remaining mutualists, ameliorating the negative cascading impacts on biodiversity. Alternatively, remaining mutualists may respond to altered competition by reducing the breadth or intensity of their interactions, exacerbating negative impacts on biodiversity. Despite the importance of these responses for our understanding of the dynamics of mutualistic networks and their response to global change, the mechanism and magnitude of interaction compensation within real mutualistic networks remains largely unknown. We examined differences in mutualistic interactions between frugivores and fruiting plants in two island ecosystems possessing an intact or disrupted seed dispersal network. We determined how changes in the abundance and behavior of remaining seed dispersers either increased mutualistic interactions (contributing to "interaction compensation") or decreased interactions (causing an "interaction deficit") in the disrupted network. We found a "rich-get-richer" response in the disrupted network, where remaining frugivores favored the plant species with highest interaction frequency, a dynamic that worsened the interaction deficit among plant species with low interaction frequency. Only one of five plant species experienced compensation and the other four had significant interaction deficits, with interaction frequencies 56-95% lower in the disrupted network. These results do not provide support for the strong compensating mechanisms assumed in theoretical network models, suggesting that existing network models underestimate the prevalence of cascading mutualism disruption after defaunation. This work supports a mutualist biodiversity-ecosystem functioning relationship, highlighting the importance of mutualist diversity for sustaining diverse and resilient ecosystems. © 2017 John Wiley & Sons Ltd.

A Wavelet Analysis-Based Dynamic Prediction Algorithm to Network Traffic

Directory of Open Access Journals (Sweden)

Meng Fan-Bo

2016-01-01

Full Text Available Network traffic is a significantly important parameter for network traffic engineering, while it holds highly dynamic nature in the network. Accordingly, it is difficult and impossible to directly predict traffic amount of end-to-end flows. This paper proposes a new prediction algorithm to network traffic using the wavelet analysis. Firstly, network traffic is converted into the time-frequency domain to capture time-frequency feature of network traffic. Secondly, in different frequency components, we model network traffic in the time-frequency domain. Finally, we build the prediction model about network traffic. At the same time, the corresponding prediction algorithm is presented to attain network traffic prediction. Simulation results indicates that our approach is promising.

Social Interaction in Learning Networks

NARCIS (Netherlands)

Sloep, Peter

2009-01-01

The original publication is available from www.springerlink.com. Sloep, P. (2009). Social Interaction in Learning Networks. In R. Koper (Ed.), Learning Network Services for Professional Development (pp 13-15). Berlin, Germany: Springer Verlag.

Neural Networks for protein Structure Prediction

DEFF Research Database (Denmark)

Bohr, Henrik

1998-01-01

This is a review about neural network applications in bioinformatics. Especially the applications to protein structure prediction, e.g. prediction of secondary structures, prediction of surface structure, fold class recognition and prediction of the 3-dimensional structure of protein backbones...

Rhizoma Dioscoreae extract protects against alveolar bone loss by regulating the cell cycle: A predictive study based on the protein‑protein interaction network.

Science.gov (United States)

Zhang, Zhi-Guo; Song, Chang-Heng; Zhang, Fang-Zhen; Chen, Yan-Jing; Xiang, Li-Hua; Xiao, Gary Guishan; Ju, Da-Hong

2016-06-01

Rhizoma Dioscoreae extract (RDE) exhibits a protective effect on alveolar bone loss in ovariectomized (OVX) rats. The aim of this study was to predict the pathways or targets that are regulated by RDE, by re‑assessing our previously reported data and conducting a protein‑protein interaction (PPI) network analysis. In total, 383 differentially expressed genes (≥3‑fold) between alveolar bone samples from the RDE and OVX group rats were identified, and a PPI network was constructed based on these genes. Furthermore, four molecular clusters (A‑D) in the PPI network with the smallest P‑values were detected by molecular complex detection (MCODE) algorithm. Using Database for Annotation, Visualization and Integrated Discovery (DAVID) and Ingenuity Pathway Analysis (IPA) tools, two molecular clusters (A and B) were enriched for biological process in Gene Ontology (GO). Only cluster A was associated with biological pathways in the IPA database. GO and pathway analysis results showed that cluster A, associated with cell cycle regulation, was the most important molecular cluster in the PPI network. In addition, cyclin‑dependent kinase 1 (CDK1) may be a key molecule achieving the cell‑cycle‑regulatory function of cluster A. From the PPI network analysis, it was predicted that delayed cell cycle progression in excessive alveolar bone remodeling via downregulation of CDK1 may be another mechanism underling the anti‑osteopenic effect of RDE on alveolar bone.

Auditing Medical Records Accesses via Healthcare Interaction Networks

Science.gov (United States)

Chen, You; Nyemba, Steve; Malin, Bradley

2012-01-01

Healthcare organizations are deploying increasingly complex clinical information systems to support patient care. Traditional information security practices (e.g., role-based access control) are embedded in enterprise-level systems, but are insufficient to ensure patient privacy. This is due, in part, to the dynamic nature of healthcare, which makes it difficult to predict which care providers need access to what and when. In this paper, we show that modeling operations at a higher level of granularity (e.g., the departmental level) are stable in the context of a relational network, which may enable more effective auditing strategies. We study three months of access logs from a large academic medical center to illustrate that departmental interaction networks exhibit certain invariants, such as the number, strength, and reciprocity of relationships. We further show that the relations extracted from the network can be leveraged to assess the extent to which a patient’s care satisfies expected organizational behavior. PMID:23304277

Convergent evidence for hierarchical prediction networks from human electrocorticography and magnetoencephalography.

Science.gov (United States)

Phillips, Holly N; Blenkmann, Alejandro; Hughes, Laura E; Kochen, Silvia; Bekinschtein, Tristan A; Cam-Can; Rowe, James B

2016-09-01

We propose that sensory inputs are processed in terms of optimised predictions and prediction error signals within hierarchical neurocognitive models. The combination of non-invasive brain imaging and generative network models has provided support for hierarchical frontotemporal interactions in oddball tasks, including recent identification of a temporal expectancy signal acting on prefrontal cortex. However, these studies are limited by the need to invert magnetoencephalographic or electroencephalographic sensor signals to localise activity from cortical 'nodes' in the network, or to infer neural responses from indirect measures such as the fMRI BOLD signal. To overcome this limitation, we examined frontotemporal interactions estimated from direct cortical recordings from two human participants with cortical electrode grids (electrocorticography - ECoG). Their frontotemporal network dynamics were compared to those identified by magnetoencephalography (MEG) in forty healthy adults. All participants performed the same auditory oddball task with standard tones interspersed with five deviant tone types. We normalised post-operative electrode locations to standardised anatomic space, to compare across modalities, and inverted the MEG to cortical sources using the estimated lead field from subject-specific head models. A mismatch negativity signal in frontal and temporal cortex was identified in all subjects. Generative models of the electrocorticographic and magnetoencephalographic data were separately compared using the free-energy estimate of the model evidence. Model comparison confirmed the same critical features of hierarchical frontotemporal networks in each patient as in the group-wise MEG analysis. These features included bilateral, feedforward and feedback frontotemporal modulated connectivity, in addition to an asymmetric expectancy driving input on left frontal cortex. The invasive ECoG provides an important step in construct validation of the use of neural

Stock market index prediction using neural networks

Science.gov (United States)

Komo, Darmadi; Chang, Chein-I.; Ko, Hanseok

1994-03-01

A neural network approach to stock market index prediction is presented. Actual data of the Wall Street Journal's Dow Jones Industrial Index has been used for a benchmark in our experiments where Radial Basis Function based neural networks have been designed to model these indices over the period from January 1988 to Dec 1992. A notable success has been achieved with the proposed model producing over 90% prediction accuracies observed based on monthly Dow Jones Industrial Index predictions. The model has also captured both moderate and heavy index fluctuations. The experiments conducted in this study demonstrated that the Radial Basis Function neural network represents an excellent candidate to predict stock market index.

The Algorithm of Link Prediction on Social Network

Directory of Open Access Journals (Sweden)

Liyan Dong

2013-01-01

Full Text Available At present, most link prediction algorithms are based on the similarity between two entities. Social network topology information is one of the main sources to design the similarity function between entities. But the existing link prediction algorithms do not apply the network topology information sufficiently. For lack of traditional link prediction algorithms, we propose two improved algorithms: CNGF algorithm based on local information and KatzGF algorithm based on global information network. For the defect of the stationary of social network, we also provide the link prediction algorithm based on nodes multiple attributes information. Finally, we verified these algorithms on DBLP data set, and the experimental results show that the performance of the improved algorithm is superior to that of the traditional link prediction algorithm.

Protein Annotation from Protein Interaction Networks and Gene Ontology

OpenAIRE

Nguyen, Cao D.; Gardiner, Katheleen J.; Cios, Krzysztof J.

2011-01-01

We introduce a novel method for annotating protein function that combines Naïve Bayes and association rules, and takes advantage of the underlying topology in protein interaction networks and the structure of graphs in the Gene Ontology. We apply our method to proteins from the Human Protein Reference Database (HPRD) and show that, in comparison with other approaches, it predicts protein functions with significantly higher recall with no loss of precision. Specifically, it achieves 51% precis...

A network security situation prediction model based on wavelet neural network with optimized parameters

Directory of Open Access Journals (Sweden)

Haibo Zhang

2016-08-01

Full Text Available The security incidents ion networks are sudden and uncertain, it is very hard to precisely predict the network security situation by traditional methods. In order to improve the prediction accuracy of the network security situation, we build a network security situation prediction model based on Wavelet Neural Network (WNN with optimized parameters by the Improved Niche Genetic Algorithm (INGA. The proposed model adopts WNN which has strong nonlinear ability and fault-tolerance performance. Also, the parameters for WNN are optimized through the adaptive genetic algorithm (GA so that WNN searches more effectively. Considering the problem that the adaptive GA converges slowly and easily turns to the premature problem, we introduce a novel niche technology with a dynamic fuzzy clustering and elimination mechanism to solve the premature convergence of the GA. Our final simulation results show that the proposed INGA-WNN prediction model is more reliable and effective, and it achieves faster convergence-speed and higher prediction accuracy than the Genetic Algorithm-Wavelet Neural Network (GA-WNN, Genetic Algorithm-Back Propagation Neural Network (GA-BPNN and WNN.

Finding low-conductance sets with dense interactions (FLCD) for better protein complex prediction.

Science.gov (United States)

Wang, Yijie; Qian, Xiaoning

2017-03-14

Intuitively, proteins in the same protein complexes should highly interact with each other but rarely interact with the other proteins in protein-protein interaction (PPI) networks. Surprisingly, many existing computational algorithms do not directly detect protein complexes based on both of these topological properties. Most of them, depending on mathematical definitions of either "modularity" or "conductance", have their own limitations: Modularity has the inherent resolution problem ignoring small protein complexes; and conductance characterizes the separability of complexes but fails to capture the interaction density within complexes. In this paper, we propose a two-step algorithm FLCD (Finding Low-Conductance sets with Dense interactions) to predict overlapping protein complexes with the desired topological structure, which is densely connected inside and well separated from the rest of the networks. First, FLCD detects well-separated subnetworks based on approximating a potential low-conductance set through a personalized PageRank vector from a protein and then solving a mixed integer programming (MIP) problem to find the minimum-conductance set within the identified low-conductance set. At the second step, the densely connected parts in those subnetworks are discovered as the protein complexes by solving another MIP problem that aims to find the dense subnetwork in the minimum-conductance set. Experiments on four large-scale yeast PPI networks from different public databases demonstrate that the complexes predicted by FLCD have better correspondence with the yeast protein complex gold standards than other three state-of-the-art algorithms (ClusterONE, LinkComm, and SR-MCL). Additionally, results of FLCD show higher biological relevance with respect to Gene Ontology (GO) terms by GO enrichment analysis.

Artificial neural network intelligent method for prediction

Science.gov (United States)

Trifonov, Roumen; Yoshinov, Radoslav; Pavlova, Galya; Tsochev, Georgi

2017-09-01

Accounting and financial classification and prediction problems are high challenge and researchers use different methods to solve them. Methods and instruments for short time prediction of financial operations using artificial neural network are considered. The methods, used for prediction of financial data as well as the developed forecasting system with neural network are described in the paper. The architecture of a neural network used four different technical indicators, which are based on the raw data and the current day of the week is presented. The network developed is used for forecasting movement of stock prices one day ahead and consists of an input layer, one hidden layer and an output layer. The training method is algorithm with back propagation of the error. The main advantage of the developed system is self-determination of the optimal topology of neural network, due to which it becomes flexible and more precise The proposed system with neural network is universal and can be applied to various financial instruments using only basic technical indicators as input data.

Evolution of a protein domain interaction network

International Nuclear Information System (INIS)

Li-Feng, Gao; Jian-Jun, Shi; Shan, Guan

2010-01-01

In this paper, we attempt to understand complex network evolution from the underlying evolutionary relationship between biological organisms. Firstly, we construct a Pfam domain interaction network for each of the 470 completely sequenced organisms, and therefore each organism is correlated with a specific Pfam domain interaction network; secondly, we infer the evolutionary relationship of these organisms with the nearest neighbour joining method; thirdly, we use the evolutionary relationship between organisms constructed in the second step as the evolutionary course of the Pfam domain interaction network constructed in the first step. This analysis of the evolutionary course shows: (i) there is a conserved sub-network structure in network evolution; in this sub-network, nodes with lower degree prefer to maintain their connectivity invariant, and hubs tend to maintain their role as a hub is attached preferentially to new added nodes; (ii) few nodes are conserved as hubs; most of the other nodes are conserved as one with very low degree; (iii) in the course of network evolution, new nodes are added to the network either individually in most cases or as clusters with relative high clustering coefficients in a very few cases. (general)

The persuasion network is modulated by drug-use risk and predicts anti-drug message effectiveness

Science.gov (United States)

Mangus, J Michael; Turner, Benjamin O

2017-01-01

Abstract While a persuasion network has been proposed, little is known about how network connections between brain regions contribute to attitude change. Two possible mechanisms have been advanced. One hypothesis predicts that attitude change results from increased connectivity between structures implicated in affective and executive processing in response to increases in argument strength. A second functional perspective suggests that highly arousing messages reduce connectivity between structures implicated in the encoding of sensory information, which disrupts message processing and thereby inhibits attitude change. However, persuasion is a multi-determined construct that results from both message features and audience characteristics. Therefore, persuasive messages should lead to specific functional connectivity patterns among a priori defined structures within the persuasion network. The present study exposed 28 subjects to anti-drug public service announcements where arousal, argument strength, and subject drug-use risk were systematically varied. Psychophysiological interaction analyses provide support for the affective-executive hypothesis but not for the encoding-disruption hypothesis. Secondary analyses show that video-level connectivity patterns among structures within the persuasion network predict audience responses in independent samples (one college-aged, one nationally representative). We propose that persuasion neuroscience research is best advanced by considering network-level effects while accounting for interactions between message features and target audience characteristics. PMID:29140500

Topology of molecular interaction networks

NARCIS (Netherlands)

Winterbach, W.; Van Mieghem, P.; Reinders, M.; Wang, H.; De Ridder, D.

2013-01-01

Molecular interactions are often represented as network models which have become the common language of many areas of biology. Graphs serve as convenient mathematical representations of network models and have themselves become objects of study. Their topology has been intensively researched over

Deep mining heterogeneous networks of biomedical linked data to predict novel drug-target associations.

Science.gov (United States)

Zong, Nansu; Kim, Hyeoneui; Ngo, Victoria; Harismendy, Olivier

2017-08-01

A heterogeneous network topology possessing abundant interactions between biomedical entities has yet to be utilized in similarity-based methods for predicting drug-target associations based on the array of varying features of drugs and their targets. Deep learning reveals features of vertices of a large network that can be adapted in accommodating the similarity-based solutions to provide a flexible method of drug-target prediction. We propose a similarity-based drug-target prediction method that enhances existing association discovery methods by using a topology-based similarity measure. DeepWalk, a deep learning method, is adopted in this study to calculate the similarities within Linked Tripartite Network (LTN), a heterogeneous network generated from biomedical linked datasets. This proposed method shows promising results for drug-target association prediction: 98.96% AUC ROC score with a 10-fold cross-validation and 99.25% AUC ROC score with a Monte Carlo cross-validation with LTN. By utilizing DeepWalk, we demonstrate that: (i) this method outperforms other existing topology-based similarity computation methods, (ii) the performance is better for tripartite than with bipartite networks and (iii) the measure of similarity using network topology outperforms the ones derived from chemical structure (drugs) or genomic sequence (targets). Our proposed methodology proves to be capable of providing a promising solution for drug-target prediction based on topological similarity with a heterogeneous network, and may be readily re-purposed and adapted in the existing of similarity-based methodologies. The proposed method has been developed in JAVA and it is available, along with the data at the following URL: https://github.com/zongnansu1982/drug-target-prediction . nazong@ucsd.edu. Supplementary data are available at Bioinformatics online. © The Author (2017). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com

Predicting wettability behavior of fluorosilica coated metal surface using optimum neural network

Science.gov (United States)

Taghipour-Gorjikolaie, Mehran; Valipour Motlagh, Naser

2018-02-01

The interaction between variables, which are effective on the surface wettability, is very complex to predict the contact angles and sliding angles of liquid drops. In this paper, in order to solve this complexity, artificial neural network was used to develop reliable models for predicting the angles of liquid drops. Experimental data are divided into training data and testing data. By using training data and feed forward structure for the neural network and using particle swarm optimization for training the neural network based models, the optimum models were developed. The obtained results showed that regression index for the proposed models for the contact angles and sliding angles are 0.9874 and 0.9920, respectively. As it can be seen, these values are close to unit and it means the reliable performance of the models. Also, it can be inferred from the results that the proposed model have more reliable performance than multi-layer perceptron and radial basis function based models.

Link Label Prediction in Signed Citation Network

KAUST Repository

Akujuobi, Uchenna

2016-04-12

Link label prediction is the problem of predicting the missing labels or signs of all the unlabeled edges in a network. For signed networks, these labels can either be positive or negative. In recent years, different algorithms have been proposed such as using regression, trust propagation and matrix factorization. These approaches have tried to solve the problem of link label prediction by using ideas from social theories, where most of them predict a single missing label given that labels of other edges are known. However, in most real-world social graphs, the number of labeled edges is usually less than that of unlabeled edges. Therefore, predicting a single edge label at a time would require multiple runs and is more computationally demanding. In this thesis, we look at link label prediction problem on a signed citation network with missing edge labels. Our citation network consists of papers from three major machine learning and data mining conferences together with their references, and edges showing the relationship between them. An edge in our network is labeled either positive (dataset relevant) if the reference is based on the dataset used in the paper or negative otherwise. We present three approaches to predict the missing labels. The first approach converts the label prediction problem into a standard classification problem. We then, generate a set of features for each edge and then adopt Support Vector Machines in solving the classification problem. For the second approach, we formalize the graph such that the edges are represented as nodes with links showing similarities between them. We then adopt a label propagation method to propagate the labels on known nodes to those with unknown labels. In the third approach, we adopt a PageRank approach where we rank the nodes according to the number of incoming positive and negative edges, after which we set a threshold. Based on the ranks, we can infer an edge would be positive if it goes a node above the

MUFOLD-SS: New deep inception-inside-inception networks for protein secondary structure prediction.

Science.gov (United States)

Fang, Chao; Shang, Yi; Xu, Dong

2018-05-01

Protein secondary structure prediction can provide important information for protein 3D structure prediction and protein functions. Deep learning offers a new opportunity to significantly improve prediction accuracy. In this article, a new deep neural network architecture, named the Deep inception-inside-inception (Deep3I) network, is proposed for protein secondary structure prediction and implemented as a software tool MUFOLD-SS. The input to MUFOLD-SS is a carefully designed feature matrix corresponding to the primary amino acid sequence of a protein, which consists of a rich set of information derived from individual amino acid, as well as the context of the protein sequence. Specifically, the feature matrix is a composition of physio-chemical properties of amino acids, PSI-BLAST profile, and HHBlits profile. MUFOLD-SS is composed of a sequence of nested inception modules and maps the input matrix to either eight states or three states of secondary structures. The architecture of MUFOLD-SS enables effective processing of local and global interactions between amino acids in making accurate prediction. In extensive experiments on multiple datasets, MUFOLD-SS outperformed the best existing methods and other deep neural networks significantly. MUFold-SS can be downloaded from http://dslsrv8.cs.missouri.edu/~cf797/MUFoldSS/download.html. © 2018 Wiley Periodicals, Inc.

Simulated tri-trophic networks reveal complex relationships between species diversity and interaction diversity.

Science.gov (United States)

Pardikes, Nicholas A; Lumpkin, Will; Hurtado, Paul J; Dyer, Lee A

2018-01-01

Most of earth's biodiversity is comprised of interactions among species, yet it is unclear what causes variation in interaction diversity across space and time. We define interaction diversity as the richness and relative abundance of interactions linking species together at scales from localized, measurable webs to entire ecosystems. Large-scale patterns suggest that two basic components of interaction diversity differ substantially and predictably between different ecosystems: overall taxonomic diversity and host specificity of consumers. Understanding how these factors influence interaction diversity, and quantifying the causes and effects of variation in interaction diversity are important goals for community ecology. While previous studies have examined the effects of sampling bias and consumer specialization on determining patterns of ecological networks, these studies were restricted to two trophic levels and did not incorporate realistic variation in species diversity and consumer diet breadth. Here, we developed a food web model to generate tri-trophic ecological networks, and evaluated specific hypotheses about how the diversity of trophic interactions and species diversity are related under different scenarios of species richness, taxonomic abundance, and consumer diet breadth. We investigated the accumulation of species and interactions and found that interactions accumulate more quickly; thus, the accumulation of novel interactions may require less sampling effort than sampling species in order to get reliable estimates of either type of diversity. Mean consumer diet breadth influenced the correlation between species and interaction diversity significantly more than variation in both species richness and taxonomic abundance. However, this effect of diet breadth on interaction diversity is conditional on the number of observed interactions included in the models. The results presented here will help develop realistic predictions of the relationships

Influence of degree correlations on network structure and stability in protein-protein interaction networks

Directory of Open Access Journals (Sweden)

Zimmer Ralf

2007-08-01

Full Text Available Abstract Background The existence of negative correlations between degrees of interacting proteins is being discussed since such negative degree correlations were found for the large-scale yeast protein-protein interaction (PPI network of Ito et al. More recent studies observed no such negative correlations for high-confidence interaction sets. In this article, we analyzed a range of experimentally derived interaction networks to understand the role and prevalence of degree correlations in PPI networks. We investigated how degree correlations influence the structure of networks and their tolerance against perturbations such as the targeted deletion of hubs. Results For each PPI network, we simulated uncorrelated, positively and negatively correlated reference networks. Here, a simple model was developed which can create different types of degree correlations in a network without changing the degree distribution. Differences in static properties associated with degree correlations were compared by analyzing the network characteristics of the original PPI and reference networks. Dynamics were compared by simulating the effect of a selective deletion of hubs in all networks. Conclusion Considerable differences between the network types were found for the number of components in the original networks. Negatively correlated networks are fragmented into significantly less components than observed for positively correlated networks. On the other hand, the selective deletion of hubs showed an increased structural tolerance to these deletions for the positively correlated networks. This results in a lower rate of interaction loss in these networks compared to the negatively correlated networks and a decreased disintegration rate. Interestingly, real PPI networks are most similar to the randomly correlated references with respect to all properties analyzed. Thus, although structural properties of networks can be modified considerably by degree

Forex Market Prediction Using NARX Neural Network with Bagging

Directory of Open Access Journals (Sweden)

Shahbazi Nima

2016-01-01

Full Text Available We propose a new methodfor predicting movements in Forex market based on NARX neural network withtime shifting bagging techniqueand financial indicators, such as relative strength index and stochastic indicators. Neural networks have prominent learning ability but they often exhibit bad and unpredictable performance for noisy data. When compared with the static neural networks, our method significantly reducesthe error rate of the responseandimproves the performance of the prediction. We tested three different types ofarchitecture for predicting the response and determined the best network approach. We applied our method to prediction the hourly foreign exchange rates and found remarkable predictability in comprehensive experiments with 2 different foreign exchange rates (GBPUSD and EURUSD.

Visualization of Metabolic Interaction Networks in Microbial Communities Using VisANT 5.0.

Directory of Open Access Journals (Sweden)

Brian R Granger

2016-04-01

Full Text Available The complexity of metabolic networks in microbial communities poses an unresolved visualization and interpretation challenge. We address this challenge in the newly expanded version of a software tool for the analysis of biological networks, VisANT 5.0. We focus in particular on facilitating the visual exploration of metabolic interaction between microbes in a community, e.g. as predicted by COMETS (Computation of Microbial Ecosystems in Time and Space, a dynamic stoichiometric modeling framework. Using VisANT's unique metagraph implementation, we show how one can use VisANT 5.0 to explore different time-dependent ecosystem-level metabolic networks. In particular, we analyze the metabolic interaction network between two bacteria previously shown to display an obligate cross-feeding interdependency. In addition, we illustrate how a putative minimal gut microbiome community could be represented in our framework, making it possible to highlight interactions across multiple coexisting species. We envisage that the "symbiotic layout" of VisANT can be employed as a general tool for the analysis of metabolism in complex microbial communities as well as heterogeneous human tissues. VisANT is freely available at: http://visant.bu.edu and COMETS at http://comets.bu.edu.

Visualization of Metabolic Interaction Networks in Microbial Communities Using VisANT 5.0.

Science.gov (United States)

Granger, Brian R; Chang, Yi-Chien; Wang, Yan; DeLisi, Charles; Segrè, Daniel; Hu, Zhenjun

2016-04-01

The complexity of metabolic networks in microbial communities poses an unresolved visualization and interpretation challenge. We address this challenge in the newly expanded version of a software tool for the analysis of biological networks, VisANT 5.0. We focus in particular on facilitating the visual exploration of metabolic interaction between microbes in a community, e.g. as predicted by COMETS (Computation of Microbial Ecosystems in Time and Space), a dynamic stoichiometric modeling framework. Using VisANT's unique metagraph implementation, we show how one can use VisANT 5.0 to explore different time-dependent ecosystem-level metabolic networks. In particular, we analyze the metabolic interaction network between two bacteria previously shown to display an obligate cross-feeding interdependency. In addition, we illustrate how a putative minimal gut microbiome community could be represented in our framework, making it possible to highlight interactions across multiple coexisting species. We envisage that the "symbiotic layout" of VisANT can be employed as a general tool for the analysis of metabolism in complex microbial communities as well as heterogeneous human tissues. VisANT is freely available at: http://visant.bu.edu and COMETS at http://comets.bu.edu.

BrainNetCNN: Convolutional neural networks for brain networks; towards predicting neurodevelopment.

Science.gov (United States)

Kawahara, Jeremy; Brown, Colin J; Miller, Steven P; Booth, Brian G; Chau, Vann; Grunau, Ruth E; Zwicker, Jill G; Hamarneh, Ghassan

2017-02-01

We propose BrainNetCNN, a convolutional neural network (CNN) framework to predict clinical neurodevelopmental outcomes from brain networks. In contrast to the spatially local convolutions done in traditional image-based CNNs, our BrainNetCNN is composed of novel edge-to-edge, edge-to-node and node-to-graph convolutional filters that leverage the topological locality of structural brain networks. We apply the BrainNetCNN framework to predict cognitive and motor developmental outcome scores from structural brain networks of infants born preterm. Diffusion tensor images (DTI) of preterm infants, acquired between 27 and 46 weeks gestational age, were used to construct a dataset of structural brain connectivity networks. We first demonstrate the predictive capabilities of BrainNetCNN on synthetic phantom networks with simulated injury patterns and added noise. BrainNetCNN outperforms a fully connected neural-network with the same number of model parameters on both phantoms with focal and diffuse injury patterns. We then apply our method to the task of joint prediction of Bayley-III cognitive and motor scores, assessed at 18 months of age, adjusted for prematurity. We show that our BrainNetCNN framework outperforms a variety of other methods on the same data. Furthermore, BrainNetCNN is able to identify an infant's postmenstrual age to within about 2 weeks. Finally, we explore the high-level features learned by BrainNetCNN by visualizing the importance of each connection in the brain with respect to predicting the outcome scores. These findings are then discussed in the context of the anatomy and function of the developing preterm infant brain. Copyright © 2016 Elsevier Inc. All rights reserved.

Interaction Networks: Generating High Level Hints Based on Network Community Clustering

Science.gov (United States)

Eagle, Michael; Johnson, Matthew; Barnes, Tiffany

2012-01-01

We introduce a novel data structure, the Interaction Network, for representing interaction-data from open problem solving environment tutors. We show how using network community detecting techniques are used to identify sub-goals in problems in a logic tutor. We then use those community structures to generate high level hints between sub-goals.…

Structure of the human chromosome interaction network.

Directory of Open Access Journals (Sweden)

Sergio Sarnataro

Full Text Available New Hi-C technologies have revealed that chromosomes have a complex network of spatial contacts in the cell nucleus of higher organisms, whose organisation is only partially understood. Here, we investigate the structure of such a network in human GM12878 cells, to derive a large scale picture of nuclear architecture. We find that the intensity of intra-chromosomal interactions is power-law distributed. Inter-chromosomal interactions are two orders of magnitude weaker and exponentially distributed, yet they are not randomly arranged along the genomic sequence. Intra-chromosomal contacts broadly occur between epigenomically homologous regions, whereas inter-chromosomal contacts are especially associated with regions rich in highly expressed genes. Overall, genomic contacts in the nucleus appear to be structured as a network of networks where a set of strongly individual chromosomal units, as envisaged in the 'chromosomal territory' scenario derived from microscopy, interact with each other via on average weaker, yet far from random and functionally important interactions.

Synchronization in networks with multiple interaction layers

Science.gov (United States)

del Genio, Charo I.; Gómez-Gardeñes, Jesús; Bonamassa, Ivan; Boccaletti, Stefano

2016-01-01

The structure of many real-world systems is best captured by networks consisting of several interaction layers. Understanding how a multilayered structure of connections affects the synchronization properties of dynamical systems evolving on top of it is a highly relevant endeavor in mathematics and physics and has potential applications in several socially relevant topics, such as power grid engineering and neural dynamics. We propose a general framework to assess the stability of the synchronized state in networks with multiple interaction layers, deriving a necessary condition that generalizes the master stability function approach. We validate our method by applying it to a network of Rössler oscillators with a double layer of interactions and show that highly rich phenomenology emerges from this. This includes cases where the stability of synchronization can be induced even if both layers would have individually induced unstable synchrony, an effect genuinely arising from the true multilayer structure of the interactions among the units in the network. PMID:28138540

A Critical Evaluation of Network and Pathway-Based Classifiers for Outcome Prediction in Breast Cancer

NARCIS (Netherlands)

C. Staiger (Christine); S. Cadot; R Kooter; M. Dittrich (Marcus); T. Müller (Tobias); G.W. Klau (Gunnar); L.F.A. Wessels (Lodewyk)

2012-01-01

htmlabstractRecently, several classifiers that combine primary tumor data, like gene expression data, and secondary data sources, such as protein-protein interaction networks, have been proposed for predicting outcome in breast cancer. In these approaches, new composite features are typically

Prediction of miRNA-mRNA associations in Alzheimer's disease mice using network topology.

Science.gov (United States)

Noh, Haneul; Park, Charny; Park, Soojun; Lee, Young Seek; Cho, Soo Young; Seo, Hyemyung

2014-08-03

Little is known about the relationship between miRNA and mRNA expression in Alzheimer's disease (AD) at early- or late-symptomatic stages. Sequence-based target prediction algorithms and anti-correlation profiles have been applied to predict miRNA targets using omics data, but this approach often leads to false positive predictions. Here, we applied the joint profiling analysis of mRNA and miRNA expression levels to Tg6799 AD model mice at 4 and 8 months of age using a network topology-based method. We constructed gene regulatory networks and used the PageRank algorithm to predict significant interactions between miRNA and mRNA. In total, 8 cluster modules were predicted by the transcriptome data for co-expression networks of AD pathology. In total, 54 miRNAs were identified as being differentially expressed in AD. Among these, 50 significant miRNA-mRNA interactions were predicted by integrating sequence target prediction, expression analysis, and the PageRank algorithm. We identified a set of miRNA-mRNA interactions that were changed in the hippocampus of Tg6799 AD model mice. We determined the expression levels of several candidate genes and miRNA. For functional validation in primary cultured neurons from Tg6799 mice (MT) and littermate (LM) controls, the overexpression of ARRDC3 enhanced PPP1R3C expression. ARRDC3 overexpression showed the tendency to decrease the expression of miR139-5p and miR3470a in both LM and MT primary cells. Pathological environment created by Aβ treatment increased the gene expression of PPP1R3C and Sfpq but did not significantly alter the expression of miR139-5p or miR3470a. Aβ treatment increased the promoter activity of ARRDC3 gene in LM primary cells but not in MT primary cells. Our results demonstrate AD-specific changes in the miRNA regulatory system as well as the relationship between the expression levels of miRNAs and their targets in the hippocampus of Tg6799 mice. These data help further our understanding of the function

Towards a predictive theory for genetic regulatory networks

Science.gov (United States)

Tkacik, Gasper

When cells respond to changes in the environment by regulating the expression levels of their genes, we often draw parallels between these biological processes and engineered information processing systems. One can go beyond this qualitative analogy, however, by analyzing information transmission in biochemical ``hardware'' using Shannon's information theory. Here, gene regulation is viewed as a transmission channel operating under restrictive constraints set by the resource costs and intracellular noise. We present a series of results demonstrating that a theory of information transmission in genetic regulatory circuits feasibly yields non-trivial, testable predictions. These predictions concern strategies by which individual gene regulatory elements, e.g., promoters or enhancers, read out their signals; as well as strategies by which small networks of genes, independently or in spatially coupled settings, respond to their inputs. These predictions can be quantitatively compared to the known regulatory networks and their function, and can elucidate how reproducible biological processes, such as embryonic development, can be orchestrated by networks built out of noisy components. Preliminary successes in the gap gene network of the fruit fly Drosophila indicate that a full ab initio theoretical prediction of a regulatory network is possible, a feat that has not yet been achieved for any real regulatory network. We end by describing open challenges on the path towards such a prediction.

Network Compression as a Quality Measure for Protein Interaction Networks

Science.gov (United States)

Royer, Loic; Reimann, Matthias; Stewart, A. Francis; Schroeder, Michael

2012-01-01

With the advent of large-scale protein interaction studies, there is much debate about data quality. Can different noise levels in the measurements be assessed by analyzing network structure? Because proteomic regulation is inherently co-operative, modular and redundant, it is inherently compressible when represented as a network. Here we propose that network compression can be used to compare false positive and false negative noise levels in protein interaction networks. We validate this hypothesis by first confirming the detrimental effect of false positives and false negatives. Second, we show that gold standard networks are more compressible. Third, we show that compressibility correlates with co-expression, co-localization, and shared function. Fourth, we also observe correlation with better protein tagging methods, physiological expression in contrast to over-expression of tagged proteins, and smart pooling approaches for yeast two-hybrid screens. Overall, this new measure is a proxy for both sensitivity and specificity and gives complementary information to standard measures such as average degree and clustering coefficients. PMID:22719828

HitPredict version 4: comprehensive reliability scoring of physical protein?protein interactions from more than 100 species

OpenAIRE

L?pez, Yosvany; Nakai, Kenta; Patil, Ashwini

2015-01-01

HitPredict is a consolidated resource of experimentally identified, physical protein?protein interactions with confidence scores to indicate their reliability. The study of genes and their inter-relationships using methods such as network and pathway analysis requires high quality protein?protein interaction information. Extracting reliable interactions from most of the existing databases is challenging because they either contain only a subset of the available interactions, or a mixture of p...

The persuasion network is modulated by drug-use risk and predicts anti-drug message effectiveness.

Science.gov (United States)

Huskey, Richard; Mangus, J Michael; Turner, Benjamin O; Weber, René

2017-12-01

While a persuasion network has been proposed, little is known about how network connections between brain regions contribute to attitude change. Two possible mechanisms have been advanced. One hypothesis predicts that attitude change results from increased connectivity between structures implicated in affective and executive processing in response to increases in argument strength. A second functional perspective suggests that highly arousing messages reduce connectivity between structures implicated in the encoding of sensory information, which disrupts message processing and thereby inhibits attitude change. However, persuasion is a multi-determined construct that results from both message features and audience characteristics. Therefore, persuasive messages should lead to specific functional connectivity patterns among a priori defined structures within the persuasion network. The present study exposed 28 subjects to anti-drug public service announcements where arousal, argument strength, and subject drug-use risk were systematically varied. Psychophysiological interaction analyses provide support for the affective-executive hypothesis but not for the encoding-disruption hypothesis. Secondary analyses show that video-level connectivity patterns among structures within the persuasion network predict audience responses in independent samples (one college-aged, one nationally representative). We propose that persuasion neuroscience research is best advanced by considering network-level effects while accounting for interactions between message features and target audience characteristics. © The Author (2017). Published by Oxford University Press.

Social Trust Prediction Using Heterogeneous Networks

Science.gov (United States)

HUANG, JIN; NIE, FEIPING; HUANG, HENG; TU, YI-CHENG; LEI, YU

2014-01-01

Along with increasing popularity of social websites, online users rely more on the trustworthiness information to make decisions, extract and filter information, and tag and build connections with other users. However, such social network data often suffer from severe data sparsity and are not able to provide users with enough information. Therefore, trust prediction has emerged as an important topic in social network research. Traditional approaches are primarily based on exploring trust graph topology itself. However, research in sociology and our life experience suggest that people who are in the same social circle often exhibit similar behaviors and tastes. To take advantage of the ancillary information for trust prediction, the challenge then becomes what to transfer and how to transfer. In this article, we address this problem by aggregating heterogeneous social networks and propose a novel joint social networks mining (JSNM) method. Our new joint learning model explores the user-group-level similarity between correlated graphs and simultaneously learns the individual graph structure; therefore, the shared structures and patterns from multiple social networks can be utilized to enhance the prediction tasks. As a result, we not only improve the trust prediction in the target graph but also facilitate other information retrieval tasks in the auxiliary graphs. To optimize the proposed objective function, we use the alternative technique to break down the objective function into several manageable subproblems. We further introduce the auxiliary function to solve the optimization problems with rigorously proved convergence. The extensive experiments have been conducted on both synthetic and real- world data. All empirical results demonstrate the effectiveness of our method. PMID:24729776

Prediction of the Ebola Virus Infection Related Human Genes Using Protein-Protein Interaction Network.

Science.gov (United States)

Cao, HuanHuan; Zhang, YuHang; Zhao, Jia; Zhu, Liucun; Wang, Yi; Li, JiaRui; Feng, Yuan-Ming; Zhang, Ning

2017-01-01

Ebola hemorrhagic fever (EHF) is caused by Ebola virus (EBOV). It is reported that human could be infected by EBOV with a high fatality rate. However, association factors between EBOV and host still tend to be ambiguous. According to the "guilt by association" (GBA) principle, proteins interacting with each other are very likely to function similarly or the same. Based on this assumption, we tried to obtain EBOV infection-related human genes in a protein-protein interaction network using Dijkstra algorithm. We hope it could contribute to the discovery of novel effective treatments. Finally, 15 genes were selected as potential EBOV infection-related human genes. Copyright© Bentham Science Publishers; For any queries, please email at epub@benthamscience.org.

Do networks of social interactions reflect patterns of kinship?

Institute of Scientific and Technical Information of China (English)

Joah R. MADDEN; Johanna F. NIEL SEN; Tim H. CLUTTON-BROCK

2012-01-01

The underlying kin structure of groups of animals may be glimpsed from patterns of spatial position or temporal association between individuals,and is presumed to facilitate inclusive fitness benefits.Such structure may be evident at a finer,behavioural,scale with individuals preferentially interacting with kin.We tested whether kin structure within groups of meerkats Suricata suricatta matched three forms of social interaction networks:grooming,dominance or foraging competitions.Networks of dominance interactions were positively related to networks of kinship,with close relatives engaging in dominance interactions with each other.This relationship persisted even after excluding the breeding dominant pair and when we restricted the kinship network to only include links between first order kin,which are most likely to be able to discern kin through simple rules of thumb.Conversely,we found no relationship between kinship networks and either grooming networks or networks of foraging competitions.This is surprising because a positive association between kin in a grooming network,or a negative association between kin in a network of foraging competitions offers opportunities for inclusive fitness benefits.Indeed,the positive association between kin in a network of dominance interactions that we did detect does not offer clear inclusive fitness benefits to group members.We conclude that kin structure in behavioural interactions in meerkats may be driven by factors other than indirect fitness benefits,and that networks of cooperative behaviours such as grooming may be driven by direct benefits accruing to individuals perhaps through mutualism or manipulation [Current Zoology 58 (2):319-328,2012].

Do networks of social interactions reflect patterns of kinship?

Directory of Open Access Journals (Sweden)

Joah R. MADDEN, Johanna F. NIELSEN, Tim H. CLUTTON-BROCK

2012-04-01

Full Text Available The underlying kin structure of groups of animals may be glimpsed from patterns of spatial position or temporal association between individuals, and is presumed to facilitate inclusive fitness benefits. Such structure may be evident at a finer, behavioural, scale with individuals preferentially interacting with kin. We tested whether kin structure within groups of meerkats Suricata suricatta matched three forms of social interaction networks: grooming, dominance or foraging competitions. Networks of dominance interactions were positively related to networks of kinship, with close relatives engaging in dominance interactions with each other. This relationship persisted even after excluding the breeding dominant pair and when we restricted the kinship network to only include links between first order kin, which are most likely to be able to discern kin through simple rules of thumb. Conversely, we found no relationship between kinship networks and either grooming networks or networks of foraging competitions. This is surprising because a positive association between kin in a grooming network, or a negative association between kin in a network of foraging competitions offers opportunities for inclusive fitness benefits. Indeed, the positive association between kin in a network of dominance interactions that we did detect does not offer clear inclusive fitness benefits to group members. We conclude that kin structure in behavioural interactions in meerkats may be driven by factors other than indirect fitness benefits, and that networks of cooperative behaviours such as grooming may be driven by direct benefits accruing to individuals perhaps through mutualism or manipulation [Current Zoology 58 (2: 319-328, 2012].

Predicting tax avoidance by means of social network analytics

NARCIS (Netherlands)

Jasmien, Lismont; Cardinaels, Eddy; Bruynseels, L.M.L.; De Groote, Sander; Baesens, B.; Lemahieu, W.; Vanthienen, J.

This study predicts tax avoidance by means of social network analytics. We extend previous literature by being the first to build a predictive model including a larger variation of network features. We construct a network of firms connected through shared board membership. Then, we apply three

Recommendation Techniques for Drug-Target Interaction Prediction and Drug Repositioning.

Science.gov (United States)

Alaimo, Salvatore; Giugno, Rosalba; Pulvirenti, Alfredo

2016-01-01

The usage of computational methods in drug discovery is a common practice. More recently, by exploiting the wealth of biological knowledge bases, a novel approach called drug repositioning has raised. Several computational methods are available, and these try to make a high-level integration of all the knowledge in order to discover unknown mechanisms. In this chapter, we review drug-target interaction prediction methods based on a recommendation system. We also give some extensions which go beyond the bipartite network case.

Predictive Control of Networked Multiagent Systems via Cloud Computing.

Science.gov (United States)

Liu, Guo-Ping

2017-01-18

This paper studies the design and analysis of networked multiagent predictive control systems via cloud computing. A cloud predictive control scheme for networked multiagent systems (NMASs) is proposed to achieve consensus and stability simultaneously and to compensate for network delays actively. The design of the cloud predictive controller for NMASs is detailed. The analysis of the cloud predictive control scheme gives the necessary and sufficient conditions of stability and consensus of closed-loop networked multiagent control systems. The proposed scheme is verified to characterize the dynamical behavior and control performance of NMASs through simulations. The outcome provides a foundation for the development of cooperative and coordinative control of NMASs and its applications.

Integration of Structural Dynamics and Molecular Evolution via Protein Interaction Networks: A New Era in Genomic Medicine

Science.gov (United States)

Kumar, Avishek; Butler, Brandon M.; Kumar, Sudhir; Ozkan, S. Banu

2016-01-01

Summary Sequencing technologies are revealing many new non-synonymous single nucleotide variants (nsSNVs) in each personal exome. To assess their functional impacts, comparative genomics is frequently employed to predict if they are benign or not. However, evolutionary analysis alone is insufficient, because it misdiagnoses many disease-associated nsSNVs, such as those at positions involved in protein interfaces, and because evolutionary predictions do not provide mechanistic insights into functional change or loss. Structural analyses can aid in overcoming both of these problems by incorporating conformational dynamics and allostery in nSNV diagnosis. Finally, protein-protein interaction networks using systems-level methodologies shed light onto disease etiology and pathogenesis. Bridging these network approaches with structurally resolved protein interactions and dynamics will advance genomic medicine. PMID:26684487

Meta-path based heterogeneous combat network link prediction

Science.gov (United States)

Li, Jichao; Ge, Bingfeng; Yang, Kewei; Chen, Yingwu; Tan, Yuejin

2017-09-01

The combat system-of-systems in high-tech informative warfare, composed of many interconnected combat systems of different types, can be regarded as a type of complex heterogeneous network. Link prediction for heterogeneous combat networks (HCNs) is of significant military value, as it facilitates reconfiguring combat networks to represent the complex real-world network topology as appropriate with observed information. This paper proposes a novel integrated methodology framework called HCNMP (HCN link prediction based on meta-path) to predict multiple types of links simultaneously for an HCN. More specifically, the concept of HCN meta-paths is introduced, through which the HCNMP can accumulate information by extracting different features of HCN links for all the six defined types. Next, an HCN link prediction model, based on meta-path features, is built to predict all types of links of the HCN simultaneously. Then, the solution algorithm for the HCN link prediction model is proposed, in which the prediction results are obtained by iteratively updating with the newly predicted results until the results in the HCN converge or reach a certain maximum iteration number. Finally, numerical experiments on the dataset of a real HCN are conducted to demonstrate the feasibility and effectiveness of the proposed HCNMP, in comparison with 30 baseline methods. The results show that the performance of the HCNMP is superior to those of the baseline methods.

CONSTRUCTION COST PREDICTION USING NEURAL NETWORKS

Directory of Open Access Journals (Sweden)

Smita K Magdum

2017-10-01

Full Text Available Construction cost prediction is important for construction firms to compete and grow in the industry. Accurate construction cost prediction in the early stage of project is important for project feasibility studies and successful completion. There are many factors that affect the cost prediction. This paper presents construction cost prediction as multiple regression model with cost of six materials as independent variables. The objective of this paper is to develop neural networks and multilayer perceptron based model for construction cost prediction. Different models of NN and MLP are developed with varying hidden layer size and hidden nodes. Four artificial neural network models and twelve multilayer perceptron models are compared. MLP and NN give better results than statistical regression method. As compared to NN, MLP works better on training dataset but fails on testing dataset. Five activation functions are tested to identify suitable function for the problem. ‘elu' transfer function gives better results than other transfer function.

Stringent homology-based prediction of H. sapiens-M. tuberculosis H37Rv protein-protein interactions.

Science.gov (United States)

Zhou, Hufeng; Gao, Shangzhi; Nguyen, Nam Ninh; Fan, Mengyuan; Jin, Jingjing; Liu, Bing; Zhao, Liang; Xiong, Geng; Tan, Min; Li, Shijun; Wong, Limsoon

2014-04-08

H. sapiens-M. tuberculosis H37Rv protein-protein interaction (PPI) data are essential for understanding the infection mechanism of the formidable pathogen M. tuberculosis H37Rv. Computational prediction is an important strategy to fill the gap in experimental H. sapiens-M. tuberculosis H37Rv PPI data. Homology-based prediction is frequently used in predicting both intra-species and inter-species PPIs. However, some limitations are not properly resolved in several published works that predict eukaryote-prokaryote inter-species PPIs using intra-species template PPIs. We develop a stringent homology-based prediction approach by taking into account (i) differences between eukaryotic and prokaryotic proteins and (ii) differences between inter-species and intra-species PPI interfaces. We compare our stringent homology-based approach to a conventional homology-based approach for predicting host-pathogen PPIs, based on cellular compartment distribution analysis, disease gene list enrichment analysis, pathway enrichment analysis and functional category enrichment analysis. These analyses support the validity of our prediction result, and clearly show that our approach has better performance in predicting H. sapiens-M. tuberculosis H37Rv PPIs. Using our stringent homology-based approach, we have predicted a set of highly plausible H. sapiens-M. tuberculosis H37Rv PPIs which might be useful for many of related studies. Based on our analysis of the H. sapiens-M. tuberculosis H37Rv PPI network predicted by our stringent homology-based approach, we have discovered several interesting properties which are reported here for the first time. We find that both host proteins and pathogen proteins involved in the host-pathogen PPIs tend to be hubs in their own intra-species PPI network. Also, both host and pathogen proteins involved in host-pathogen PPIs tend to have longer primary sequence, tend to have more domains, tend to be more hydrophilic, etc. And the protein domains from both

Global patterns of interaction specialization in bird-flower networks

DEFF Research Database (Denmark)

Zanata, Thais B.; Dalsgaard, Bo; Passos, Fernando C.

2017-01-01

, such as plant species richness, asymmetry, latitude, insularity, topography, sampling methods and intensity. Results: Hummingbird–flower networks were more specialized than honeyeater–flower networks. Specifically, hummingbird–flower networks had a lower proportion of realized interactions (lower C), decreased...... in the interaction patterns with their floral resources. Location: Americas, Africa, Asia and Oceania/Australia. Methods: We compiled interaction networks between birds and floral resources for 79 hummingbird, nine sunbird and 33 honeyeater communities. Interaction specialization was quantified through connectance...... (C), complementary specialization (H2′), binary (QB) and weighted modularity (Q), with both observed and null-model corrected values. We compared interaction specialization among the three types of bird–flower communities, both independently and while controlling for potential confounding variables...

Depressive Symptoms and Their Interactions With Emotions and Personality Traits Over Time: Interaction Networks in a Psychiatric Clinic.

Science.gov (United States)

Semino, Laura N; Marksteiner, Josef; Brauchle, Gernot; Danay, Erik

2017-04-13

Associations between depression, personality traits, and emotions are complex and reciprocal. The aim of this study is to explore these interactions in dynamical networks and in a linear way over time depending on the severity of depression. Participants included 110 patients with depressive symptoms (DSM-5 criteria) who were recruited between October 2015 and February 2016 during their inpatient stay in a general psychiatric hospital in Hall in Tyrol, Austria. The patients filled out the Beck Depression Inventory-II, a German emotional competence questionnaire (Emotionale Kompetenz Fragebogen), Positive and Negative Affect Schedule, and the German versions of the Big Five Inventory-short form and State-Trait-Anxiety-Depression Inventory regarding symptoms, emotions, and personality during their inpatient stay and at a 3-month follow-up by mail. Network and regression analyses were performed to explore interactions both in a linear and a dynamical way at baseline and 3 months later. Regression analyses showed that emotions and personality traits gain importance for the prediction of depressive symptoms with decreasing symptomatology at follow-up (personality: baseline, adjusted R2 = 0.24, P personality traits is significantly denser and more interconnected (network comparison test: P = .03) at follow-up than at baseline, meaning that with decreased symptoms interconnections get stronger. During depression, personality traits and emotions are walled off and not strongly interconnected with depressive symptoms in networks. With decreasing depressive symptomatology, interfusing of these areas begins and interconnections become stronger. This finding has practical implications for interventions in an acute depressive state and with decreased symptoms. The network approach offers a new perspective on interactions and is a way to make the complexity of these interactions more tangible. © Copyright 2017 Physicians Postgraduate Press, Inc.

Multilayer networks reveal the spatial structure of seed-dispersal interactions across the Great Rift landscapes.

Science.gov (United States)

Timóteo, Sérgio; Correia, Marta; Rodríguez-Echeverría, Susana; Freitas, Helena; Heleno, Ruben

2018-01-10

Species interaction networks are traditionally explored as discrete entities with well-defined spatial borders, an oversimplification likely impairing their applicability. Using a multilayer network approach, explicitly accounting for inter-habitat connectivity, we investigate the spatial structure of seed-dispersal networks across the Gorongosa National Park, Mozambique. We show that the overall seed-dispersal network is composed by spatially explicit communities of dispersers spanning across habitats, functionally linking the landscape mosaic. Inter-habitat connectivity determines spatial structure, which cannot be accurately described with standard monolayer approaches either splitting or merging habitats. Multilayer modularity cannot be predicted by null models randomizing either interactions within each habitat or those linking habitats; however, as habitat connectivity increases, random processes become more important for overall structure. The importance of dispersers for the overall network structure is captured by multilayer versatility but not by standard metrics. Highly versatile species disperse many plant species across multiple habitats, being critical to landscape functional cohesion.

Interactive Network Exploration with Orange

Directory of Open Access Journals (Sweden)

Miha Štajdohar

2013-04-01

Full Text Available Network analysis is one of the most widely used techniques in many areas of modern science. Most existing tools for that purpose are limited to drawing networks and computing their basic general characteristics. The user is not able to interactively and graphically manipulate the networks, select and explore subgraphs using other statistical and data mining techniques, add and plot various other data within the graph, and so on. In this paper we present a tool that addresses these challenges, an add-on for exploration of networks within the general component-based environment Orange.

The function of communities in protein interaction networks at multiple scales

Directory of Open Access Journals (Sweden)

Jones Nick S

2010-07-01

Full Text Available Abstract Background If biology is modular then clusters, or communities, of proteins derived using only protein interaction network structure should define protein modules with similar biological roles. We investigate the link between biological modules and network communities in yeast and its relationship to the scale at which we probe the network. Results Our results demonstrate that the functional homogeneity of communities depends on the scale selected, and that almost all proteins lie in a functionally homogeneous community at some scale. We judge functional homogeneity using a novel test and three independent characterizations of protein function, and find a high degree of overlap between these measures. We show that a high mean clustering coefficient of a community can be used to identify those that are functionally homogeneous. By tracing the community membership of a protein through multiple scales we demonstrate how our approach could be useful to biologists focusing on a particular protein. Conclusions We show that there is no one scale of interest in the community structure of the yeast protein interaction network, but we can identify the range of resolution parameters that yield the most functionally coherent communities, and predict which communities are most likely to be functionally homogeneous.

A conserved mammalian protein interaction network.

Directory of Open Access Journals (Sweden)

Åsa Pérez-Bercoff

Full Text Available Physical interactions between proteins mediate a variety of biological functions, including signal transduction, physical structuring of the cell and regulation. While extensive catalogs of such interactions are known from model organisms, their evolutionary histories are difficult to study given the lack of interaction data from phylogenetic outgroups. Using phylogenomic approaches, we infer a upper bound on the time of origin for a large set of human protein-protein interactions, showing that most such interactions appear relatively ancient, dating no later than the radiation of placental mammals. By analyzing paired alignments of orthologous and putatively interacting protein-coding genes from eight mammals, we find evidence for weak but significant co-evolution, as measured by relative selective constraint, between pairs of genes with interacting proteins. However, we find no strong evidence for shared instances of directional selection within an interacting pair. Finally, we use a network approach to show that the distribution of selective constraint across the protein interaction network is non-random, with a clear tendency for interacting proteins to share similar selective constraints. Collectively, the results suggest that, on the whole, protein interactions in mammals are under selective constraint, presumably due to their functional roles.

Neural Network Classifiers for Local Wind Prediction.

Science.gov (United States)

Kretzschmar, Ralf; Eckert, Pierre; Cattani, Daniel; Eggimann, Fritz

2004-05-01

This paper evaluates the quality of neural network classifiers for wind speed and wind gust prediction with prediction lead times between +1 and +24 h. The predictions were realized based on local time series and model data. The selection of appropriate input features was initiated by time series analysis and completed by empirical comparison of neural network classifiers trained on several choices of input features. The selected input features involved day time, yearday, features from a single wind observation device at the site of interest, and features derived from model data. The quality of the resulting classifiers was benchmarked against persistence for two different sites in Switzerland. The neural network classifiers exhibited superior quality when compared with persistence judged on a specific performance measure, hit and false-alarm rates.

Prefrontal mediation of the reading network predicts intervention response in dyslexia.

Science.gov (United States)

Aboud, Katherine S; Barquero, Laura A; Cutting, Laurie E

2018-04-01

A primary challenge facing the development of interventions for dyslexia is identifying effective predictors of intervention response. While behavioral literature has identified core cognitive characteristics of response, the distinction of reading versus executive cognitive contributions to response profiles remains unclear, due in part to the difficulty of segregating these constructs using behavioral outputs. In the current study we used functional neuroimaging to piece apart the mechanisms of how/whether executive and reading network relationships are predictive of intervention response. We found that readers who are responsive to intervention have more typical pre-intervention functional interactions between executive and reading systems compared to nonresponsive readers. These findings suggest that intervention response in dyslexia is influenced not only by domain-specific reading regions, but also by contributions from intervening domain-general networks. Our results make a significant gain in identifying predictive bio-markers of outcomes in dyslexia, and have important implications for the development of personalized clinical interventions. Copyright © 2018 Elsevier Ltd. All rights reserved.

Drug-domain interaction networks in myocardial infarction.

Science.gov (United States)

Wang, Haiying; Zheng, Huiru; Azuaje, Francisco; Zhao, Xing-Ming

2013-09-01

It has been well recognized that the pace of the development of new drugs and therapeutic interventions lags far behind biological knowledge discovery. Network-based approaches have emerged as a promising alternative to accelerate the discovery of new safe and effective drugs. Based on the integration of several biological resources including two recently published datasets i.e., Drug-target interactions in myocardial infarction (My-DTome) and drug-domain interaction network, this paper reports the association between drugs and protein domains in the context of myocardial infarction (MI). A MI drug-domain interaction network, My-DDome, was firstly constructed, followed by topological analysis and functional characterization of the network. The results show that My-DDome has a very clear modular structure, where drugs interacting with the same domain(s) within each module tend to have similar therapeutic effects. Moreover it has been found that drugs acting on blood and blood forming organs (ATC code B) and sensory organs (ATC code S) are significantly enriched in My-DDome (p drugs, their known targets, and seemingly unrelated proteins can be revealed.

Prediction of Protein-Protein Interaction By Metasample-Based Sparse Representation

Directory of Open Access Journals (Sweden)

Xiuquan Du

2015-01-01

Full Text Available Protein-protein interactions (PPIs play key roles in many cellular processes such as transcription regulation, cell metabolism, and endocrine function. Understanding these interactions takes a great promotion to the pathogenesis and treatment of various diseases. A large amount of data has been generated by experimental techniques; however, most of these data are usually incomplete or noisy, and the current biological experimental techniques are always very time-consuming and expensive. In this paper, we proposed a novel method (metasample-based sparse representation classification, MSRC for PPIs prediction. A group of metasamples are extracted from the original training samples and then use the l1-regularized least square method to express a new testing sample as the linear combination of these metasamples. PPIs prediction is achieved by using a discrimination function defined in the representation coefficients. The MSRC is applied to PPIs dataset; it achieves 84.9% sensitivity, and 94.55% specificity, which is slightly lower than support vector machine (SVM and much higher than naive Bayes (NB, neural networks (NN, and k-nearest neighbor (KNN. The result shows that the MSRC is efficient for PPIs prediction.

Predicting economic growth with stock networks

Science.gov (United States)

Heiberger, Raphael H.

2018-01-01

Networks derived from stock prices are often used to model developments on financial markets and are tightly intertwined with crises. Yet, the influence of changing market topologies on the broader economy (i.e. GDP) is unclear. In this paper, we propose a Bayesian approach that utilizes individual-level network measures of companies as lagged probabilistic features to predict national economic growth. We use a comprehensive data set consisting of Standard and Poor's 500 corporations from January 1988 until October 2016. The final model forecasts correctly all major recession and prosperity phases of the U.S. economy up to one year ahead. By employing different network measures on the level of corporations, we can also identify which companies' stocks possess a key role in a changing economic environment and may be used as indication of critical (and prosperous) developments. More generally, the proposed approach allows to predict probabilities for different overall states of social entities by using local network positions and could be applied on various phenomena.

Prediction of residue-residue contact matrix for protein-protein interaction with Fisher score features and deep learning.

Science.gov (United States)

Du, Tianchuan; Liao, Li; Wu, Cathy H; Sun, Bilin

2016-11-01

Protein-protein interactions play essential roles in many biological processes. Acquiring knowledge of the residue-residue contact information of two interacting proteins is not only helpful in annotating functions for proteins, but also critical for structure-based drug design. The prediction of the protein residue-residue contact matrix of the interfacial regions is challenging. In this work, we introduced deep learning techniques (specifically, stacked autoencoders) to build deep neural network models to tackled the residue-residue contact prediction problem. In tandem with interaction profile Hidden Markov Models, which was used first to extract Fisher score features from protein sequences, stacked autoencoders were deployed to extract and learn hidden abstract features. The deep learning model showed significant improvement over the traditional machine learning model, Support Vector Machines (SVM), with the overall accuracy increased by 15% from 65.40% to 80.82%. We showed that the stacked autoencoders could extract novel features, which can be utilized by deep neural networks and other classifiers to enhance learning, out of the Fisher score features. It is further shown that deep neural networks have significant advantages over SVM in making use of the newly extracted features. Copyright © 2016. Published by Elsevier Inc.

Specificity and evolvability in eukaryotic protein interaction networks.

Directory of Open Access Journals (Sweden)

Pedro Beltrao

2007-02-01

Full Text Available Progress in uncovering the protein interaction networks of several species has led to questions of what underlying principles might govern their organization. Few studies have tried to determine the impact of protein interaction network evolution on the observed physiological differences between species. Using comparative genomics and structural information, we show here that eukaryotic species have rewired their interactomes at a fast rate of approximately 10(-5 interactions changed per protein pair, per million years of divergence. For Homo sapiens this corresponds to 10(3 interactions changed per million years. Additionally we find that the specificity of binding strongly determines the interaction turnover and that different biological processes show significantly different link dynamics. In particular, human proteins involved in immune response, transport, and establishment of localization show signs of positive selection for change of interactions. Our analysis suggests that a small degree of molecular divergence can give rise to important changes at the network level. We propose that the power law distribution observed in protein interaction networks could be partly explained by the cell's requirement for different degrees of protein binding specificity.

Optimum Neural Network Architecture for Precipitation Prediction of Myanmar

OpenAIRE

Khaing Win Mar; Thinn Thu Naing

2008-01-01

Nowadays, precipitation prediction is required for proper planning and management of water resources. Prediction with neural network models has received increasing interest in various research and application domains. However, it is difficult to determine the best neural network architecture for prediction since it is not immediately obvious how many input or hidden nodes are used in the model. In this paper, neural network model is used as a forecasting tool. The major aim is to evaluate a s...

Managing uncertainty in metabolic network structure and improving predictions using EnsembleFBA.

Directory of Open Access Journals (Sweden)

Matthew B Biggs

2017-03-01

Full Text Available Genome-scale metabolic network reconstructions (GENREs are repositories of knowledge about the metabolic processes that occur in an organism. GENREs have been used to discover and interpret metabolic functions, and to engineer novel network structures. A major barrier preventing more widespread use of GENREs, particularly to study non-model organisms, is the extensive time required to produce a high-quality GENRE. Many automated approaches have been developed which reduce this time requirement, but automatically-reconstructed draft GENREs still require curation before useful predictions can be made. We present a novel approach to the analysis of GENREs which improves the predictive capabilities of draft GENREs by representing many alternative network structures, all equally consistent with available data, and generating predictions from this ensemble. This ensemble approach is compatible with many reconstruction methods. We refer to this new approach as Ensemble Flux Balance Analysis (EnsembleFBA. We validate EnsembleFBA by predicting growth and gene essentiality in the model organism Pseudomonas aeruginosa UCBPP-PA14. We demonstrate how EnsembleFBA can be included in a systems biology workflow by predicting essential genes in six Streptococcus species and mapping the essential genes to small molecule ligands from DrugBank. We found that some metabolic subsystems contributed disproportionately to the set of predicted essential reactions in a way that was unique to each Streptococcus species, leading to species-specific outcomes from small molecule interactions. Through our analyses of P. aeruginosa and six Streptococci, we show that ensembles increase the quality of predictions without drastically increasing reconstruction time, thus making GENRE approaches more practical for applications which require predictions for many non-model organisms. All of our functions and accompanying example code are available in an open online repository.

Endogenous network states predict gain or loss of functions for genetic mutations in hepatocellular carcinoma.

Science.gov (United States)

Wang, Gaowei; Su, Hang; Yu, Helin; Yuan, Ruoshi; Zhu, Xiaomei; Ao, Ping

2016-02-01

Cancers have been typically characterized by genetic mutations. Patterns of such mutations have traditionally been analysed by posteriori statistical association approaches. One may ponder the possibility of a priori determination of any mutation regularity. Here by exploring biological processes implied in a mechanistic theory recently developed (the endogenous molecular-cellular network theory), we found that the features of genetic mutations in cancers may be predicted without any prior knowledge of mutation propensities. With hepatocellular carcinoma (HCC) as an example, we found that the normal hepatocyte and cancerous hepatocyte can be represented by robust stable states of one single endogenous network. These stable states, specified by distinct patterns of expressions or activities of proteins in the network, provide means to directly identify a set of most probable genetic mutations and their effects in HCC. As the key proteins and main interactions in the network are conserved through cell types in an organism, similar mutational features may also be found in other cancers. This analysis yielded straightforward and testable predictions on accumulated and preferred mutation spectra in normal tissue. The validation of predicted cancer state mutation patterns demonstrates the usefulness and potential of a causal dynamical framework to understand and predict genetic mutations in cancer. © 2016 The Author(s).

Structural stability of interaction networks against negative external fields

Science.gov (United States)

Yoon, S.; Goltsev, A. V.; Mendes, J. F. F.

2018-04-01

We explore structural stability of weighted and unweighted networks of positively interacting agents against a negative external field. We study how the agents support the activity of each other to confront the negative field, which suppresses the activity of agents and can lead to collapse of the whole network. The competition between the interactions and the field shape the structure of stable states of the system. In unweighted networks (uniform interactions) the stable states have the structure of k -cores of the interaction network. The interplay between the topology and the distribution of weights (heterogeneous interactions) impacts strongly the structural stability against a negative field, especially in the case of fat-tailed distributions of weights. We show that apart from critical slowing down there is also a critical change in the system structure that precedes the network collapse. The change can serve as an early warning of the critical transition. To characterize changes of network structure we develop a method based on statistical analysis of the k -core organization and so-called "corona" clusters belonging to the k -cores.

Oligomeric protein structure networks: insights into protein-protein interactions

Directory of Open Access Journals (Sweden)

Brinda KV

2005-12-01

Full Text Available Abstract Background Protein-protein association is essential for a variety of cellular processes and hence a large number of investigations are being carried out to understand the principles of protein-protein interactions. In this study, oligomeric protein structures are viewed from a network perspective to obtain new insights into protein association. Structure graphs of proteins have been constructed from a non-redundant set of protein oligomer crystal structures by considering amino acid residues as nodes and the edges are based on the strength of the non-covalent interactions between the residues. The analysis of such networks has been carried out in terms of amino acid clusters and hubs (highly connected residues with special emphasis to protein interfaces. Results A variety of interactions such as hydrogen bond, salt bridges, aromatic and hydrophobic interactions, which occur at the interfaces are identified in a consolidated manner as amino acid clusters at the interface, from this study. Moreover, the characterization of the highly connected hub-forming residues at the interfaces and their comparison with the hubs from the non-interface regions and the non-hubs in the interface regions show that there is a predominance of charged interactions at the interfaces. Further, strong and weak interfaces are identified on the basis of the interaction strength between amino acid residues and the sizes of the interface clusters, which also show that many protein interfaces are stronger than their monomeric protein cores. The interface strengths evaluated based on the interface clusters and hubs also correlate well with experimentally determined dissociation constants for known complexes. Finally, the interface hubs identified using the present method correlate very well with experimentally determined hotspots in the interfaces of protein complexes obtained from the Alanine Scanning Energetics database (ASEdb. A few predictions of interface hot

PIPE: a protein-protein interaction prediction engine based on the re-occurring short polypeptide sequences between known interacting protein pairs

Directory of Open Access Journals (Sweden)

Greenblatt Jack

2006-07-01

Full Text Available Abstract Background Identification of protein interaction networks has received considerable attention in the post-genomic era. The currently available biochemical approaches used to detect protein-protein interactions are all time and labour intensive. Consequently there is a growing need for the development of computational tools that are capable of effectively identifying such interactions. Results Here we explain the development and implementation of a novel Protein-Protein Interaction Prediction Engine termed PIPE. This tool is capable of predicting protein-protein interactions for any target pair of the yeast Saccharomyces cerevisiae proteins from their primary structure and without the need for any additional information or predictions about the proteins. PIPE showed a sensitivity of 61% for detecting any yeast protein interaction with 89% specificity and an overall accuracy of 75%. This rate of success is comparable to those associated with the most commonly used biochemical techniques. Using PIPE, we identified a novel interaction between YGL227W (vid30 and YMR135C (gid8 yeast proteins. This lead us to the identification of a novel yeast complex that here we term vid30 complex (vid30c. The observed interaction was confirmed by tandem affinity purification (TAP tag, verifying the ability of PIPE to predict novel protein-protein interactions. We then used PIPE analysis to investigate the internal architecture of vid30c. It appeared from PIPE analysis that vid30c may consist of a core and a secondary component. Generation of yeast gene deletion strains combined with TAP tagging analysis indicated that the deletion of a member of the core component interfered with the formation of vid30c, however, deletion of a member of the secondary component had little effect (if any on the formation of vid30c. Also, PIPE can be used to analyse yeast proteins for which TAP tagging fails, thereby allowing us to predict protein interactions that are not

Predicting Positive and Negative Relationships in Large Social Networks.

Directory of Open Access Journals (Sweden)

Guan-Nan Wang

Full Text Available In a social network, users hold and express positive and negative attitudes (e.g. support/opposition towards other users. Those attitudes exhibit some kind of binary relationships among the users, which play an important role in social network analysis. However, some of those binary relationships are likely to be latent as the scale of social network increases. The essence of predicting latent binary relationships have recently began to draw researchers' attention. In this paper, we propose a machine learning algorithm for predicting positive and negative relationships in social networks inspired by structural balance theory and social status theory. More specifically, we show that when two users in the network have fewer common neighbors, the prediction accuracy of the relationship between them deteriorates. Accordingly, in the training phase, we propose a segment-based training framework to divide the training data into two subsets according to the number of common neighbors between users, and build a prediction model for each subset based on support vector machine (SVM. Moreover, to deal with large-scale social network data, we employ a sampling strategy that selects small amount of training data while maintaining high accuracy of prediction. We compare our algorithm with traditional algorithms and adaptive boosting of them. Experimental results of typical data sets show that our algorithm can deal with large social networks and consistently outperforms other methods.

Predicting Positive and Negative Relationships in Large Social Networks.

Science.gov (United States)

Wang, Guan-Nan; Gao, Hui; Chen, Lian; Mensah, Dennis N A; Fu, Yan

2015-01-01

In a social network, users hold and express positive and negative attitudes (e.g. support/opposition) towards other users. Those attitudes exhibit some kind of binary relationships among the users, which play an important role in social network analysis. However, some of those binary relationships are likely to be latent as the scale of social network increases. The essence of predicting latent binary relationships have recently began to draw researchers' attention. In this paper, we propose a machine learning algorithm for predicting positive and negative relationships in social networks inspired by structural balance theory and social status theory. More specifically, we show that when two users in the network have fewer common neighbors, the prediction accuracy of the relationship between them deteriorates. Accordingly, in the training phase, we propose a segment-based training framework to divide the training data into two subsets according to the number of common neighbors between users, and build a prediction model for each subset based on support vector machine (SVM). Moreover, to deal with large-scale social network data, we employ a sampling strategy that selects small amount of training data while maintaining high accuracy of prediction. We compare our algorithm with traditional algorithms and adaptive boosting of them. Experimental results of typical data sets show that our algorithm can deal with large social networks and consistently outperforms other methods.

Personalized Social Network Activity Feeds for Increased Interaction and Content Contribution

Directory of Open Access Journals (Sweden)

Shlomo eBerkovsky

2015-10-01

Full Text Available Online social networks were originally conceived as means of sharing information and activities with friends, and their success has been one of the primary contributors of the tremendous growth of the Web. Social network activity feeds were devised as a means to aggregate recent actions of friends into a convenient list. But the volume of actions and content generated by social network users is overwhelming, such that keeping users up-to-date with friend activities is an ongoing challenge for social network providers. Personalization has been proposed as a solution to combat social network information overload and help users to identify the nuggets of relevant information in the incoming flood of network activities. In this paper, we propose and thoroughly evaluate a personalized model for predicting the relevance of the activity feed items, which informs the ranking of the feeds and facilitates personalization. Results of a live study show that the proposed feed personalization approach successfully identifies and promotes relevant feed items and boosts the uptake of the feeds. In addition, it increases the contribution of user-generated content to the social network and spurs interaction between users.

Application of Intelligent Dynamic Bayesian Network with Wavelet Analysis for Probabilistic Prediction of Storm Track Intensity Index

Directory of Open Access Journals (Sweden)

Ming Li

2018-06-01

Full Text Available The effective prediction of storm track (ST is greatly beneficial for analyzing the development and anomalies of mid-latitude weather systems. For the non-stationarity, nonlinearity, and uncertainty of ST intensity index (STII, a new probabilistic prediction model was proposed based on dynamic Bayesian network (DBN and wavelet analysis (WA. We introduced probability theory and graph theory for the first time to quantitatively describe the nonlinear relationship and uncertain interaction of the ST system. Then a casual prediction network (i.e., DBN was constructed through wavelet decomposition, structural learning, parameter learning, and probabilistic inference, which was used for expression of relation among predictors and probabilistic prediction of STII. The intensity prediction of the North Pacific ST with data from 1961–2010 showed that the new model was able to give more comprehensive prediction information and higher prediction accuracy and had strong generalization ability and good stability.

Investigating physics learning with layered student interaction networks

DEFF Research Database (Denmark)

Bruun, Jesper; Traxler, Adrienne

Centrality in student interaction networks (SINs) can be linked to variables like grades [1], persistence [2], and participation [3]. Recent efforts in the field of network science have been done to investigate layered - or multiplex - networks as mathematical objects [4]. These networks can be e......, this study investigates how target entropy [5,1] and pagerank [6,7] are affected when we take time and modes of interaction into account. We present our preliminary models and results and outline our future work in this area....

A Type-2 fuzzy data fusion approach for building reliable weighted protein interaction networks with application in protein complex detection.

Science.gov (United States)

Mehranfar, Adele; Ghadiri, Nasser; Kouhsar, Morteza; Golshani, Ashkan

2017-09-01

Detecting the protein complexes is an important task in analyzing the protein interaction networks. Although many algorithms predict protein complexes in different ways, surveys on the interaction networks indicate that about 50% of detected interactions are false positives. Consequently, the accuracy of existing methods needs to be improved. In this paper we propose a novel algorithm to detect the protein complexes in 'noisy' protein interaction data. First, we integrate several biological data sources to determine the reliability of each interaction and determine more accurate weights for the interactions. A data fusion component is used for this step, based on the interval type-2 fuzzy voter that provides an efficient combination of the information sources. This fusion component detects the errors and diminishes their effect on the detection protein complexes. So in the first step, the reliability scores have been assigned for every interaction in the network. In the second step, we have proposed a general protein complex detection algorithm by exploiting and adopting the strong points of other algorithms and existing hypotheses regarding real complexes. Finally, the proposed method has been applied for the yeast interaction datasets for predicting the interactions. The results show that our framework has a better performance regarding precision and F-measure than the existing approaches. Copyright © 2017 Elsevier Ltd. All rights reserved.

Integration of structural dynamics and molecular evolution via protein interaction networks: a new era in genomic medicine.

Science.gov (United States)

Kumar, Avishek; Butler, Brandon M; Kumar, Sudhir; Ozkan, S Banu

2015-12-01

Sequencing technologies are revealing many new non-synonymous single nucleotide variants (nsSNVs) in each personal exome. To assess their functional impacts, comparative genomics is frequently employed to predict if they are benign or not. However, evolutionary analysis alone is insufficient, because it misdiagnoses many disease-associated nsSNVs, such as those at positions involved in protein interfaces, and because evolutionary predictions do not provide mechanistic insights into functional change or loss. Structural analyses can aid in overcoming both of these problems by incorporating conformational dynamics and allostery in nSNV diagnosis. Finally, protein-protein interaction networks using systems-level methodologies shed light onto disease etiology and pathogenesis. Bridging these network approaches with structurally resolved protein interactions and dynamics will advance genomic medicine. Copyright © 2015 Elsevier Ltd. All rights reserved.

Centrality Robustness and Link Prediction in Complex Social Networks

DEFF Research Database (Denmark)

Davidsen, Søren Atmakuri; Ortiz-Arroyo, Daniel

2012-01-01

. Secondly, we present a method to predict edges in dynamic social networks. Our experimental results indicate that the robustness of the centrality measures applied to more realistic social networks follows a predictable pattern and that the use of temporal statistics could improve the accuracy achieved......This chapter addresses two important issues in social network analysis that involve uncertainty. Firstly, we present am analysis on the robustness of centrality measures that extend the work presented in Borgati et al. using three types of complex network structures and one real social network...

MSD-MAP: A Network-Based Systems Biology Platform for Predicting Disease-Metabolite Links.

Science.gov (United States)

Wathieu, Henri; Issa, Naiem T; Mohandoss, Manisha; Byers, Stephen W; Dakshanamurthy, Sivanesan

2017-01-01

Cancer-associated metabolites result from cell-wide mechanisms of dysregulation. The field of metabolomics has sought to identify these aberrant metabolites as disease biomarkers, clues to understanding disease mechanisms, or even as therapeutic agents. This study was undertaken to reliably predict metabolites associated with colorectal, esophageal, and prostate cancers. Metabolite and disease biological action networks were compared in a computational platform called MSD-MAP (Multi Scale Disease-Metabolite Association Platform). Using differential gene expression analysis with patient-based RNAseq data from The Cancer Genome Atlas, genes up- or down-regulated in cancer compared to normal tissue were identified. Relational databases were used to map biological entities including pathways, functions, and interacting proteins, to those differential disease genes. Similar relational maps were built for metabolites, stemming from known and in silico predicted metabolite-protein associations. The hypergeometric test was used to find statistically significant relationships between disease and metabolite biological signatures at each tier, and metabolites were assessed for multi-scale association with each cancer. Metabolite networks were also directly associated with various other diseases using a disease functional perturbation database. Our platform recapitulated metabolite-disease links that have been empirically verified in the scientific literature, with network-based mapping of jointly-associated biological activity also matching known disease mechanisms. This was true for colorectal, esophageal, and prostate cancers, using metabolite action networks stemming from both predicted and known functional protein associations. By employing systems biology concepts, MSD-MAP reliably predicted known cancermetabolite links, and may serve as a predictive tool to streamline conventional metabolomic profiling methodologies. Copyright© Bentham Science Publishers; For any

Becoming popular: interpersonal emotion regulation predicts relationship formation in real life social networks

Science.gov (United States)

Niven, Karen; Garcia, David; van der Löwe, Ilmo; Holman, David; Mansell, Warren

2015-01-01

Building relationships is crucial for satisfaction and success, especially when entering new social contexts. In the present paper, we investigate whether attempting to improve others’ feelings helps people to make connections in new networks. In Study 1, a social network study following new networks of people for a 12-week period indicated that use of interpersonal emotion regulation (IER) strategies predicted growth in popularity, as indicated by other network members’ reports of spending time with the person, in work and non-work interactions. In Study 2, linguistic analysis of the tweets from over 8000 Twitter users from formation of their accounts revealed that use of IER predicted greater popularity in terms of the number of followers gained. However, not all types of IER had positive effects. Behavioral IER strategies (which use behavior to reassure or comfort in order to regulate affect) were associated with greater popularity, while cognitive strategies (which change a person’s thoughts about his or her situation or feelings in order to regulate affect) were negatively associated with popularity. Our findings have implications for our understanding of how new relationships are formed, highlighting the important the role played by intentional emotion regulatory processes. PMID:26483718

Becoming popular: Interpersonal emotion regulation predicts relationship formation in real life social networks

Directory of Open Access Journals (Sweden)

Karen eNiven

2015-09-01

Full Text Available Building relationships is crucial for satisfaction and success, especially when entering new social contexts. In the present paper, we investigate whether attempting to improve others’ feelings helps people to make connections in new networks. In Study 1, a social network study following new networks of people for a twelve-week period indicated that use of interpersonal emotion regulation (IER strategies predicted growth in popularity, as indicated by other network members’ reports of spending time with the person, in work and non-work interactions. In Study 2, linguistic analysis of the tweets from over 8000 Twitter users from formation of their accounts revealed that use of IER predicted greater popularity in terms of the number of followers gained. However, not all types of IER had positive effects. Behavioral IER strategies (which use behavior to reassure or comfort in order to regulate affect were associated with greater popularity, while cognitive strategies (which change a person’s thoughts about his or her situation or feelings in order to regulate affect were negatively associated with popularity. Our findings have implications for our understanding of how new relationships are formed, highlighting the important the role played by intentional emotion regulatory processes.

Evidence of probabilistic behaviour in protein interaction networks

Directory of Open Access Journals (Sweden)

Reifman Jaques

2008-01-01

Full Text Available Abstract Background Data from high-throughput experiments of protein-protein interactions are commonly used to probe the nature of biological organization and extract functional relationships between sets of proteins. What has not been appreciated is that the underlying mechanisms involved in assembling these networks may exhibit considerable probabilistic behaviour. Results We find that the probability of an interaction between two proteins is generally proportional to the numerical product of their individual interacting partners, or degrees. The degree-weighted behaviour is manifested throughout the protein-protein interaction networks studied here, except for the high-degree, or hub, interaction areas. However, we find that the probabilities of interaction between the hubs are still high. Further evidence is provided by path length analyses, which show that these hubs are separated by very few links. Conclusion The results suggest that protein-protein interaction networks incorporate probabilistic elements that lead to scale-rich hierarchical architectures. These observations seem to be at odds with a biologically-guided organization. One interpretation of the findings is that we are witnessing the ability of proteins to indiscriminately bind rather than the protein-protein interactions that are actually utilized by the cell in biological processes. Therefore, the topological study of a degree-weighted network requires a more refined methodology to extract biological information about pathways, modules, or other inferred relationships among proteins.

A biological network-based regularized artificial neural network model for robust phenotype prediction from gene expression data.

Science.gov (United States)

Kang, Tianyu; Ding, Wei; Zhang, Luoyan; Ziemek, Daniel; Zarringhalam, Kourosh

2017-12-19

Stratification of patient subpopulations that respond favorably to treatment or experience and adverse reaction is an essential step toward development of new personalized therapies and diagnostics. It is currently feasible to generate omic-scale biological measurements for all patients in a study, providing an opportunity for machine learning models to identify molecular markers for disease diagnosis and progression. However, the high variability of genetic background in human populations hampers the reproducibility of omic-scale markers. In this paper, we develop a biological network-based regularized artificial neural network model for prediction of phenotype from transcriptomic measurements in clinical trials. To improve model sparsity and the overall reproducibility of the model, we incorporate regularization for simultaneous shrinkage of gene sets based on active upstream regulatory mechanisms into the model. We benchmark our method against various regression, support vector machines and artificial neural network models and demonstrate the ability of our method in predicting the clinical outcomes using clinical trial data on acute rejection in kidney transplantation and response to Infliximab in ulcerative colitis. We show that integration of prior biological knowledge into the classification as developed in this paper, significantly improves the robustness and generalizability of predictions to independent datasets. We provide a Java code of our algorithm along with a parsed version of the STRING DB database. In summary, we present a method for prediction of clinical phenotypes using baseline genome-wide expression data that makes use of prior biological knowledge on gene-regulatory interactions in order to increase robustness and reproducibility of omic-scale markers. The integrated group-wise regularization methods increases the interpretability of biological signatures and gives stable performance estimates across independent test sets.

Protein annotation from protein interaction networks and Gene Ontology.

Science.gov (United States)

Nguyen, Cao D; Gardiner, Katheleen J; Cios, Krzysztof J

2011-10-01

We introduce a novel method for annotating protein function that combines Naïve Bayes and association rules, and takes advantage of the underlying topology in protein interaction networks and the structure of graphs in the Gene Ontology. We apply our method to proteins from the Human Protein Reference Database (HPRD) and show that, in comparison with other approaches, it predicts protein functions with significantly higher recall with no loss of precision. Specifically, it achieves 51% precision and 60% recall versus 45% and 26% for Majority and 24% and 61% for χ²-statistics, respectively. Copyright © 2011 Elsevier Inc. All rights reserved.

CNNcon: improved protein contact maps prediction using cascaded neural networks.

Directory of Open Access Journals (Sweden)

Wang Ding

Full Text Available BACKGROUNDS: Despite continuing progress in X-ray crystallography and high-field NMR spectroscopy for determination of three-dimensional protein structures, the number of unsolved and newly discovered sequences grows much faster than that of determined structures. Protein modeling methods can possibly bridge this huge sequence-structure gap with the development of computational science. A grand challenging problem is to predict three-dimensional protein structure from its primary structure (residues sequence alone. However, predicting residue contact maps is a crucial and promising intermediate step towards final three-dimensional structure prediction. Better predictions of local and non-local contacts between residues can transform protein sequence alignment to structure alignment, which can finally improve template based three-dimensional protein structure predictors greatly. METHODS: CNNcon, an improved multiple neural networks based contact map predictor using six sub-networks and one final cascade-network, was developed in this paper. Both the sub-networks and the final cascade-network were trained and tested with their corresponding data sets. While for testing, the target protein was first coded and then input to its corresponding sub-networks for prediction. After that, the intermediate results were input to the cascade-network to finish the final prediction. RESULTS: The CNNcon can accurately predict 58.86% in average of contacts at a distance cutoff of 8 Å for proteins with lengths ranging from 51 to 450. The comparison results show that the present method performs better than the compared state-of-the-art predictors. Particularly, the prediction accuracy keeps steady with the increase of protein sequence length. It indicates that the CNNcon overcomes the thin density problem, with which other current predictors have trouble. This advantage makes the method valuable to the prediction of long length proteins. As a result, the effective

Large-scale brain network coupling predicts acute nicotine abstinence effects on craving and cognitive function.

Science.gov (United States)

Lerman, Caryn; Gu, Hong; Loughead, James; Ruparel, Kosha; Yang, Yihong; Stein, Elliot A

2014-05-01

Interactions of large-scale brain networks may underlie cognitive dysfunctions in psychiatric and addictive disorders. To test the hypothesis that the strength of coupling among 3 large-scale brain networks--salience, executive control, and default mode--will reflect the state of nicotine withdrawal (vs smoking satiety) and will predict abstinence-induced craving and cognitive deficits and to develop a resource allocation index (RAI) that reflects the combined strength of interactions among the 3 large-scale networks. A within-subject functional magnetic resonance imaging study in an academic medical center compared resting-state functional connectivity coherence strength after 24 hours of abstinence and after smoking satiety. We examined the relationship of abstinence-induced changes in the RAI with alterations in subjective, behavioral, and neural functions. We included 37 healthy smoking volunteers, aged 19 to 61 years, for analyses. Twenty-four hours of abstinence vs smoking satiety. Inter-network connectivity strength (primary) and the relationship with subjective, behavioral, and neural measures of nicotine withdrawal during abstinence vs smoking satiety states (secondary). The RAI was significantly lower in the abstinent compared with the smoking satiety states (left RAI, P = .002; right RAI, P = .04), suggesting weaker inhibition between the default mode and salience networks. Weaker inter-network connectivity (reduced RAI) predicted abstinence-induced cravings to smoke (r = -0.59; P = .007) and less suppression of default mode activity during performance of a subsequent working memory task (ventromedial prefrontal cortex, r = -0.66, P = .003; posterior cingulate cortex, r = -0.65, P = .001). Alterations in coupling of the salience and default mode networks and the inability to disengage from the default mode network may be critical in cognitive/affective alterations that underlie nicotine dependence.

Prediction based chaos control via a new neural network

International Nuclear Information System (INIS)

Shen Liqun; Wang Mao; Liu Wanyu; Sun Guanghui

2008-01-01

In this Letter, a new chaos control scheme based on chaos prediction is proposed. To perform chaos prediction, a new neural network architecture for complex nonlinear approximation is proposed. And the difficulty in building and training the neural network is also reduced. Simulation results of Logistic map and Lorenz system show the effectiveness of the proposed chaos control scheme and the proposed neural network

Design principles for cancer therapy guided by changes in complexity of protein-protein interaction networks.

Science.gov (United States)

Benzekry, Sebastian; Tuszynski, Jack A; Rietman, Edward A; Lakka Klement, Giannoula

2015-05-28

The ever-increasing expanse of online bioinformatics data is enabling new ways to, not only explore the visualization of these data, but also to apply novel mathematical methods to extract meaningful information for clinically relevant analysis of pathways and treatment decisions. One of the methods used for computing topological characteristics of a space at different spatial resolutions is persistent homology. This concept can also be applied to network theory, and more specifically to protein-protein interaction networks, where the number of rings in an individual cancer network represents a measure of complexity. We observed a linear correlation of R = -0.55 between persistent homology and 5-year survival of patients with a variety of cancers. This relationship was used to predict the proteins within a protein-protein interaction network with the most impact on cancer progression. By re-computing the persistent homology after computationally removing an individual node (protein) from the protein-protein interaction network, we were able to evaluate whether such an inhibition would lead to improvement in patient survival. The power of this approach lied in its ability to identify the effects of inhibition of multiple proteins and in the ability to expose whether the effect of a single inhibition may be amplified by inhibition of other proteins. More importantly, we illustrate specific examples of persistent homology calculations, which correctly predict the survival benefit observed effects in clinical trials using inhibitors of the identified molecular target. We propose that computational approaches such as persistent homology may be used in the future for selection of molecular therapies in clinic. The technique uses a mathematical algorithm to evaluate the node (protein) whose inhibition has the highest potential to reduce network complexity. The greater the drop in persistent homology, the greater reduction in network complexity, and thus a larger

Prediction of protein hydration sites from sequence by modular neural networks

DEFF Research Database (Denmark)

Ehrlich, L.; Reczko, M.; Bohr, Henrik

1998-01-01

The hydration properties of a protein are important determinants of its structure and function. Here, modular neural networks are employed to predict ordered hydration sites using protein sequence information. First, secondary structure and solvent accessibility are predicted from sequence with two...... separate neural networks. These predictions are used as input together with protein sequences for networks predicting hydration of residues, backbone atoms and sidechains. These networks are teined with protein crystal structures. The prediction of hydration is improved by adding information on secondary...... structure and solvent accessibility and, using actual values of these properties, redidue hydration can be predicted to 77% accuracy with a Metthews coefficient of 0.43. However, predicted property data with an accuracy of 60-70% result in less than half the improvement in predictive performance observed...

Large-scale prediction of drug–target interactions using protein sequences and drug topological structures

International Nuclear Information System (INIS)

Cao Dongsheng; Liu Shao; Xu Qingsong; Lu Hongmei; Huang Jianhua; Hu Qiannan; Liang Yizeng

2012-01-01

Highlights: ► Drug–target interactions are predicted using an extended SAR methodology. ► A drug–target interaction is regarded as an event triggered by many factors. ► Molecular fingerprint and CTD descriptors are used to represent drugs and proteins. ► Our approach shows compatibility between the new scheme and current SAR methodology. - Abstract: The identification of interactions between drugs and target proteins plays a key role in the process of genomic drug discovery. It is both consuming and costly to determine drug–target interactions by experiments alone. Therefore, there is an urgent need to develop new in silico prediction approaches capable of identifying these potential drug–target interactions in a timely manner. In this article, we aim at extending current structure–activity relationship (SAR) methodology to fulfill such requirements. In some sense, a drug–target interaction can be regarded as an event or property triggered by many influence factors from drugs and target proteins. Thus, each interaction pair can be represented theoretically by using these factors which are based on the structural and physicochemical properties simultaneously from drugs and proteins. To realize this, drug molecules are encoded with MACCS substructure fingerings representing existence of certain functional groups or fragments; and proteins are encoded with some biochemical and physicochemical properties. Four classes of drug–target interaction networks in humans involving enzymes, ion channels, G-protein-coupled receptors (GPCRs) and nuclear receptors, are independently used for establishing predictive models with support vector machines (SVMs). The SVM models gave prediction accuracy of 90.31%, 88.91%, 84.68% and 83.74% for four datasets, respectively. In conclusion, the results demonstrate the ability of our proposed method to predict the drug–target interactions, and show a general compatibility between the new scheme and current SAR

Large-scale prediction of drug-target interactions using protein sequences and drug topological structures

Energy Technology Data Exchange (ETDEWEB)

Cao Dongsheng [Research Center of Modernization of Traditional Chinese Medicines, Central South University, Changsha 410083 (China); Liu Shao [Xiangya Hospital, Central South University, Changsha 410008 (China); Xu Qingsong [School of Mathematical Sciences and Computing Technology, Central South University, Changsha 410083 (China); Lu Hongmei; Huang Jianhua [Research Center of Modernization of Traditional Chinese Medicines, Central South University, Changsha 410083 (China); Hu Qiannan [Key Laboratory of Combinatorial Biosynthesis and Drug Discovery (Wuhan University), Ministry of Education, and Wuhan University School of Pharmaceutical Sciences, Wuhan 430071 (China); Liang Yizeng, E-mail: yizeng_liang@263.net [Research Center of Modernization of Traditional Chinese Medicines, Central South University, Changsha 410083 (China)

2012-11-08

Highlights: Black-Right-Pointing-Pointer Drug-target interactions are predicted using an extended SAR methodology. Black-Right-Pointing-Pointer A drug-target interaction is regarded as an event triggered by many factors. Black-Right-Pointing-Pointer Molecular fingerprint and CTD descriptors are used to represent drugs and proteins. Black-Right-Pointing-Pointer Our approach shows compatibility between the new scheme and current SAR methodology. - Abstract: The identification of interactions between drugs and target proteins plays a key role in the process of genomic drug discovery. It is both consuming and costly to determine drug-target interactions by experiments alone. Therefore, there is an urgent need to develop new in silico prediction approaches capable of identifying these potential drug-target interactions in a timely manner. In this article, we aim at extending current structure-activity relationship (SAR) methodology to fulfill such requirements. In some sense, a drug-target interaction can be regarded as an event or property triggered by many influence factors from drugs and target proteins. Thus, each interaction pair can be represented theoretically by using these factors which are based on the structural and physicochemical properties simultaneously from drugs and proteins. To realize this, drug molecules are encoded with MACCS substructure fingerings representing existence of certain functional groups or fragments; and proteins are encoded with some biochemical and physicochemical properties. Four classes of drug-target interaction networks in humans involving enzymes, ion channels, G-protein-coupled receptors (GPCRs) and nuclear receptors, are independently used for establishing predictive models with support vector machines (SVMs). The SVM models gave prediction accuracy of 90.31%, 88.91%, 84.68% and 83.74% for four datasets, respectively. In conclusion, the results demonstrate the ability of our proposed method to predict the drug

Artificial neural network application for predicting soil distribution coefficient of nickel

International Nuclear Information System (INIS)

Falamaki, Amin

2013-01-01

The distribution (or partition) coefficient (K d ) is an applicable parameter for modeling contaminant and radionuclide transport as well as risk analysis. Selection of this parameter may cause significant error in predicting the impacts of contaminant migration or site-remediation options. In this regards, various models were presented to predict K d values for different contaminants specially heavy metals and radionuclides. In this study, artificial neural network (ANN) is used to present simplified model for predicting K d of nickel. The main objective is to develop a more accurate model with a minimal number of parameters, which can be determined experimentally or select by review of different studies. In addition, the effects of training as well as the type of the network are considered. The K d values of Ni is strongly dependent on pH of the soil and mathematical relationships were presented between pH and K d of nickel recently. In this study, the same database of these presented models was used to verify that neural network may be more useful tools for predicting of K d . Two different types of ANN, multilayer perceptron and redial basis function, were used to investigate the effect of the network geometry on the results. In addition, each network was trained by 80 and 90% of the data and tested for 20 and 10% of the rest data. Then the results of the networks compared with the results of the mathematical models. Although the networks trained by 80 and 90% of the data the results show that all the networks predict with higher accuracy relative to mathematical models which were derived by 100% of data. More training of a network increases the accuracy of the network. Multilayer perceptron network used in this study predicts better than redial basis function network. - Highlights: ► Simplified models for predicting K d of nickel presented using artificial neural networks. ► Multilayer perceptron and redial basis function used to predict K d of nickel in

Protein-protein interaction networks identify targets which rescue the MPP+ cellular model of Parkinson’s disease

Science.gov (United States)

Keane, Harriet; Ryan, Brent J.; Jackson, Brendan; Whitmore, Alan; Wade-Martins, Richard

2015-11-01

Neurodegenerative diseases are complex multifactorial disorders characterised by the interplay of many dysregulated physiological processes. As an exemplar, Parkinson’s disease (PD) involves multiple perturbed cellular functions, including mitochondrial dysfunction and autophagic dysregulation in preferentially-sensitive dopamine neurons, a selective pathophysiology recapitulated in vitro using the neurotoxin MPP+. Here we explore a network science approach for the selection of therapeutic protein targets in the cellular MPP+ model. We hypothesised that analysis of protein-protein interaction networks modelling MPP+ toxicity could identify proteins critical for mediating MPP+ toxicity. Analysis of protein-protein interaction networks constructed to model the interplay of mitochondrial dysfunction and autophagic dysregulation (key aspects of MPP+ toxicity) enabled us to identify four proteins predicted to be key for MPP+ toxicity (P62, GABARAP, GBRL1 and GBRL2). Combined, but not individual, knockdown of these proteins increased cellular susceptibility to MPP+ toxicity. Conversely, combined, but not individual, over-expression of the network targets provided rescue of MPP+ toxicity associated with the formation of autophagosome-like structures. We also found that modulation of two distinct proteins in the protein-protein interaction network was necessary and sufficient to mitigate neurotoxicity. Together, these findings validate our network science approach to multi-target identification in complex neurological diseases.

Building a glaucoma interaction network using a text mining approach.

Science.gov (United States)

Soliman, Maha; Nasraoui, Olfa; Cooper, Nigel G F

2016-01-01

The volume of biomedical literature and its underlying knowledge base is rapidly expanding, making it beyond the ability of a single human being to read through all the literature. Several automated methods have been developed to help make sense of this dilemma. The present study reports on the results of a text mining approach to extract gene interactions from the data warehouse of published experimental results which are then used to benchmark an interaction network associated with glaucoma. To the best of our knowledge, there is, as yet, no glaucoma interaction network derived solely from text mining approaches. The presence of such a network could provide a useful summative knowledge base to complement other forms of clinical information related to this disease. A glaucoma corpus was constructed from PubMed Central and a text mining approach was applied to extract genes and their relations from this corpus. The extracted relations between genes were checked using reference interaction databases and classified generally as known or new relations. The extracted genes and relations were then used to construct a glaucoma interaction network. Analysis of the resulting network indicated that it bears the characteristics of a small world interaction network. Our analysis showed the presence of seven glaucoma linked genes that defined the network modularity. A web-based system for browsing and visualizing the extracted glaucoma related interaction networks is made available at http://neurogene.spd.louisville.edu/GlaucomaINViewer/Form1.aspx. This study has reported the first version of a glaucoma interaction network using a text mining approach. The power of such an approach is in its ability to cover a wide range of glaucoma related studies published over many years. Hence, a bigger picture of the disease can be established. To the best of our knowledge, this is the first glaucoma interaction network to summarize the known literature. The major findings were a set of

Mutational robustness of gene regulatory networks.

Directory of Open Access Journals (Sweden)

Aalt D J van Dijk

Full Text Available Mutational robustness of gene regulatory networks refers to their ability to generate constant biological output upon mutations that change network structure. Such networks contain regulatory interactions (transcription factor-target gene interactions but often also protein-protein interactions between transcription factors. Using computational modeling, we study factors that influence robustness and we infer several network properties governing it. These include the type of mutation, i.e. whether a regulatory interaction or a protein-protein interaction is mutated, and in the case of mutation of a regulatory interaction, the sign of the interaction (activating vs. repressive. In addition, we analyze the effect of combinations of mutations and we compare networks containing monomeric with those containing dimeric transcription factors. Our results are consistent with available data on biological networks, for example based on evolutionary conservation of network features. As a novel and remarkable property, we predict that networks are more robust against mutations in monomer than in dimer transcription factors, a prediction for which analysis of conservation of DNA binding residues in monomeric vs. dimeric transcription factors provides indirect evidence.

Visualization of protein interaction networks: problems and solutions

Directory of Open Access Journals (Sweden)

Agapito Giuseppe

2013-01-01

Full Text Available Abstract Background Visualization concerns the representation of data visually and is an important task in scientific research. Protein-protein interactions (PPI are discovered using either wet lab techniques, such mass spectrometry, or in silico predictions tools, resulting in large collections of interactions stored in specialized databases. The set of all interactions of an organism forms a protein-protein interaction network (PIN and is an important tool for studying the behaviour of the cell machinery. Since graphic representation of PINs may highlight important substructures, e.g. protein complexes, visualization is more and more used to study the underlying graph structure of PINs. Although graphs are well known data structures, there are different open problems regarding PINs visualization: the high number of nodes and connections, the heterogeneity of nodes (proteins and edges (interactions, the possibility to annotate proteins and interactions with biological information extracted by ontologies (e.g. Gene Ontology that enriches the PINs with semantic information, but complicates their visualization. Methods In these last years many software tools for the visualization of PINs have been developed. Initially thought for visualization only, some of them have been successively enriched with new functions for PPI data management and PIN analysis. The paper analyzes the main software tools for PINs visualization considering four main criteria: (i technology, i.e. availability/license of the software and supported OS (Operating System platforms; (ii interoperability, i.e. ability to import/export networks in various formats, ability to export data in a graphic format, extensibility of the system, e.g. through plug-ins; (iii visualization, i.e. supported layout and rendering algorithms and availability of parallel implementation; (iv analysis, i.e. availability of network analysis functions, such as clustering or mining of the graph, and the

Deflection Prediction of No-Fines Lightweight Concrete Wall Using Neural Network Caused Dynamic Loads

Directory of Open Access Journals (Sweden)

Ridho Bayuaji

2018-04-01

Full Text Available No-fines lightweight concrete wall with horizontal reinforcement refers to an alternative material for wall construction with an aim of improving the wall quality towards horizontal loads. This study is focused on artificial neural network (ANN application to predicting the deflection deformation caused by dynamic loads. The ANN method is able to capture the complex interactions among input/output variables in a system without any knowledge of interaction nature and without any explicit assumption to model form. This paper explains the existing data research, data selection and process of ANN modelling training process and validation. The results of this research show that the deformation can be predicted more accurately, simply and quickly due to the alternating horizontal loads.

AIR POLLUITON INDEX PREDICTION USING MULTIPLE NEURAL NETWORKS

Directory of Open Access Journals (Sweden)

Zainal Ahmad

2017-05-01

Full Text Available Air quality monitoring and forecasting tools are necessary for the purpose of taking precautionary measures against air pollution, such as reducing the effect of a predicted air pollution peak on the surrounding population and ecosystem. In this study a single Feed-forward Artificial Neural Network (FANN is shown to be able to predict the Air Pollution Index (API with a Mean Squared Error (MSE and coefficient determination, R2, of 0.1856 and 0.7950 respectively. However, due to the non-robust nature of single FANN, a selective combination of Multiple Neural Networks (MNN is introduced using backward elimination and a forward selection method. The results show that both selective combination methods can improve the robustness and performance of the API prediction with the MSE and R2 of 0.1614 and 0.8210 respectively. This clearly shows that it is possible to reduce the number of networks combined in MNN for API prediction, without losses of any information in terms of the performance of the final API prediction model.

Default network modulation and large-scale network interactivity in healthy young and old adults.

Science.gov (United States)

Spreng, R Nathan; Schacter, Daniel L

2012-11-01

We investigated age-related changes in default, attention, and control network activity and their interactions in young and old adults. Brain activity during autobiographical and visuospatial planning was assessed using multivariate analysis and with intrinsic connectivity networks as regions of interest. In both groups, autobiographical planning engaged the default network while visuospatial planning engaged the attention network, consistent with a competition between the domains of internalized and externalized cognition. The control network was engaged for both planning tasks. In young subjects, the control network coupled with the default network during autobiographical planning and with the attention network during visuospatial planning. In old subjects, default-to-control network coupling was observed during both planning tasks, and old adults failed to deactivate the default network during visuospatial planning. This failure is not indicative of default network dysfunction per se, evidenced by default network engagement during autobiographical planning. Rather, a failure to modulate the default network in old adults is indicative of a lower degree of flexible network interactivity and reduced dynamic range of network modulation to changing task demands.

Deep-Learning-Based Drug-Target Interaction Prediction.

Science.gov (United States)

Wen, Ming; Zhang, Zhimin; Niu, Shaoyu; Sha, Haozhi; Yang, Ruihan; Yun, Yonghuan; Lu, Hongmei

2017-04-07

Identifying interactions between known drugs and targets is a major challenge in drug repositioning. In silico prediction of drug-target interaction (DTI) can speed up the expensive and time-consuming experimental work by providing the most potent DTIs. In silico prediction of DTI can also provide insights about the potential drug-drug interaction and promote the exploration of drug side effects. Traditionally, the performance of DTI prediction depends heavily on the descriptors used to represent the drugs and the target proteins. In this paper, to accurately predict new DTIs between approved drugs and targets without separating the targets into different classes, we developed a deep-learning-based algorithmic framework named DeepDTIs. It first abstracts representations from raw input descriptors using unsupervised pretraining and then applies known label pairs of interaction to build a classification model. Compared with other methods, it is found that DeepDTIs reaches or outperforms other state-of-the-art methods. The DeepDTIs can be further used to predict whether a new drug targets to some existing targets or whether a new target interacts with some existing drugs.

Prediction of disease-related genes based on weighted tissue-specific networks by using DNA methylation.

Science.gov (United States)

Li, Min; Zhang, Jiayi; Liu, Qing; Wang, Jianxin; Wu, Fang-Xiang

2014-01-01

Predicting disease-related genes is one of the most important tasks in bioinformatics and systems biology. With the advances in high-throughput techniques, a large number of protein-protein interactions are available, which make it possible to identify disease-related genes at the network level. However, network-based identification of disease-related genes is still a challenge as the considerable false-positives are still existed in the current available protein interaction networks (PIN). Considering the fact that the majority of genetic disorders tend to manifest only in a single or a few tissues, we constructed tissue-specific networks (TSN) by integrating PIN and tissue-specific data. We further weighed the constructed tissue-specific network (WTSN) by using DNA methylation as it plays an irreplaceable role in the development of complex diseases. A PageRank-based method was developed to identify disease-related genes from the constructed networks. To validate the effectiveness of the proposed method, we constructed PIN, weighted PIN (WPIN), TSN, WTSN for colon cancer and leukemia, respectively. The experimental results on colon cancer and leukemia show that the combination of tissue-specific data and DNA methylation can help to identify disease-related genes more accurately. Moreover, the PageRank-based method was effective to predict disease-related genes on the case studies of colon cancer and leukemia. Tissue-specific data and DNA methylation are two important factors to the study of human diseases. The same method implemented on the WTSN can achieve better results compared to those being implemented on original PIN, WPIN, or TSN. The PageRank-based method outperforms degree centrality-based method for identifying disease-related genes from WTSN.

Segregation of Brain Structural Networks Supports Spatio-Temporal Predictive Processing

Directory of Open Access Journals (Sweden)

Valentina Ciullo

2018-05-01

Full Text Available The ability to generate probabilistic expectancies regarding when and where sensory stimuli will occur, is critical to derive timely and accurate inferences about updating contexts. However, the existence of specialized neural networks for inferring predictive relationships between events is still debated. Using graph theoretical analysis applied to structural connectivity data, we tested the extent of brain connectivity properties associated with spatio-temporal predictive performance across 29 healthy subjects. Participants detected visual targets appearing at one out of three locations after one out of three intervals; expectations about stimulus location (spatial condition or onset (temporal condition were induced by valid or invalid symbolic cues. Connectivity matrices and centrality/segregation measures, expressing the relative importance of, and the local interactions among specific cerebral areas respect to the behavior under investigation, were calculated from whole-brain tractography and cortico-subcortical parcellation.Results: Response preparedness to cued stimuli relied on different structural connectivity networks for the temporal and spatial domains. Significant covariance was observed between centrality measures of regions within a subcortical-fronto-parietal-occipital network -comprising the left putamen, the right caudate nucleus, the left frontal operculum, the right inferior parietal cortex, the right paracentral lobule and the right superior occipital cortex-, and the ability to respond after a short cue-target delay suggesting that the local connectedness of such nodes plays a central role when the source of temporal expectation is explicit. When the potential for functional segregation was tested, we found highly clustered structural connectivity across the right superior, the left middle inferior frontal gyrus and the left caudate nucleus as related to explicit temporal orienting. Conversely, when the interaction between

Segregation of Brain Structural Networks Supports Spatio-Temporal Predictive Processing.

Science.gov (United States)

Ciullo, Valentina; Vecchio, Daniela; Gili, Tommaso; Spalletta, Gianfranco; Piras, Federica

2018-01-01

The ability to generate probabilistic expectancies regarding when and where sensory stimuli will occur, is critical to derive timely and accurate inferences about updating contexts. However, the existence of specialized neural networks for inferring predictive relationships between events is still debated. Using graph theoretical analysis applied to structural connectivity data, we tested the extent of brain connectivity properties associated with spatio-temporal predictive performance across 29 healthy subjects. Participants detected visual targets appearing at one out of three locations after one out of three intervals; expectations about stimulus location (spatial condition) or onset (temporal condition) were induced by valid or invalid symbolic cues. Connectivity matrices and centrality/segregation measures, expressing the relative importance of, and the local interactions among specific cerebral areas respect to the behavior under investigation, were calculated from whole-brain tractography and cortico-subcortical parcellation. Results: Response preparedness to cued stimuli relied on different structural connectivity networks for the temporal and spatial domains. Significant covariance was observed between centrality measures of regions within a subcortical-fronto-parietal-occipital network -comprising the left putamen, the right caudate nucleus, the left frontal operculum, the right inferior parietal cortex, the right paracentral lobule and the right superior occipital cortex-, and the ability to respond after a short cue-target delay suggesting that the local connectedness of such nodes plays a central role when the source of temporal expectation is explicit. When the potential for functional segregation was tested, we found highly clustered structural connectivity across the right superior, the left middle inferior frontal gyrus and the left caudate nucleus as related to explicit temporal orienting. Conversely, when the interaction between explicit and

Development of Novel Random Network Theory-Based Approaches to Identify Network Interactions among Nitrifying Bacteria

Energy Technology Data Exchange (ETDEWEB)

Shi, Cindy

2015-07-17

The interactions among different microbial populations in a community could play more important roles in determining ecosystem functioning than species numbers and their abundances, but very little is known about such network interactions at a community level. The goal of this project is to develop novel framework approaches and associated software tools to characterize the network interactions in microbial communities based on high throughput, large scale high-throughput metagenomics data and apply these approaches to understand the impacts of environmental changes (e.g., climate change, contamination) on network interactions among different nitrifying populations and associated microbial communities.

Speech networks at rest and in action: interactions between functional brain networks controlling speech production

Science.gov (United States)

Fuertinger, Stefan

2015-01-01

Speech production is one of the most complex human behaviors. Although brain activation during speaking has been well investigated, our understanding of interactions between the brain regions and neural networks remains scarce. We combined seed-based interregional correlation analysis with graph theoretical analysis of functional MRI data during the resting state and sentence production in healthy subjects to investigate the interface and topology of functional networks originating from the key brain regions controlling speech, i.e., the laryngeal/orofacial motor cortex, inferior frontal and superior temporal gyri, supplementary motor area, cingulate cortex, putamen, and thalamus. During both resting and speaking, the interactions between these networks were bilaterally distributed and centered on the sensorimotor brain regions. However, speech production preferentially recruited the inferior parietal lobule (IPL) and cerebellum into the large-scale network, suggesting the importance of these regions in facilitation of the transition from the resting state to speaking. Furthermore, the cerebellum (lobule VI) was the most prominent region showing functional influences on speech-network integration and segregation. Although networks were bilaterally distributed, interregional connectivity during speaking was stronger in the left vs. right hemisphere, which may have underlined a more homogeneous overlap between the examined networks in the left hemisphere. Among these, the laryngeal motor cortex (LMC) established a core network that fully overlapped with all other speech-related networks, determining the extent of network interactions. Our data demonstrate complex interactions of large-scale brain networks controlling speech production and point to the critical role of the LMC, IPL, and cerebellum in the formation of speech production network. PMID:25673742

File access prediction using neural networks.

Science.gov (United States)

Patra, Prashanta Kumar; Sahu, Muktikanta; Mohapatra, Subasish; Samantray, Ronak Kumar

2010-06-01

One of the most vexing issues in design of a high-speed computer is the wide gap of access times between the memory and the disk. To solve this problem, static file access predictors have been used. In this paper, we propose dynamic file access predictors using neural networks to significantly improve upon the accuracy, success-per-reference, and effective-success-rate-per-reference by using neural-network-based file access predictor with proper tuning. In particular, we verified that the incorrect prediction has been reduced from 53.11% to 43.63% for the proposed neural network prediction method with a standard configuration than the recent popularity (RP) method. With manual tuning for each trace, we are able to improve upon the misprediction rate and effective-success-rate-per-reference using a standard configuration. Simulations on distributed file system (DFS) traces reveal that exact fit radial basis function (RBF) gives better prediction in high end system whereas multilayer perceptron (MLP) trained with Levenberg-Marquardt (LM) backpropagation outperforms in system having good computational capability. Probabilistic and competitive predictors are the most suitable for work stations having limited resources to deal with and the former predictor is more efficient than the latter for servers having maximum system calls. Finally, we conclude that MLP with LM backpropagation algorithm has better success rate of file prediction than those of simple perceptron, last successor, stable successor, and best k out of m predictors.

Deciphering microbial interactions and detecting keystone species with co-occurrence networks

Directory of Open Access Journals (Sweden)

David eBerry

2014-05-01

Full Text Available Co-occurrence networks produced from microbial survey sequencing data are frequently used to identify interactions between community members. While this approach has potential to reveal ecological processes, it has been insufficiently validated due to the technical limitations inherent in studying complex microbial ecosystems. Here, we simulate multi-species microbial communities with known interaction patterns using generalized Lotka-Volterra dynamics, construct co-occurrence networks, and evaluate how well networks reveal the underlying interactions, and how experimental and ecological parameters can affect network inference and interpretation. We find that co-occurrence networks can recapitulate interaction networks under certain conditions, but that they lose interpretability when the effects of habitat filtering become significant. We demonstrate that networks suffer from local hot spots of spurious correlation in the neighborhood of hub species that engage in many interactions. We also identify topological features associated with keystone species in co-occurrence networks. This study provides a substantiated framework to guide environmental microbiologists in the construction and interpretation of co-occurrence networks from microbial survey datasets.

Deciphering microbial interactions and detecting keystone species with co-occurrence networks.

Science.gov (United States)

Berry, David; Widder, Stefanie

2014-01-01

Co-occurrence networks produced from microbial survey sequencing data are frequently used to identify interactions between community members. While this approach has potential to reveal ecological processes, it has been insufficiently validated due to the technical limitations inherent in studying complex microbial ecosystems. Here, we simulate multi-species microbial communities with known interaction patterns using generalized Lotka-Volterra dynamics. We then construct co-occurrence networks and evaluate how well networks reveal the underlying interactions and how experimental and ecological parameters can affect network inference and interpretation. We find that co-occurrence networks can recapitulate interaction networks under certain conditions, but that they lose interpretability when the effects of habitat filtering become significant. We demonstrate that networks suffer from local hot spots of spurious correlation in the neighborhood of hub species that engage in many interactions. We also identify topological features associated with keystone species in co-occurrence networks. This study provides a substantiated framework to guide environmental microbiologists in the construction and interpretation of co-occurrence networks from microbial survey datasets.

Composite Social Network for Predicting Mobile Apps Installation

Science.gov (United States)

2011-06-02

Social network tools (such as the Facebook app and the Twitter app) can observe users’ online friendship network . In this work, our key idea is...the friendship network from phones by collecting data from social networking apps such as the Facebook and Twitter apps. We summarize all the networks ...ar X iv :1 10 6. 03 59 v1 [ cs .S I] 2 J un 2 01 1 Composite Social Network for Predicting Mobile Apps Installation Wei Pan

Efficient and accurate Greedy Search Methods for mining functional modules in protein interaction networks.

Science.gov (United States)

He, Jieyue; Li, Chaojun; Ye, Baoliu; Zhong, Wei

2012-06-25

Most computational algorithms mainly focus on detecting highly connected subgraphs in PPI networks as protein complexes but ignore their inherent organization. Furthermore, many of these algorithms are computationally expensive. However, recent analysis indicates that experimentally detected protein complexes generally contain Core/attachment structures. In this paper, a Greedy Search Method based on Core-Attachment structure (GSM-CA) is proposed. The GSM-CA method detects densely connected regions in large protein-protein interaction networks based on the edge weight and two criteria for determining core nodes and attachment nodes. The GSM-CA method improves the prediction accuracy compared to other similar module detection approaches, however it is computationally expensive. Many module detection approaches are based on the traditional hierarchical methods, which is also computationally inefficient because the hierarchical tree structure produced by these approaches cannot provide adequate information to identify whether a network belongs to a module structure or not. In order to speed up the computational process, the Greedy Search Method based on Fast Clustering (GSM-FC) is proposed in this work. The edge weight based GSM-FC method uses a greedy procedure to traverse all edges just once to separate the network into the suitable set of modules. The proposed methods are applied to the protein interaction network of S. cerevisiae. Experimental results indicate that many significant functional modules are detected, most of which match the known complexes. Results also demonstrate that the GSM-FC algorithm is faster and more accurate as compared to other competing algorithms. Based on the new edge weight definition, the proposed algorithm takes advantages of the greedy search procedure to separate the network into the suitable set of modules. Experimental analysis shows that the identified modules are statistically significant. The algorithm can reduce the

End of Interactive Emailing from the Technical Network

CERN Multimedia

2006-01-01

According to the CNIC Security Policy for Control Systems (EDMS #584092), interactive emailing on PCs (and other devices) connected to the Technical Network is prohibited. Please note that from November 6th, neither reading emails nor sending emails interactively using e.g. Outlook or Pine mail clients on PCs connected to the Technical Network will be possible anymore. However, automatically generated emails will not be blocked and can still be sent off using CERNMX.CERN.CH as mail server. These restrictions DO NOT apply to PCs connected to any other network, like the General Purpose (or office) network. If you have questions, please do not hesitate to contact Uwe Epting, Pierre Charrue or Stefan Lueders (Technical-Network.Administrator@cern.ch). Your CNIC Working Group

Cluster Approach to Network Interaction in Pedagogical University

Science.gov (United States)

Chekaleva, Nadezhda V.; Makarova, Natalia S.; Drobotenko, Yulia B.

2016-01-01

The study presented in the article is devoted to the analysis of theory and practice of network interaction within the framework of education clusters. Education clusters are considered to be a novel form of network interaction in pedagogical education in Russia. The aim of the article is to show the advantages and disadvantages of the cluster…

HitPredict version 4: comprehensive reliability scoring of physical protein-protein interactions from more than 100 species.

Science.gov (United States)

López, Yosvany; Nakai, Kenta; Patil, Ashwini

2015-01-01

HitPredict is a consolidated resource of experimentally identified, physical protein-protein interactions with confidence scores to indicate their reliability. The study of genes and their inter-relationships using methods such as network and pathway analysis requires high quality protein-protein interaction information. Extracting reliable interactions from most of the existing databases is challenging because they either contain only a subset of the available interactions, or a mixture of physical, genetic and predicted interactions. Automated integration of interactions is further complicated by varying levels of accuracy of database content and lack of adherence to standard formats. To address these issues, the latest version of HitPredict provides a manually curated dataset of 398 696 physical associations between 70 808 proteins from 105 species. Manual confirmation was used to resolve all issues encountered during data integration. For improved reliability assessment, this version combines a new score derived from the experimental information of the interactions with the original score based on the features of the interacting proteins. The combined interaction score performs better than either of the individual scores in HitPredict as well as the reliability score of another similar database. HitPredict provides a web interface to search proteins and visualize their interactions, and the data can be downloaded for offline analysis. Data usability has been enhanced by mapping protein identifiers across multiple reference databases. Thus, the latest version of HitPredict provides a significantly larger, more reliable and usable dataset of protein-protein interactions from several species for the study of gene groups. Database URL: http://hintdb.hgc.jp/htp. © The Author(s) 2015. Published by Oxford University Press.

Network traffic intelligence using a low interaction honeypot

Science.gov (United States)

Nyamugudza, Tendai; Rajasekar, Venkatesh; Sen, Prasad; Nirmala, M.; Madhu Viswanatham, V.

2017-11-01

Advancements in networking technology have seen more and more devices becoming connected day by day. This has given organizations capacity to extend their networks beyond their boundaries to remote offices and remote employees. However as the network grows security becomes a major challenge since the attack surface also increases. There is need to guard the network against different types of attacks like intrusion and malware through using different tools at different networking levels. This paper describes how network intelligence can be acquired through implementing a low-interaction honeypot which detects and track network intrusion. Honeypot allows an organization to interact and gather information about an attack earlier before it compromises the network. This process is important because it allows the organization to learn about future attacks of the same nature and allows them to develop counter measures. The paper further shows how honeypot-honey net based model for interruption detection system (IDS) can be used to get the best valuable information about the attacker and prevent unexpected harm to the network.

Prediction of Electricity Usage Using Convolutional Neural Networks

OpenAIRE

Hansen, Martin

2017-01-01

Master's thesis Information- and communication technology IKT590 - University of Agder 2017 Convolutional Neural Networks are overwhelmingly accurate when attempting to predict numbers using the famous MNIST-dataset. In this paper, we are attempting to transcend these results for time- series forecasting, and compare them with several regression mod- els. The Convolutional Neural Network model predicted the same value through the entire time lapse in contrast with the other ...

Time series prediction with simple recurrent neural networks ...

African Journals Online (AJOL)

A hybrid of the two called Elman-Jordan (or Multi-recurrent) neural network is also being used. In this study, we evaluated the performance of these neural networks on three established bench mark time series prediction problems. Results from the experiments showed that Jordan neural network performed significantly ...

A scored human protein-protein interaction network to catalyze genomic interpretation

DEFF Research Database (Denmark)

Li, Taibo; Wernersson, Rasmus; Hansen, Rasmus B

2017-01-01

Genome-scale human protein-protein interaction networks are critical to understanding cell biology and interpreting genomic data, but challenging to produce experimentally. Through data integration and quality control, we provide a scored human protein-protein interaction network (InWeb_InBioMap,......Genome-scale human protein-protein interaction networks are critical to understanding cell biology and interpreting genomic data, but challenging to produce experimentally. Through data integration and quality control, we provide a scored human protein-protein interaction network (In...

A strategy for interaction site prediction between phospho-binding modules and their partners identified from proteomic data.

Science.gov (United States)

Aucher, Willy; Becker, Emmanuelle; Ma, Emilie; Miron, Simona; Martel, Arnaud; Ochsenbein, Françoise; Marsolier-Kergoat, Marie-Claude; Guerois, Raphaël

2010-12-01

Small and large scale proteomic technologies are providing a wealth of potential interactions between proteins bearing phospho-recognition modules and their substrates. Resulting interaction maps reveal such a dense network of interactions that the functional dissection and understanding of these networks often require to break specific interactions while keeping the rest intact. Here, we developed a computational strategy, called STRIP, to predict the precise interaction site involved in an interaction with a phospho-recognition module. The method was validated by a two-hybrid screen carried out using the ForkHead Associated (FHA)1 domain of Rad53, a key protein of Saccharomyces cerevisiae DNA checkpoint, as a bait. In this screen we detected 11 partners, including Cdc7 and Cdc45, essential components of the DNA replication machinery. FHA domains are phospho-threonine binding modules and the threonines involved in both interactions could be predicted using the STRIP strategy. The threonines T484 and T189 in Cdc7 and Cdc45, respectively, were mutated and loss of binding could be monitored experimentally with the full-length proteins. The method was further tested for the analysis of 63 known Rad53 binding partners and provided several key insights regarding the threonines likely involved in these interactions. The STRIP method relies on a combination of conservation, phosphorylation likelihood, and binding specificity criteria and can be accessed via a web interface at http://biodev.extra.cea.fr/strip/.

A Strategy for Interaction Site Prediction between Phospho-binding Modules and their Partners Identified from Proteomic Data*

Science.gov (United States)

Aucher, Willy; Becker, Emmanuelle; Ma, Emilie; Miron, Simona; Martel, Arnaud; Ochsenbein, Françoise; Marsolier-Kergoat, Marie-Claude; Guerois, Raphaël

2010-01-01

Small and large scale proteomic technologies are providing a wealth of potential interactions between proteins bearing phospho-recognition modules and their substrates. Resulting interaction maps reveal such a dense network of interactions that the functional dissection and understanding of these networks often require to break specific interactions while keeping the rest intact. Here, we developed a computational strategy, called STRIP, to predict the precise interaction site involved in an interaction with a phospho-recognition module. The method was validated by a two-hybrid screen carried out using the ForkHead Associated (FHA)1 domain of Rad53, a key protein of Saccharomyces cerevisiae DNA checkpoint, as a bait. In this screen we detected 11 partners, including Cdc7 and Cdc45, essential components of the DNA replication machinery. FHA domains are phospho-threonine binding modules and the threonines involved in both interactions could be predicted using the STRIP strategy. The threonines T484 and T189 in Cdc7 and Cdc45, respectively, were mutated and loss of binding could be monitored experimentally with the full-length proteins. The method was further tested for the analysis of 63 known Rad53 binding partners and provided several key insights regarding the threonines likely involved in these interactions. The STRIP method relies on a combination of conservation, phosphorylation likelihood, and binding specificity criteria and can be accessed via a web interface at http://biodev.extra.cea.fr/strip/. PMID:20733106

Capturing non-local interactions by long short-term memory bidirectional recurrent neural networks for improving prediction of protein secondary structure, backbone angles, contact numbers and solvent accessibility.

Science.gov (United States)

Heffernan, Rhys; Yang, Yuedong; Paliwal, Kuldip; Zhou, Yaoqi

2017-09-15

The accuracy of predicting protein local and global structural properties such as secondary structure and solvent accessible surface area has been stagnant for many years because of the challenge of accounting for non-local interactions between amino acid residues that are close in three-dimensional structural space but far from each other in their sequence positions. All existing machine-learning techniques relied on a sliding window of 10-20 amino acid residues to capture some 'short to intermediate' non-local interactions. Here, we employed Long Short-Term Memory (LSTM) Bidirectional Recurrent Neural Networks (BRNNs) which are capable of capturing long range interactions without using a window. We showed that the application of LSTM-BRNN to the prediction of protein structural properties makes the most significant improvement for residues with the most long-range contacts (|i-j| >19) over a previous window-based, deep-learning method SPIDER2. Capturing long-range interactions allows the accuracy of three-state secondary structure prediction to reach 84% and the correlation coefficient between predicted and actual solvent accessible surface areas to reach 0.80, plus a reduction of 5%, 10%, 5% and 10% in the mean absolute error for backbone ϕ , ψ , θ and τ angles, respectively, from SPIDER2. More significantly, 27% of 182724 40-residue models directly constructed from predicted C α atom-based θ and τ have similar structures to their corresponding native structures (6Å RMSD or less), which is 3% better than models built by ϕ and ψ angles. We expect the method to be useful for assisting protein structure and function prediction. The method is available as a SPIDER3 server and standalone package at http://sparks-lab.org . yaoqi.zhou@griffith.edu.au or yuedong.yang@griffith.edu.au. Supplementary data are available at Bioinformatics online. © The Author (2017). Published by Oxford University Press. All rights reserved. For Permissions, please email

Based on BP Neural Network Stock Prediction

Science.gov (United States)

Liu, Xiangwei; Ma, Xin

2012-01-01

The stock market has a high profit and high risk features, on the stock market analysis and prediction research has been paid attention to by people. Stock price trend is a complex nonlinear function, so the price has certain predictability. This article mainly with improved BP neural network (BPNN) to set up the stock market prediction model, and…

Online networks, social interaction and segregation: An evolutionary approach

OpenAIRE

Antoci, Angelo; Sabatini, Fabio

2018-01-01

There is growing evidence that face-to-face interaction is declining in many countries, exacerbating the phenomenon of social isolation. On the other hand, social interaction through online networking sites is steeply rising. To analyze these societal dynamics, we have built an evolutionary game model in which agents can choose between three strategies of social participation: 1) interaction via both online social networks and face-to-face encounters; 2) interaction by exclusive means of face...

Influences of brain development and ageing on cortical interactive networks.

Science.gov (United States)

Zhu, Chengyu; Guo, Xiaoli; Jin, Zheng; Sun, Junfeng; Qiu, Yihong; Zhu, Yisheng; Tong, Shanbao

2011-02-01

To study the effect of brain development and ageing on the pattern of cortical interactive networks. By causality analysis of multichannel electroencephalograph (EEG) with partial directed coherence (PDC), we investigated the different neural networks involved in the whole cortex as well as the anterior and posterior areas in three age groups, i.e., children (0-10 years), mid-aged adults (26-38 years) and the elderly (56-80 years). By comparing the cortical interactive networks in different age groups, the following findings were concluded: (1) the cortical interactive network in the right hemisphere develops earlier than its left counterpart in the development stage; (2) the cortical interactive network of anterior cortex, especially at C3 and F3, is demonstrated to undergo far more extensive changes, compared with the posterior area during brain development and ageing; (3) the asymmetry of the cortical interactive networks declines during ageing with more loss of connectivity in the left frontal and central areas. The age-related variation of cortical interactive networks from resting EEG provides new insights into brain development and ageing. Our findings demonstrated that the PDC analysis of EEG is a powerful approach for characterizing the cortical functional connectivity during brain development and ageing. Copyright © 2010 International Federation of Clinical Neurophysiology. Published by Elsevier Ireland Ltd. All rights reserved.

The role of asymmetric interactions on the effect of habitat destruction in mutualistic networks.

Directory of Open Access Journals (Sweden)

Guillermo Abramson

Full Text Available Plant-pollinator mutualistic networks are asymmetric in their interactions: specialist plants are pollinated by generalist animals, while generalist plants are pollinated by a broad range involving specialists and generalists. It has been suggested that this asymmetric--or disassortative--assemblage could play an important role in determining the observed equal susceptibility of specialist and generalist plants under habitat destruction. At the core of the analysis of the phenomenon lies the observation that specialist plants, otherwise candidates to extinction, could cope with the disruption thanks to their interaction with a few generalist pollinators. We present a theoretical framework that supports this thesis. We analyze a dynamical model of a system of mutualistic plants and pollinators, subject to the destruction of their habitat. We analyze and compare two families of interaction topologies, ranging from highly assortative to highly disassortative ones, as well as real pollination networks. We found that several features observed in natural systems are predicted by the mathematical model. First, there is a tendency to increase the asymmetry of the network as a result of the extinctions. Second, an entropy measure of the differential susceptibility to extinction of specialist and generalist species show that they tend to balance when the network is disassortative. Finally, the disappearance of links in the network, as a result of extinctions, shows that specialist plants preserve more connections than the corresponding plants in an assortative system, enabling them to resist the disruption.

Artificial neural network inference (ANNI: a study on gene-gene interaction for biomarkers in childhood sarcomas.

Directory of Open Access Journals (Sweden)

Dong Ling Tong

Full Text Available OBJECTIVE: To model the potential interaction between previously identified biomarkers in children sarcomas using artificial neural network inference (ANNI. METHOD: To concisely demonstrate the biological interactions between correlated genes in an interaction network map, only 2 types of sarcomas in the children small round blue cell tumors (SRBCTs dataset are discussed in this paper. A backpropagation neural network was used to model the potential interaction between genes. The prediction weights and signal directions were used to model the strengths of the interaction signals and the direction of the interaction link between genes. The ANN model was validated using Monte Carlo cross-validation to minimize the risk of over-fitting and to optimize generalization ability of the model. RESULTS: Strong connection links on certain genes (TNNT1 and FNDC5 in rhabdomyosarcoma (RMS; FCGRT and OLFM1 in Ewing's sarcoma (EWS suggested their potency as central hubs in the interconnection of genes with different functionalities. The results showed that the RMS patients in this dataset are likely to be congenital and at low risk of cardiomyopathy development. The EWS patients are likely to be complicated by EWS-FLI fusion and deficiency in various signaling pathways, including Wnt, Fas/Rho and intracellular oxygen. CONCLUSIONS: The ANN network inference approach and the examination of identified genes in the published literature within the context of the disease highlights the substantial influence of certain genes in sarcomas.

Dynamics of Moment Neuronal Networks with Intra- and Inter-Interactions

Directory of Open Access Journals (Sweden)

Xuyan Xiang

2015-01-01

Full Text Available A framework of moment neuronal networks with intra- and inter-interactions is presented. It is to show how the spontaneous activity is propagated across the homogeneous and heterogeneous network. The input-output firing relationship and the stability are first explored for a homogeneous network. For heterogeneous network without the constraint of the correlation coefficients between neurons, a more sophisticated dynamics is then explored. With random interactions, the network gets easily synchronized. However, desynchronization is produced by a lateral interaction such as Mexico hat function. It is the external intralayer input unit that offers a more sophisticated and unexpected dynamics over the predecessors. Hence, the work further opens up the possibility of carrying out a stochastic computation in neuronal networks.

A Predictive Approach to Network Reverse-Engineering

Science.gov (United States)

Wiggins, Chris

2005-03-01

A central challenge of systems biology is the ``reverse engineering" of transcriptional networks: inferring which genes exert regulatory control over which other genes. Attempting such inference at the genomic scale has only recently become feasible, via data-intensive biological innovations such as DNA microrrays (``DNA chips") and the sequencing of whole genomes. In this talk we present a predictive approach to network reverse-engineering, in which we integrate DNA chip data and sequence data to build a model of the transcriptional network of the yeast S. cerevisiae capable of predicting the response of genes in unseen experiments. The technique can also be used to extract ``motifs,'' sequence elements which act as binding sites for regulatory proteins. We validate by a number of approaches and present comparison of theoretical prediction vs. experimental data, along with biological interpretations of the resulting model. En route, we will illustrate some basic notions in statistical learning theory (fitting vs. over-fitting; cross- validation; assessing statistical significance), highlighting ways in which physicists can make a unique contribution in data- driven approaches to reverse engineering.

Speech networks at rest and in action: interactions between functional brain networks controlling speech production.

Science.gov (United States)

Simonyan, Kristina; Fuertinger, Stefan

2015-04-01

Speech production is one of the most complex human behaviors. Although brain activation during speaking has been well investigated, our understanding of interactions between the brain regions and neural networks remains scarce. We combined seed-based interregional correlation analysis with graph theoretical analysis of functional MRI data during the resting state and sentence production in healthy subjects to investigate the interface and topology of functional networks originating from the key brain regions controlling speech, i.e., the laryngeal/orofacial motor cortex, inferior frontal and superior temporal gyri, supplementary motor area, cingulate cortex, putamen, and thalamus. During both resting and speaking, the interactions between these networks were bilaterally distributed and centered on the sensorimotor brain regions. However, speech production preferentially recruited the inferior parietal lobule (IPL) and cerebellum into the large-scale network, suggesting the importance of these regions in facilitation of the transition from the resting state to speaking. Furthermore, the cerebellum (lobule VI) was the most prominent region showing functional influences on speech-network integration and segregation. Although networks were bilaterally distributed, interregional connectivity during speaking was stronger in the left vs. right hemisphere, which may have underlined a more homogeneous overlap between the examined networks in the left hemisphere. Among these, the laryngeal motor cortex (LMC) established a core network that fully overlapped with all other speech-related networks, determining the extent of network interactions. Our data demonstrate complex interactions of large-scale brain networks controlling speech production and point to the critical role of the LMC, IPL, and cerebellum in the formation of speech production network. Copyright © 2015 the American Physiological Society.

A novel multilayer model for missing link prediction and future link forecasting in dynamic complex networks

Science.gov (United States)

Yasami, Yasser; Safaei, Farshad

2018-02-01

The traditional complex network theory is particularly focused on network models in which all network constituents are dealt with equivalently, while fail to consider the supplementary information related to the dynamic properties of the network interactions. This is a main constraint leading to incorrect descriptions of some real-world phenomena or incomplete capturing the details of certain real-life problems. To cope with the problem, this paper addresses the multilayer aspects of dynamic complex networks by analyzing the properties of intrinsically multilayered co-authorship networks, DBLP and Astro Physics, and presenting a novel multilayer model of dynamic complex networks. The model examines the layers evolution (layers birth/death process and lifetime) throughout the network evolution. Particularly, this paper models the evolution of each node's membership in different layers by an Infinite Factorial Hidden Markov Model considering feature cascade, and thereby formulates the link generation process for intra-layer and inter-layer links. Although adjacency matrixes are useful to describe the traditional single-layer networks, such a representation is not sufficient to describe and analyze the multilayer dynamic networks. This paper also extends a generalized mathematical infrastructure to address the problems issued by multilayer complex networks. The model inference is performed using some Markov Chain Monte Carlo sampling strategies, given synthetic and real complex networks data. Experimental results indicate a tremendous improvement in the performance of the proposed multilayer model in terms of sensitivity, specificity, positive and negative predictive values, positive and negative likelihood ratios, F1-score, Matthews correlation coefficient, and accuracy for two important applications of missing link prediction and future link forecasting. The experimental results also indicate the strong predictivepower of the proposed model for the application of

DyNet: visualization and analysis of dynamic molecular interaction networks.

Science.gov (United States)

Goenawan, Ivan H; Bryan, Kenneth; Lynn, David J

2016-09-01

: The ability to experimentally determine molecular interactions on an almost proteome-wide scale under different conditions is enabling researchers to move from static to dynamic network analysis, uncovering new insights into how interaction networks are physically rewired in response to different stimuli and in disease. Dynamic interaction data presents a special challenge in network biology. Here, we present DyNet, a Cytoscape application that provides a range of functionalities for the visualization, real-time synchronization and analysis of large multi-state dynamic molecular interaction networks enabling users to quickly identify and analyze the most 'rewired' nodes across many network states. DyNet is available at the Cytoscape (3.2+) App Store (http://apps.cytoscape.org/apps/dynet). david.lynn@sahmri.com Supplementary data are available at Bioinformatics online. © The Author 2016. Published by Oxford University Press.

Mental health and social networks in early adolescence: a dynamic study of objectively-measured social interaction behaviors.

Science.gov (United States)

Pachucki, Mark C; Ozer, Emily J; Barrat, Alain; Cattuto, Ciro

2015-01-01

How are social interaction dynamics associated with mental health during early stages of adolescence? The goal of this study is to objectively measure social interactions and evaluate the roles that multiple aspects of the social environment--such as physical activity and food choice--may jointly play in shaping the structure of children's relationships and their mental health. The data in this study are drawn from a longitudinal network-behavior study conducted in 2012 at a private K-8 school in an urban setting in California. We recruited a highly complete network sample of sixth-graders (n = 40, 91% of grade, mean age = 12.3), and examined how two measures of distressed mental health (self-esteem and depressive symptoms) are positionally distributed in an early adolescent interaction network. We ascertained how distressed mental health shapes the structure of relationships over a three-month period, adjusting for relevant dimensions of the social environment. Cross-sectional analyses of interaction networks revealed that self-esteem and depressive symptoms are differentially stratified by gender. Specifically, girls with more depressive symptoms have interactions consistent with social inhibition, while boys' interactions suggest robustness to depressive symptoms. Girls higher in self-esteem tended towards greater sociability. Longitudinal network behavior models indicate that gender similarity and perceived popularity are influential in the formation of social ties. Greater school connectedness predicts the development of self-esteem, though social ties contribute to more self-esteem improvement among students who identify as European-American. Cross-sectional evidence shows associations between distressed mental health and students' network peers. However, there is no evidence that connected students' mental health status becomes more similar in their over time because of their network interactions. These findings suggest that mental health during early

Social network models predict movement and connectivity in ecological landscapes

Science.gov (United States)

Fletcher, Robert J.; Acevedo, M.A.; Reichert, Brian E.; Pias, Kyle E.; Kitchens, Wiley M.

2011-01-01

Network analysis is on the rise across scientific disciplines because of its ability to reveal complex, and often emergent, patterns and dynamics. Nonetheless, a growing concern in network analysis is the use of limited data for constructing networks. This concern is strikingly relevant to ecology and conservation biology, where network analysis is used to infer connectivity across landscapes. In this context, movement among patches is the crucial parameter for interpreting connectivity but because of the difficulty of collecting reliable movement data, most network analysis proceeds with only indirect information on movement across landscapes rather than using observed movement to construct networks. Statistical models developed for social networks provide promising alternatives for landscape network construction because they can leverage limited movement information to predict linkages. Using two mark-recapture datasets on individual movement and connectivity across landscapes, we test whether commonly used network constructions for interpreting connectivity can predict actual linkages and network structure, and we contrast these approaches to social network models. We find that currently applied network constructions for assessing connectivity consistently, and substantially, overpredict actual connectivity, resulting in considerable overestimation of metapopulation lifetime. Furthermore, social network models provide accurate predictions of network structure, and can do so with remarkably limited data on movement. Social network models offer a flexible and powerful way for not only understanding the factors influencing connectivity but also for providing more reliable estimates of connectivity and metapopulation persistence in the face of limited data.

Social network models predict movement and connectivity in ecological landscapes.

Science.gov (United States)

Fletcher, Robert J; Acevedo, Miguel A; Reichert, Brian E; Pias, Kyle E; Kitchens, Wiley M

2011-11-29

Network analysis is on the rise across scientific disciplines because of its ability to reveal complex, and often emergent, patterns and dynamics. Nonetheless, a growing concern in network analysis is the use of limited data for constructing networks. This concern is strikingly relevant to ecology and conservation biology, where network analysis is used to infer connectivity across landscapes. In this context, movement among patches is the crucial parameter for interpreting connectivity but because of the difficulty of collecting reliable movement data, most network analysis proceeds with only indirect information on movement across landscapes rather than using observed movement to construct networks. Statistical models developed for social networks provide promising alternatives for landscape network construction because they can leverage limited movement information to predict linkages. Using two mark-recapture datasets on individual movement and connectivity across landscapes, we test whether commonly used network constructions for interpreting connectivity can predict actual linkages and network structure, and we contrast these approaches to social network models. We find that currently applied network constructions for assessing connectivity consistently, and substantially, overpredict actual connectivity, resulting in considerable overestimation of metapopulation lifetime. Furthermore, social network models provide accurate predictions of network structure, and can do so with remarkably limited data on movement. Social network models offer a flexible and powerful way for not only understanding the factors influencing connectivity but also for providing more reliable estimates of connectivity and metapopulation persistence in the face of limited data.

Graph regularized nonnegative matrix factorization for temporal link prediction in dynamic networks

Science.gov (United States)

Ma, Xiaoke; Sun, Penggang; Wang, Yu

2018-04-01

Many networks derived from society and nature are temporal and incomplete. The temporal link prediction problem in networks is to predict links at time T + 1 based on a given temporal network from time 1 to T, which is essential to important applications. The current algorithms either predict the temporal links by collapsing the dynamic networks or collapsing features derived from each network, which are criticized for ignoring the connection among slices. to overcome the issue, we propose a novel graph regularized nonnegative matrix factorization algorithm (GrNMF) for the temporal link prediction problem without collapsing the dynamic networks. To obtain the feature for each network from 1 to t, GrNMF factorizes the matrix associated with networks by setting the rest networks as regularization, which provides a better way to characterize the topological information of temporal links. Then, the GrNMF algorithm collapses the feature matrices to predict temporal links. Compared with state-of-the-art methods, the proposed algorithm exhibits significantly improved accuracy by avoiding the collapse of temporal networks. Experimental results of a number of artificial and real temporal networks illustrate that the proposed method is not only more accurate but also more robust than state-of-the-art approaches.

Myths on Bi-direction Communication of Web 2.0 Based Social Networks: Is Social Network Truly Interactive?

Science.gov (United States)

2011-03-10

more and more social interactions are happening on the on-line. Especially recent uptake of the social network sites (SNSs), such as Facebook (http...Smart phones • Live updates within social networks • Facebook & Twitters Solution: WebMon for Risk Management Need for New WebMon for Social Networks ...Title: Myths on bi-direction communication of Web 2.0 based social networks : Is social network truly interactive

Stability prediction of berm breakwater using neural network

Digital Repository Service at National Institute of Oceanography (India)

Mandal, S.; Rao, S.; Manjunath, Y.R.

In the present study, an artificial neural network method has been applied to predict the stability of berm breakwaters. Four neural network models are constructed based on the parameters which influence the stability of breakwater. Training...

Upset Prediction in Friction Welding Using Radial Basis Function Neural Network

Directory of Open Access Journals (Sweden)

Wei Liu

2013-01-01

Full Text Available This paper addresses the upset prediction problem of friction welded joints. Based on finite element simulations of inertia friction welding (IFW, a radial basis function (RBF neural network was developed initially to predict the final upset for a number of welding parameters. The predicted joint upset by the RBF neural network was compared to validated finite element simulations, producing an error of less than 8.16% which is reasonable. Furthermore, the effects of initial rotational speed and axial pressure on the upset were investigated in relation to energy conversion with the RBF neural network. The developed RBF neural network was also applied to linear friction welding (LFW and continuous drive friction welding (CDFW. The correlation coefficients of RBF prediction for LFW and CDFW were 0.963 and 0.998, respectively, which further suggest that an RBF neural network is an effective method for upset prediction of friction welded joints.

A Neural Network Model for Prediction of Sound Quality

DEFF Research Database (Denmark)

Nielsen,, Lars Bramsløw

An artificial neural network structure has been specified, implemented and optimized for the purpose of predicting the perceived sound quality for normal-hearing and hearing-impaired subjects. The network was implemented by means of commercially available software and optimized to predict results...... obtained in subjective sound quality rating experiments based on input data from an auditory model. Various types of input data and data representations from the auditory model were used as input data for the chosen network structure, which was a three-layer perceptron. This network was trained by means...... the physical signal parameters and the subjectively perceived sound quality. No simple objective-subjective relationship was evident from this analysis....

Species interactions in an Andean bird–flowering plant network: phenology is more important than abundance or morphology

Directory of Open Access Journals (Sweden)

Oscar Gonzalez

2016-12-01

Full Text Available Biological constraints and neutral processes have been proposed to explain the properties of plant–pollinator networks. Using interactions between nectarivorous birds (hummingbirds and flowerpiercers and flowering plants in high elevation forests (i.e., “elfin” forests of the Andes, we explore the importance of biological constraints and neutral processes (random interactions to explain the observed species interactions and network metrics, such as connectance, specialization, nestedness and asymmetry. In cold environments of elfin forests, which are located at the top of the tropical montane forest zone, many plants are adapted for pollination by birds, making this an ideal system to study plant–pollinator networks. To build the network of interactions between birds and plants, we used direct field observations. We measured abundance of birds using mist-nets and flower abundance using transects, and phenology by scoring presence of birds and flowers over time. We compared the length of birds’ bills to flower length to identify “forbidden interactions”—those interactions that could not result in legitimate floral visits based on mis-match in morphology. Diglossa flowerpiercers, which are characterized as “illegitimate” flower visitors, were relatively abundant. We found that the elfin forest network was nested with phenology being the factor that best explained interaction frequencies and nestedness, providing support for biological constraints hypothesis. We did not find morphological constraints to be important in explaining observed interaction frequencies and network metrics. Other network metrics (connectance, evenness and asymmetry, however, were better predicted by abundance (neutral process models. Flowerpiercers, which cut holes and access flowers at their base and, consequently, facilitate nectar access for other hummingbirds, explain why morphological mis-matches were relatively unimportant in this system. Future

Comparative Genomics and Disorder Prediction Identify Biologically Relevant SH3 Protein Interactions.

Directory of Open Access Journals (Sweden)

2005-08-01

Full Text Available Protein interaction networks are an important part of the post-genomic effort to integrate a part-list view of the cell into system-level understanding. Using a set of 11 yeast genomes we show that combining comparative genomics and secondary structure information greatly increases consensus-based prediction of SH3 targets. Benchmarking of our method against positive and negative standards gave 83% accuracy with 26% coverage. The concept of an optimal divergence time for effective comparative genomics studies was analyzed, demonstrating that genomes of species that diverged very recently from Saccharomyces cerevisiae(S. mikatae, S. bayanus, and S. paradoxus, or a long time ago (Neurospora crassa and Schizosaccharomyces pombe, contain less information for accurate prediction of SH3 targets than species within the optimal divergence time proposed. We also show here that intrinsically disordered SH3 domain targets are more probable sites of interaction than equivalent sites within ordered regions. Our findings highlight several novel S. cerevisiae SH3 protein interactions, the value of selection of optimal divergence times in comparative genomics studies, and the importance of intrinsic disorder for protein interactions. Based on our results we propose novel roles for the S. cerevisiae proteins Abp1p in endocytosis and Hse1p in endosome protein sorting.

Comparative genomics and disorder prediction identify biologically relevant SH3 protein interactions.

Directory of Open Access Journals (Sweden)

Pedro Beltrao

2005-08-01

Full Text Available Protein interaction networks are an important part of the post-genomic effort to integrate a part-list view of the cell into system-level understanding. Using a set of 11 yeast genomes we show that combining comparative genomics and secondary structure information greatly increases consensus-based prediction of SH3 targets. Benchmarking of our method against positive and negative standards gave 83% accuracy with 26% coverage. The concept of an optimal divergence time for effective comparative genomics studies was analyzed, demonstrating that genomes of species that diverged very recently from Saccharomyces cerevisiae(S. mikatae, S. bayanus, and S. paradoxus, or a long time ago (Neurospora crassa and Schizosaccharomyces pombe, contain less information for accurate prediction of SH3 targets than species within the optimal divergence time proposed. We also show here that intrinsically disordered SH3 domain targets are more probable sites of interaction than equivalent sites within ordered regions. Our findings highlight several novel S. cerevisiae SH3 protein interactions, the value of selection of optimal divergence times in comparative genomics studies, and the importance of intrinsic disorder for protein interactions. Based on our results we propose novel roles for the S. cerevisiae proteins Abp1p in endocytosis and Hse1p in endosome protein sorting.

A neural network to predict symptomatic lung injury

International Nuclear Information System (INIS)

Munley, M.T.; Lo, J.Y.

1999-01-01

A nonlinear neural network that simultaneously uses pre-radiotherapy (RT) biological and physical data was developed to predict symptomatic lung injury. The input data were pre-RT pulmonary function, three-dimensional treatment plan doses and demographics. The output was a single value between 0 (asymptomatic) and 1 (symptomatic) to predict the likelihood that a particular patient would become symptomatic. The network was trained on data from 97 patients for 400 iterations with the goal to minimize the mean-squared error. Statistical analysis was performed on the resulting network to determine the model's accuracy. Results from the neural network were compared with those given by traditional linear discriminate analysis and the dose-volume histogram reduction (DVHR) scheme of Kutcher. Receiver-operator characteristic (ROC) analysis was performed on the resulting network which had Az=0.833±0.04. (Az is the area under the ROC curve.) Linear discriminate multivariate analysis yielded an Az=0.813±0.06. The DVHR method had Az=0.521±0.08. The network was also used to rank the significance of the input variables. Future studies will be conducted to improve network accuracy and to include functional imaging data. (author)

Temporal stability in human interaction networks

Science.gov (United States)

Fabbri, Renato; Fabbri, Ricardo; Antunes, Deborah Christina; Pisani, Marilia Mello; de Oliveira, Osvaldo Novais

2017-11-01

This paper reports on stable (or invariant) properties of human interaction networks, with benchmarks derived from public email lists. Activity, recognized through messages sent, along time and topology were observed in snapshots in a timeline, and at different scales. Our analysis shows that activity is practically the same for all networks across timescales ranging from seconds to months. The principal components of the participants in the topological metrics space remain practically unchanged as different sets of messages are considered. The activity of participants follows the expected scale-free trace, thus yielding the hub, intermediary and peripheral classes of vertices by comparison against the Erdös-Rényi model. The relative sizes of these three sectors are essentially the same for all email lists and the same along time. Typically, 45% are peripheral vertices. Similar results for the distribution of participants in the three sectors and for the relative importance of the topological metrics were obtained for 12 additional networks from Facebook, Twitter and ParticipaBR. These properties are consistent with the literature and may be general for human interaction networks, which has important implications for establishing a typology of participants based on quantitative criteria.

Neural networks for link prediction in realistic biomedical graphs: a multi-dimensional evaluation of graph embedding-based approaches.

Science.gov (United States)

Crichton, Gamal; Guo, Yufan; Pyysalo, Sampo; Korhonen, Anna

2018-05-21

Link prediction in biomedical graphs has several important applications including predicting Drug-Target Interactions (DTI), Protein-Protein Interaction (PPI) prediction and Literature-Based Discovery (LBD). It can be done using a classifier to output the probability of link formation between nodes. Recently several works have used neural networks to create node representations which allow rich inputs to neural classifiers. Preliminary works were done on this and report promising results. However they did not use realistic settings like time-slicing, evaluate performances with comprehensive metrics or explain when or why neural network methods outperform. We investigated how inputs from four node representation algorithms affect performance of a neural link predictor on random- and time-sliced biomedical graphs of real-world sizes (∼ 6 million edges) containing information relevant to DTI, PPI and LBD. We compared the performance of the neural link predictor to those of established baselines and report performance across five metrics. In random- and time-sliced experiments when the neural network methods were able to learn good node representations and there was a negligible amount of disconnected nodes, those approaches outperformed the baselines. In the smallest graph (∼ 15,000 edges) and in larger graphs with approximately 14% disconnected nodes, baselines such as Common Neighbours proved a justifiable choice for link prediction. At low recall levels (∼ 0.3) the approaches were mostly equal, but at higher recall levels across all nodes and average performance at individual nodes, neural network approaches were superior. Analysis showed that neural network methods performed well on links between nodes with no previous common neighbours; potentially the most interesting links. Additionally, while neural network methods benefit from large amounts of data, they require considerable amounts of computational resources to utilise them. Our results indicate

Integrated multimedia information system on interactive CATV network

Science.gov (United States)

Lee, Meng-Huang; Chang, Shin-Hung

1998-10-01

In the current CATV system architectures, they provide one- way delivery of a common menu of entertainment to all the homes through the cable network. Through the technologies evolution, the interactive services (or two-way services) can be provided in the cable TV systems. They can supply customers with individualized programming and support real- time two-way communications. With a view to the service type changed from the one-way delivery systems to the two-way interactive systems, `on demand services' is a distinct feature of multimedia systems. In this paper, we present our work of building up an integrated multimedia system on interactive CATV network in Shih Chien University. Besides providing the traditional analog TV programming from the cable operator, we filter some channels to reserve them as our campus information channels. In addition to the analog broadcasting channel, the system also provides the interactive digital multimedia services, e.g. Video-On- Demand (VOD), Virtual Reality, BBS, World-Wide-Web, and Internet Radio Station. These two kinds of services are integrated in a CATV network by the separation of frequency allocation for the analog broadcasting service and the digital interactive services. Our ongoing work is to port our previous work of building up a VOD system conformed to DAVIC standard (for inter-operability concern) on Ethernet network into the current system.

Prediction of metal corrosion using feed-forward neural networks

International Nuclear Information System (INIS)

Mahjani, M.G.; Jalili, S.; Jafarian, M.; Jaberi, A.

2004-01-01

The reliable prediction of corrosion behavior for the effective control of corrosion is a fundamental requirement. Since real world corrosion never seems to involve quite the same conditions that have previously been tested, using corrosion literature does not provide the necessary answers. In order to provide a methodology for predicting corrosion in real and complex situations, artificial neural networks can be utilized. Feed-forward artificial neural network (FFANN) is an information-processing paradigm inspired by the way the densely interconnected, parallel structure of the human brain process information.The aim of the present work is to predict corrosion behavior in critical conditions, such as industrial applications, based on some laboratory experimental data. Electrochemical behavior of stainless steel in different conditions were studied, using polarization technique and Tafel curves. Back-propagation neural networks models were developed to predict the corrosion behavior. The trained networks result in predicted value in good comparison to the experimental data. They have generally been claimed to be successful in modeling the corrosion behavior. The results are presented in two tables. Table 1 gives corrosion behavior of stainless-steel as a function of pH and CuSO 4 concentration and table 2 gives corrosion behavior of stainless - steel as a function of electrode surface area and CuSO 4 concentration. (authors)

Vulnerability of networks of interacting Markov chains.

Science.gov (United States)

Kocarev, L; Zlatanov, N; Trajanov, D

2010-05-13

The concept of vulnerability is introduced for a model of random, dynamical interactions on networks. In this model, known as the influence model, the nodes are arranged in an arbitrary network, while the evolution of the status at a node is according to an internal Markov chain, but with transition probabilities that depend not only on the current status of that node but also on the statuses of the neighbouring nodes. Vulnerability is treated analytically and numerically for several networks with different topological structures, as well as for two real networks--the network of infrastructures and the EU power grid--identifying the most vulnerable nodes of these networks.

Neural network for prediction of superheater fireside corrosion

Energy Technology Data Exchange (ETDEWEB)

Makkonen, P [Foster Wheeler Energia Oy, Karhula R and D Center, Karhula (Finland)

1999-12-31

Superheater corrosion causes vast annual losses to the power companies. If the corrosion could be reliably predicted, new power plants could be designed accordingly, and knowledge of fuel selection and determination of process conditions could be utilized to minimize superheater corrosion. If relations between inputs and the output are poorly known, conventional models depending on corrosion theories will fail. A prediction model based on a neural network is capable of learning from errors and improving its performance as the amount of data increases. The neural network developed during this study predicts superheater corrosion with 80 % accuracy at early stage of the project. (orig.) 10 refs.

Neural network for prediction of superheater fireside corrosion

Energy Technology Data Exchange (ETDEWEB)

Makkonen, P. [Foster Wheeler Energia Oy, Karhula R and D Center, Karhula (Finland)

1998-12-31

Superheater corrosion causes vast annual losses to the power companies. If the corrosion could be reliably predicted, new power plants could be designed accordingly, and knowledge of fuel selection and determination of process conditions could be utilized to minimize superheater corrosion. If relations between inputs and the output are poorly known, conventional models depending on corrosion theories will fail. A prediction model based on a neural network is capable of learning from errors and improving its performance as the amount of data increases. The neural network developed during this study predicts superheater corrosion with 80 % accuracy at early stage of the project. (orig.) 10 refs.

Interacting neural networks

Science.gov (United States)

Metzler, R.; Kinzel, W.; Kanter, I.

2000-08-01

Several scenarios of interacting neural networks which are trained either in an identical or in a competitive way are solved analytically. In the case of identical training each perceptron receives the output of its neighbor. The symmetry of the stationary state as well as the sensitivity to the used training algorithm are investigated. Two competitive perceptrons trained on mutually exclusive learning aims and a perceptron which is trained on the opposite of its own output are examined analytically. An ensemble of competitive perceptrons is used as decision-making algorithms in a model of a closed market (El Farol Bar problem or the Minority Game. In this game, a set of agents who have to make a binary decision is considered.); each network is trained on the history of minority decisions. This ensemble of perceptrons relaxes to a stationary state whose performance can be better than random.

A Deep Learning Network Approach to ab initio Protein Secondary Structure Prediction.

Science.gov (United States)

Spencer, Matt; Eickholt, Jesse; Jianlin Cheng

2015-01-01

Ab initio protein secondary structure (SS) predictions are utilized to generate tertiary structure predictions, which are increasingly demanded due to the rapid discovery of proteins. Although recent developments have slightly exceeded previous methods of SS prediction, accuracy has stagnated around 80 percent and many wonder if prediction cannot be advanced beyond this ceiling. Disciplines that have traditionally employed neural networks are experimenting with novel deep learning techniques in attempts to stimulate progress. Since neural networks have historically played an important role in SS prediction, we wanted to determine whether deep learning could contribute to the advancement of this field as well. We developed an SS predictor that makes use of the position-specific scoring matrix generated by PSI-BLAST and deep learning network architectures, which we call DNSS. Graphical processing units and CUDA software optimize the deep network architecture and efficiently train the deep networks. Optimal parameters for the training process were determined, and a workflow comprising three separately trained deep networks was constructed in order to make refined predictions. This deep learning network approach was used to predict SS for a fully independent test dataset of 198 proteins, achieving a Q3 accuracy of 80.7 percent and a Sov accuracy of 74.2 percent.

Drug-target interaction prediction via class imbalance-aware ensemble learning.

Science.gov (United States)

Ezzat, Ali; Wu, Min; Li, Xiao-Li; Kwoh, Chee-Keong

2016-12-22

Multiple computational methods for predicting drug-target interactions have been developed to facilitate the drug discovery process. These methods use available data on known drug-target interactions to train classifiers with the purpose of predicting new undiscovered interactions. However, a key challenge regarding this data that has not yet been addressed by these methods, namely class imbalance, is potentially degrading the prediction performance. Class imbalance can be divided into two sub-problems. Firstly, the number of known interacting drug-target pairs is much smaller than that of non-interacting drug-target pairs. This imbalance ratio between interacting and non-interacting drug-target pairs is referred to as the between-class imbalance. Between-class imbalance degrades prediction performance due to the bias in prediction results towards the majority class (i.e. the non-interacting pairs), leading to more prediction errors in the minority class (i.e. the interacting pairs). Secondly, there are multiple types of drug-target interactions in the data with some types having relatively fewer members (or are less represented) than others. This variation in representation of the different interaction types leads to another kind of imbalance referred to as the within-class imbalance. In within-class imbalance, prediction results are biased towards the better represented interaction types, leading to more prediction errors in the less represented interaction types. We propose an ensemble learning method that incorporates techniques to address the issues of between-class imbalance and within-class imbalance. Experiments show that the proposed method improves results over 4 state-of-the-art methods. In addition, we simulated cases for new drugs and targets to see how our method would perform in predicting their interactions. New drugs and targets are those for which no prior interactions are known. Our method displayed satisfactory prediction performance and was

Semantic integration to identify overlapping functional modules in protein interaction networks

Directory of Open Access Journals (Sweden)

Ramanathan Murali

2007-07-01

Full Text Available Abstract Background The systematic analysis of protein-protein interactions can enable a better understanding of cellular organization, processes and functions. Functional modules can be identified from the protein interaction networks derived from experimental data sets. However, these analyses are challenging because of the presence of unreliable interactions and the complex connectivity of the network. The integration of protein-protein interactions with the data from other sources can be leveraged for improving the effectiveness of functional module detection algorithms. Results We have developed novel metrics, called semantic similarity and semantic interactivity, which use Gene Ontology (GO annotations to measure the reliability of protein-protein interactions. The protein interaction networks can be converted into a weighted graph representation by assigning the reliability values to each interaction as a weight. We presented a flow-based modularization algorithm to efficiently identify overlapping modules in the weighted interaction networks. The experimental results show that the semantic similarity and semantic interactivity of interacting pairs were positively correlated with functional co-occurrence. The effectiveness of the algorithm for identifying modules was evaluated using functional categories from the MIPS database. We demonstrated that our algorithm had higher accuracy compared to other competing approaches. Conclusion The integration of protein interaction networks with GO annotation data and the capability of detecting overlapping modules substantially improve the accuracy of module identification.

Modeling, robust and distributed model predictive control for freeway networks

NARCIS (Netherlands)

Liu, S.

2016-01-01

In Model Predictive Control (MPC) for traffic networks, traffic models are crucial since they are used as prediction models for determining the optimal control actions. In order to reduce the computational complexity of MPC for traffic networks, macroscopic traffic models are often used instead of

Deep Predictive Models in Interactive Music

OpenAIRE

Martin, Charles P.; Ellefsen, Kai Olav; Torresen, Jim

2018-01-01

Automatic music generation is a compelling task where much recent progress has been made with deep learning models. In this paper, we ask how these models can be integrated into interactive music systems; how can they encourage or enhance the music making of human users? Musical performance requires prediction to operate instruments, and perform in groups. We argue that predictive models could help interactive systems to understand their temporal context, and ensemble behaviour. Deep learning...

Neural Network Predictive Control for Vanadium Redox Flow Battery

Directory of Open Access Journals (Sweden)

Hai-Feng Shen

2013-01-01

Full Text Available The vanadium redox flow battery (VRB is a nonlinear system with unknown dynamics and disturbances. The flowrate of the electrolyte is an important control mechanism in the operation of a VRB system. Too low or too high flowrate is unfavorable for the safety and performance of VRB. This paper presents a neural network predictive control scheme to enhance the overall performance of the battery. A radial basis function (RBF network is employed to approximate the dynamics of the VRB system. The genetic algorithm (GA is used to obtain the optimum initial values of the RBF network parameters. The gradient descent algorithm is used to optimize the objective function of the predictive controller. Compared with the constant flowrate, the simulation results show that the flowrate optimized by neural network predictive controller can increase the power delivered by the battery during the discharge and decrease the power consumed during the charge.

Predicting Protein Function via Semantic Integration of Multiple Networks.

Science.gov (United States)

Yu, Guoxian; Fu, Guangyuan; Wang, Jun; Zhu, Hailong

2016-01-01

Determining the biological functions of proteins is one of the key challenges in the post-genomic era. The rapidly accumulated large volumes of proteomic and genomic data drives to develop computational models for automatically predicting protein function in large scale. Recent approaches focus on integrating multiple heterogeneous data sources and they often get better results than methods that use single data source alone. In this paper, we investigate how to integrate multiple biological data sources with the biological knowledge, i.e., Gene Ontology (GO), for protein function prediction. We propose a method, called SimNet, to Semantically integrate multiple functional association Networks derived from heterogenous data sources. SimNet firstly utilizes GO annotations of proteins to capture the semantic similarity between proteins and introduces a semantic kernel based on the similarity. Next, SimNet constructs a composite network, obtained as a weighted summation of individual networks, and aligns the network with the kernel to get the weights assigned to individual networks. Then, it applies a network-based classifier on the composite network to predict protein function. Experiment results on heterogenous proteomic data sources of Yeast, Human, Mouse, and Fly show that, SimNet not only achieves better (or comparable) results than other related competitive approaches, but also takes much less time. The Matlab codes of SimNet are available at https://sites.google.com/site/guoxian85/simnet.

Research on Improved Depth Belief Network-Based Prediction of Cardiovascular Diseases

Directory of Open Access Journals (Sweden)

Peng Lu

2018-01-01

Full Text Available Quantitative analysis and prediction can help to reduce the risk of cardiovascular disease. Quantitative prediction based on traditional model has low accuracy. The variance of model prediction based on shallow neural network is larger. In this paper, cardiovascular disease prediction model based on improved deep belief network (DBN is proposed. Using the reconstruction error, the network depth is determined independently, and unsupervised training and supervised optimization are combined. It ensures the accuracy of model prediction while guaranteeing stability. Thirty experiments were performed independently on the Statlog (Heart and Heart Disease Database data sets in the UCI database. Experimental results showed that the mean of prediction accuracy was 91.26% and 89.78%, respectively. The variance of prediction accuracy was 5.78 and 4.46, respectively.

Interaction networks, ecological stability, and collective antibiotic tolerance in polymicrobial infections

Science.gov (United States)

de Vos, Marjon G. J.; Bollenbach, Tobias

2017-01-01

Polymicrobial infections constitute small ecosystems that accommodate several bacterial species. Commonly, these bacteria are investigated in isolation. However, it is unknown to what extent the isolates interact and whether their interactions alter bacterial growth and ecosystem resilience in the presence and absence of antibiotics. We quantified the complete ecological interaction network for 72 bacterial isolates collected from 23 individuals diagnosed with polymicrobial urinary tract infections and found that most interactions cluster based on evolutionary relatedness. Statistical network analysis revealed that competitive and cooperative reciprocal interactions are enriched in the global network, while cooperative interactions are depleted in the individual host community networks. A population dynamics model parameterized by our measurements suggests that interactions restrict community stability, explaining the observed species diversity of these communities. We further show that the clinical isolates frequently protect each other from clinically relevant antibiotics. Together, these results highlight that ecological interactions are crucial for the growth and survival of bacteria in polymicrobial infection communities and affect their assembly and resilience. PMID:28923953

Prediction of heterodimeric protein complexes from weighted protein-protein interaction networks using novel features and kernel functions.

Directory of Open Access Journals (Sweden)

Peiying Ruan

Full Text Available Since many proteins express their functional activity by interacting with other proteins and forming protein complexes, it is very useful to identify sets of proteins that form complexes. For that purpose, many prediction methods for protein complexes from protein-protein interactions have been developed such as MCL, MCODE, RNSC, PCP, RRW, and NWE. These methods have dealt with only complexes with size of more than three because the methods often are based on some density of subgraphs. However, heterodimeric protein complexes that consist of two distinct proteins occupy a large part according to several comprehensive databases of known complexes. In this paper, we propose several feature space mappings from protein-protein interaction data, in which each interaction is weighted based on reliability. Furthermore, we make use of prior knowledge on protein domains to develop feature space mappings, domain composition kernel and its combination kernel with our proposed features. We perform ten-fold cross-validation computational experiments. These results suggest that our proposed kernel considerably outperforms the naive Bayes-based method, which is the best existing method for predicting heterodimeric protein complexes.

Prediction of littoral drift with artificial neural networks

Digital Repository Service at National Institute of Oceanography (India)

Singh, A.K.; Deo, M.C.; SanilKumar, V.

of the rate of sand drift has still remained as a problem. The current study addresses this issue through the use of artificial neural networks (ANN). Feed forward networks were developed to predict the sand drift from a variety of causative variables...

Prediction of tides using back-propagation neural networks

Digital Repository Service at National Institute of Oceanography (India)

Mandal, S.

Prediction of tides is very much essential for human activities and to reduce the construction cost in marine environment. This paper presents an application of the artificial neural network with back-propagation procedures for accurate prediction...

Wind power prediction based on genetic neural network

Science.gov (United States)

Zhang, Suhan

2017-04-01

The scale of grid connected wind farms keeps increasing. To ensure the stability of power system operation, make a reasonable scheduling scheme and improve the competitiveness of wind farm in the electricity generation market, it's important to accurately forecast the short-term wind power. To reduce the influence of the nonlinear relationship between the disturbance factor and the wind power, the improved prediction model based on genetic algorithm and neural network method is established. To overcome the shortcomings of long training time of BP neural network and easy to fall into local minimum and improve the accuracy of the neural network, genetic algorithm is adopted to optimize the parameters and topology of neural network. The historical data is used as input to predict short-term wind power. The effectiveness and feasibility of the method is verified by the actual data of a certain wind farm as an example.

Functional modules by relating protein interaction networks and gene expression.

Science.gov (United States)

Tornow, Sabine; Mewes, H W

2003-11-01

Genes and proteins are organized on the basis of their particular mutual relations or according to their interactions in cellular and genetic networks. These include metabolic or signaling pathways and protein interaction, regulatory or co-expression networks. Integrating the information from the different types of networks may lead to the notion of a functional network and functional modules. To find these modules, we propose a new technique which is based on collective, multi-body correlations in a genetic network. We calculated the correlation strength of a group of genes (e.g. in the co-expression network) which were identified as members of a module in a different network (e.g. in the protein interaction network) and estimated the probability that this correlation strength was found by chance. Groups of genes with a significant correlation strength in different networks have a high probability that they perform the same function. Here, we propose evaluating the multi-body correlations by applying the superparamagnetic approach. We compare our method to the presently applied mean Pearson correlations and show that our method is more sensitive in revealing functional relationships.

Deep convolutional neural networks for pan-specific peptide-MHC class I binding prediction.

Science.gov (United States)

Han, Youngmahn; Kim, Dongsup

2017-12-28

Computational scanning of peptide candidates that bind to a specific major histocompatibility complex (MHC) can speed up the peptide-based vaccine development process and therefore various methods are being actively developed. Recently, machine-learning-based methods have generated successful results by training large amounts of experimental data. However, many machine learning-based methods are generally less sensitive in recognizing locally-clustered interactions, which can synergistically stabilize peptide binding. Deep convolutional neural network (DCNN) is a deep learning method inspired by visual recognition process of animal brain and it is known to be able to capture meaningful local patterns from 2D images. Once the peptide-MHC interactions can be encoded into image-like array(ILA) data, DCNN can be employed to build a predictive model for peptide-MHC binding prediction. In this study, we demonstrated that DCNN is able to not only reliably predict peptide-MHC binding, but also sensitively detect locally-clustered interactions. Nonapeptide-HLA-A and -B binding data were encoded into ILA data. A DCNN, as a pan-specific prediction model, was trained on the ILA data. The DCNN showed higher performance than other prediction tools for the latest benchmark datasets, which consist of 43 datasets for 15 HLA-A alleles and 25 datasets for 10 HLA-B alleles. In particular, the DCNN outperformed other tools for alleles belonging to the HLA-A3 supertype. The F1 scores of the DCNN were 0.86, 0.94, and 0.67 for HLA-A*31:01, HLA-A*03:01, and HLA-A*68:01 alleles, respectively, which were significantly higher than those of other tools. We found that the DCNN was able to recognize locally-clustered interactions that could synergistically stabilize peptide binding. We developed ConvMHC, a web server to provide user-friendly web interfaces for peptide-MHC class I binding predictions using the DCNN. ConvMHC web server can be accessible via http://jumong.kaist.ac.kr:8080/convmhc

Drug-Target Interactions: Prediction Methods and Applications.

Science.gov (United States)

Anusuya, Shanmugam; Kesherwani, Manish; Priya, K Vishnu; Vimala, Antonydhason; Shanmugam, Gnanendra; Velmurugan, Devadasan; Gromiha, M Michael

2018-01-01

Identifying the interactions between drugs and target proteins is a key step in drug discovery. This not only aids to understand the disease mechanism, but also helps to identify unexpected therapeutic activity or adverse side effects of drugs. Hence, drug-target interaction prediction becomes an essential tool in the field of drug repurposing. The availability of heterogeneous biological data on known drug-target interactions enabled many researchers to develop various computational methods to decipher unknown drug-target interactions. This review provides an overview on these computational methods for predicting drug-target interactions along with available webservers and databases for drug-target interactions. Further, the applicability of drug-target interactions in various diseases for identifying lead compounds has been outlined. Copyright© Bentham Science Publishers; For any queries, please email at epub@benthamscience.org.

Link Prediction in Evolving Networks Based on Popularity of Nodes.

Science.gov (United States)

Wang, Tong; He, Xing-Sheng; Zhou, Ming-Yang; Fu, Zhong-Qian

2017-08-02

Link prediction aims to uncover the underlying relationship behind networks, which could be utilized to predict missing edges or identify the spurious edges. The key issue of link prediction is to estimate the likelihood of potential links in networks. Most classical static-structure based methods ignore the temporal aspects of networks, limited by the time-varying features, such approaches perform poorly in evolving networks. In this paper, we propose a hypothesis that the ability of each node to attract links depends not only on its structural importance, but also on its current popularity (activeness), since active nodes have much more probability to attract future links. Then a novel approach named popularity based structural perturbation method (PBSPM) and its fast algorithm are proposed to characterize the likelihood of an edge from both existing connectivity structure and current popularity of its two endpoints. Experiments on six evolving networks show that the proposed methods outperform state-of-the-art methods in accuracy and robustness. Besides, visual results and statistical analysis reveal that the proposed methods are inclined to predict future edges between active nodes, rather than edges between inactive nodes.

NatalieQ: A web server for protein-protein interaction network querying

NARCIS (Netherlands)

El-Kebir, M.; Brandt, B.W.; Heringa, J.; Klau, G.W.

2014-01-01

Background Molecular interactions need to be taken into account to adequately model the complex behavior of biological systems. These interactions are captured by various types of biological networks, such as metabolic, gene-regulatory, signal transduction and protein-protein interaction networks.

Stringent DDI-based prediction of H. sapiens-M. tuberculosis H37Rv protein-protein interactions.

Science.gov (United States)

Zhou, Hufeng; Rezaei, Javad; Hugo, Willy; Gao, Shangzhi; Jin, Jingjing; Fan, Mengyuan; Yong, Chern-Han; Wozniak, Michal; Wong, Limsoon

2013-01-01

H. sapiens-M. tuberculosis H37Rv protein-protein interaction (PPI) data are very important information to illuminate the infection mechanism of M. tuberculosis H37Rv. But current H. sapiens-M. tuberculosis H37Rv PPI data are very scarce. This seriously limits the study of the interaction between this important pathogen and its host H. sapiens. Computational prediction of H. sapiens-M. tuberculosis H37Rv PPIs is an important strategy to fill in the gap. Domain-domain interaction (DDI) based prediction is one of the frequently used computational approaches in predicting both intra-species and inter-species PPIs. However, the performance of DDI-based host-pathogen PPI prediction has been rather limited. We develop a stringent DDI-based prediction approach with emphasis on (i) differences between the specific domain sequences on annotated regions of proteins under the same domain ID and (ii) calculation of the interaction strength of predicted PPIs based on the interacting residues in their interaction interfaces. We compare our stringent DDI-based approach to a conventional DDI-based approach for predicting PPIs based on gold standard intra-species PPIs and coherent informative Gene Ontology terms assessment. The assessment results show that our stringent DDI-based approach achieves much better performance in predicting PPIs than the conventional approach. Using our stringent DDI-based approach, we have predicted a small set of reliable H. sapiens-M. tuberculosis H37Rv PPIs which could be very useful for a variety of related studies. We also analyze the H. sapiens-M. tuberculosis H37Rv PPIs predicted by our stringent DDI-based approach using cellular compartment distribution analysis, functional category enrichment analysis and pathway enrichment analysis. The analyses support the validity of our prediction result. Also, based on an analysis of the H. sapiens-M. tuberculosis H37Rv PPI network predicted by our stringent DDI-based approach, we have discovered some

Application of neural networks to signal prediction in nuclear power plant