Large-Scale Camera Network Topology Estimation by Lighting Variation

Author(s):  
Michael Zhu ◽  
Anthony Dick ◽  
Anton van den Hengel
2020 ◽  
Vol 15 (7) ◽  
pp. 750-757
Author(s):  
Jihong Wang ◽  
Yue Shi ◽  
Xiaodan Wang ◽  
Huiyou Chang

Background: At present, using computer methods to predict drug-target interactions (DTIs) is a very important step in the discovery of new drugs and drug relocation processes. The potential DTIs identified by machine learning methods can provide guidance in biochemical or clinical experiments. Objective: The goal of this article is to combine the latest network representation learning methods for drug-target prediction research, improve model prediction capabilities, and promote new drug development. Methods: We use large-scale information network embedding (LINE) method to extract network topology features of drugs, targets, diseases, etc., integrate features obtained from heterogeneous networks, construct binary classification samples, and use random forest (RF) method to predict DTIs. Results: The experiments in this paper compare the common classifiers of RF, LR, and SVM, as well as the typical network representation learning methods of LINE, Node2Vec, and DeepWalk. It can be seen that the combined method LINE-RF achieves the best results, reaching an AUC of 0.9349 and an AUPR of 0.9016. Conclusion: The learning method based on LINE network can effectively learn drugs, targets, diseases and other hidden features from the network topology. The combination of features learned through multiple networks can enhance the expression ability. RF is an effective method of supervised learning. Therefore, the Line-RF combination method is a widely applicable method.


Biology ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 107
Author(s):  
Apurva Badkas ◽  
Thanh-Phuong Nguyen ◽  
Laura Caberlotto ◽  
Jochen G. Schneider ◽  
Sébastien De Landtsheer ◽  
...  

A large percentage of the global population is currently afflicted by metabolic diseases (MD), and the incidence is likely to double in the next decades. MD associated co-morbidities such as non-alcoholic fatty liver disease (NAFLD) and cardiomyopathy contribute significantly to impaired health. MD are complex, polygenic, with many genes involved in its aetiology. A popular approach to investigate genetic contributions to disease aetiology is biological network analysis. However, data dependence introduces a bias (noise, false positives, over-publication) in the outcome. While several approaches have been proposed to overcome these biases, many of them have constraints, including data integration issues, dependence on arbitrary parameters, database dependent outcomes, and computational complexity. Network topology is also a critical factor affecting the outcomes. Here, we propose a simple, parameter-free method, that takes into account database dependence and network topology, to identify central genes in the MD network. Among them, we infer novel candidates that have not yet been annotated as MD genes and show their relevance by highlighting their differential expression in public datasets and carefully examining the literature. The method contributes to uncovering connections in the MD mechanisms and highlights several candidates for in-depth study of their contribution to MD and its co-morbidities.


2018 ◽  
Author(s):  
Marcus A. M. de Aguiar ◽  
Erica A. Newman ◽  
Mathias M. Pires ◽  
Justin D. Yeakel ◽  
David H. Hembry ◽  
...  

AbstractThe structure of ecological interactions is commonly understood through analyses of interaction networks. However, these analyses may be sensitive to sampling biases in both the interactors (the nodes of the network) and interactions (the links between nodes), because the detectability of species and their interactions is highly heterogeneous. These issues may affect the accuracy of empirically constructed ecological networks. Yet statistical biases introduced by sampling error are difficult to quantify in the absence of full knowledge of the underlying ecological network’s structure. To explore properties of large-scale modular networks, we developed EcoNetGen, which constructs and samples networks with predetermined topologies. These networks may represent a wide variety of communities that vary in size and types of ecological interactions. We sampled these networks with different sampling designs that may be employed in field observations. The observed networks generated by each sampling process were then analyzed with respect to the number of components, size of components and other network metrics. We show that the sampling effort needed to estimate underlying network properties accurately depends both on the sampling design and on the underlying network topology. In particular, networks with random or scale-free modules require more complete sampling to reveal their structure, compared to networks whose modules are nested or bipartite. Overall, the modules with nested structure were the easiest to detect, regardless of sampling design. Sampling according to species degree (number of interactions) was consistently found to be the most accurate strategy to estimate network structure. Conversely, sampling according to module (representing different interaction types or taxa) results in a rather complete view of certain modules, but fails to provide a complete picture of the underlying network. We recommend that these findings be incorporated into field sampling design of projects aiming to characterize large species interactions networks to reduce sampling biases.Author SummaryEcological interactions are commonly modeled as interaction networks. Analyses of such networks may be sensitive to sampling biases and detection issues in both the interactors and interactions (nodes and links). Yet, statistical biases introduced by sampling error are difficult to quantify in the absence of full knowledge of the underlying network’s structure. For insight into ecological networks, we developed software EcoNetGen (available in R and Python). These allow the generation and sampling of several types of large-scale modular networks with predetermined topologies, representing a wide variety of communities and types of ecological interactions. Networks can be sampled according to designs employed in field observations. We demonstrate, through first uses of this software, that underlying network topology interacts strongly with empirical sampling design, and that constructing empirical networks by starting with highly connected species may be the give the best representation of the underlying network.


Author(s):  
Thomas Weise ◽  
Raymond Chiong

The ubiquitous presence of distributed systems has drastically changed the way the world interacts, and impacted not only the economics and governance but also the society at large. It is therefore important for the architecture and infrastructure within the distributed environment to be continuously renewed in order to cope with the rapid changes driven by the innovative technologies. However, many problems in distributed computing are either of dynamic nature, large scale, NP complete, or a combination of any of these. In most cases, exact solutions are hardly found. As a result, a number of intelligent nature-inspired algorithms have been used recently, as these algorithms are capable of achieving good quality solutions in reasonable computational time. Among all the nature-inspired algorithms, evolutionary algorithms are considerably the most extensively applied ones. This chapter presents a systematic review of evolutionary algorithms employed to solve various problems related to distributed systems. The review is aimed at providing an insight of evolutionary approaches, in particular genetic algorithms and genetic programming, in solving problems in five different areas of network optimization: network topology, routing, protocol synthesis, network security, and parameter settings and configuration. Some interesting applications from these areas will be discussed in detail with the use of illustrative examples.


IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 16991-17000 ◽  
Author(s):  
Xiaohui Wang ◽  
Haoran Gu ◽  
Hao Zhang ◽  
Haoyue Chen

2016 ◽  
Vol 72 (3) ◽  
pp. 874-899 ◽  
Author(s):  
Sadoon Azizi ◽  
Naser Hashemi ◽  
Ahmad Khonsari

Sign in / Sign up

Export Citation Format

Share Document