Browse
Submit Data
Databases
API
Help

Dataset Information

15 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

A measure of identifying influential waypoints in air route networks.

ABSTRACT: As the basic carrier of air flight operation, air route network (ARN) is of great significance to the smooth operation of flights. However, the waypoint is a core part of the route, so it is an important topic to identify influential waypoints in ARN. In this paper, a method to identify the influence of the node in ARN based on an improved entropy weight (IEW) method is proposed. Then, centrality measures including degree, closeness, betweenness and eigenvector as the multi-attribute of ARN in IEW application. IEW method is used to aggregate the multi-attribute to obtain the evaluation of the influence of each waypoint. To demonstrate the effectiveness of the IEW method, three real ARNs are selected to conduct several experiments with susceptible infected recovered (SIR) model. The results show the efficiency and practicability of the proposed method.

SUBMITTER: Ren G

PROVIDER: S-EPMC6143239 | biostudies-literature | 2018

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

A measure of identifying influential waypoints in air route networks.

Ren Guangjian G Zhu Jinfu J Lu Chaoyang C

PloS one 20180918 9

As the basic carrier of air flight operation, air route network (ARN) is of great significance to the smooth operation of flights. However, the waypoint is a core part of the route, so it is an important topic to identify influential waypoints in ARN. In this paper, a method to identify the influence of the node in ARN based on an improved entropy weight (IEW) method is proposed. Then, centrality measures including degree, closeness, betweenness and eigenvector as the multi-attribute of ARN in I ...[more]

PMID: 30226848

Similar Datasets

Identifying influential nodes based on network representation learning in complex networks.

Project description:Identifying influential nodes is an important topic in many diverse applications, such as accelerating information propagation, controlling rumors and diseases. Many methods have been put forward to identify influential nodes in complex networks, ranging from node centrality to diffusion-based processes. However, most of the previous studies do not take into account overlapping communities in networks. In this paper, we propose an effective method based on network representation learning. The method considers not only the overlapping communities in networks, but also the network structure. Experiments on real-world networks show that the proposed method outperforms many benchmark algorithms and can be used in large-scale networks.

| S-EPMC6037365 | biostudies-literature

Unsupervised Scalable Statistical Method for Identifying Influential Users in Online Social Networks.

Project description:Billions of users interact intensively every day via Online Social Networks (OSNs) such as Facebook, Twitter, or Google+. This makes OSNs an invaluable source of information, and channel of actuation, for sectors like advertising, marketing, or politics. To get the most of OSNs, analysts need to identify influential users that can be leveraged for promoting products, distributing messages, or improving the image of companies. In this report we propose a new unsupervised method, Massive Unsupervised Outlier Detection (MUOD), based on outliers detection, for providing support in the identification of influential users. MUOD is scalable, and can hence be used in large OSNs. Moreover, it labels the outliers as of shape, magnitude, or amplitude, depending of their features. This allows classifying the outlier users in multiple different classes, which are likely to include different types of influential users. Applying MUOD to a subset of roughly 400 million Google+ users, it has allowed identifying and discriminating automatically sets of outlier users, which present features associated to different definitions of influential users, like capacity to attract engagement, capacity to attract a large number of followers, or high infection capacity.

| S-EPMC5934471 | biostudies-literature

PhysarumSpreader: A New Bio-Inspired Methodology for Identifying Influential Spreaders in Complex Networks.

Project description:Identifying influential spreaders in networks, which contributes to optimizing the use of available resources and efficient spreading of information, is of great theoretical significance and practical value. A random-walk-based algorithm LeaderRank has been shown as an effective and efficient method in recognizing leaders in social network, which even outperforms the well-known PageRank method. As LeaderRank is initially developed for binary directed networks, further extensions should be studied in weighted networks. In this paper, a generalized algorithm PhysarumSpreader is proposed by combining LeaderRank with a positive feedback mechanism inspired from an amoeboid organism called Physarum Polycephalum. By taking edge weights into consideration and adding the positive feedback mechanism, PhysarumSpreader is applicable in both directed and undirected networks with weights. By taking two real networks for examples, the effectiveness of the proposed method is demonstrated by comparing with other standard centrality measures.

| S-EPMC4686164 | biostudies-literature

Identifying influential neighbors in animal flocking.

Project description:Schools of fish and flocks of birds can move together in synchrony and decide on new directions of movement in a seamless way. This is possible because group members constantly share directional information with their neighbors. Although detecting the directionality of other group members is known to be important to maintain cohesion, it is not clear how many neighbors each individual can simultaneously track and pay attention to, and what the spatial distribution of these influential neighbors is. Here, we address these questions on shoals of Hemigrammus rhodostomus, a species of fish exhibiting strong schooling behavior. We adopt a data-driven analysis technique based on the study of short-term directional correlations to identify which neighbors have the strongest influence over the participation of an individual in a collective U-turn event. We find that fish mainly react to one or two neighbors at a time. Moreover, we find no correlation between the distance rank of a neighbor and its likelihood to be influential. We interpret our results in terms of fish allocating sequential and selective attention to their neighbors.

| S-EPMC5697824 | biostudies-literature

Correction: Identifying influential neighbors in animal flocking.

Project description:[This corrects the article DOI: 10.1371/journal.pcbi.1005822.].

| S-EPMC5726616 | biostudies-literature

Locating influential nodes in complex networks.

Project description:Understanding and controlling spreading processes in networks is an important topic with many diverse applications, including information dissemination, disease propagation and viral marketing. It is of crucial importance to identify which entities act as influential spreaders that can propagate information to a large portion of the network, in order to ensure efficient information diffusion, optimize available resources or even control the spreading. In this work, we capitalize on the properties of the K-truss decomposition, a triangle-based extension of the core decomposition of graphs, to locate individual influential nodes. Our analysis on real networks indicates that the nodes belonging to the maximal K-truss subgraph show better spreading behavior compared to previously used importance criteria, including node degree and k-core index, leading to faster and wider epidemic spreading. We further show that nodes belonging to such dense subgraphs, dominate the small set of nodes that achieve the optimal spreading in the network.

| S-EPMC4725982 | biostudies-literature

Identifying highly influential nodes in the complicated grief network.

Project description:The network approach to psychopathology conceptualizes mental disorders as networks of mutually reinforcing nodes (i.e., symptoms). Researchers adopting this approach have suggested that network topology can be used to identify influential nodes, with nodes central to the network having the greatest influence on the development and maintenance of the disorder. However, because commonly used centrality indices do not distinguish between positive and negative edges, they may not adequately assess the nature and strength of a node's influence within the network. To address this limitation, we developed 2 indices of a node's expected influence (EI) that account for the presence of negative edges. To evaluate centrality and EI indices, we simulated single-node interventions on randomly generated networks. In networks with exclusively positive edges, centrality and EI were both strongly associated with observed node influence. In networks with negative edges, EI was more strongly associated with observed influence than was centrality. We then used data from a longitudinal study of bereavement to examine the association between (a) a node's centrality and EI in the complicated grief (CG) network and (b) the strength of association between change in that node and change in the remainder of the CG network from 6- to 18-months postloss. Centrality and EI were both correlated with the strength of the association between node change and network change. Together, these findings suggest high-EI nodes, such as emotional pain and feelings of emptiness, may be especially important to the etiology and treatment of CG. (PsycINFO Database Record

| S-EPMC5060093 | biostudies-literature

Automatic detection of influential actors in disinformation networks.

Project description:The weaponization of digital communications and social media to conduct disinformation campaigns at immense scale, speed, and reach presents new challenges to identify and counter hostile influence operations (IOs). This paper presents an end-to-end framework to automate detection of disinformation narratives, networks, and influential actors. The framework integrates natural language processing, machine learning, graph analytics, and a network causal inference approach to quantify the impact of individual actors in spreading IO narratives. We demonstrate its capability on real-world hostile IO campaigns with Twitter datasets collected during the 2017 French presidential elections and known IO accounts disclosed by Twitter over a broad range of IO campaigns (May 2007 to February 2020), over 50,000 accounts, 17 countries, and different account types including both trolls and bots. Our system detects IO accounts with 96% precision, 79% recall, and 96% area-under-the precision-recall (P-R) curve; maps out salient network communities; and discovers high-impact accounts that escape the lens of traditional impact statistics based on activity counts and network centrality. Results are corroborated with independent sources of known IO accounts from US Congressional reports, investigative journalism, and IO datasets provided by Twitter.

| S-EPMC7848582 | biostudies-literature

Statistical Approach for Improving Genomic Prediction Accuracy through Efficient Diagnostic Measure of Influential Observation.

Project description:It is expected the predictive performance of genomic prediction methods may be adversely affected in the presence of outliers. In agriculture science an outlier may arise due to wrong data imputation, outlying response, and in a series of trials over the time or location. Although several statistical procedures are already there in literature for identification of outlier but identification of true outlier is still a challenge especially in case of high dimensional genomic data. Here we have proposed an efficient approach for detecting outlier in high dimensional genomic data, our approach is p-value based combination methods to produce single p-value for detecting the outliers. Robustness of our approach has been tested using simulated data through the evaluation measures like precision, recall etc. It has been observed that significant improvement in the performance of genomic prediction has been obtained by detecting the outliers and handling them accordingly through our proposed approach using real data.

| S-EPMC7242349 | biostudies-literature

inFRank: a ranking-based identification of influential genes in biological networks.

Project description:Capturing the predominant driver genes is critical in the analysis of high-throughput experimental data; however, existing methods scarcely include the unique characters of biological networks. Herein we introduced a ranking-based computational framework (inFRank) to rank the proteins by their influence. Using inFRank, we identified the top 20 influential genes in hepatocellular carcinoma (HCC). Network analysis revealed a prominent community composed of 7 influential genes. Intriguingly, five genes among the community were critical for mitotic spindle assembly checkpoint (SAC), suggesting that dysregulation of SAC could be a distinct feature of HCC and targeting SAC-associated genes might be a promising therapeutic strategy. Cox regression analysis revealed that CDC20 exerted as an independent risk factor for patient survival, indicating that CDC20 could be a novel biomarker for HCC prognosis. inFRank was then used for pan-cancer study, and all of the most influential genes in 18 cancers were achieved. We identified altogether 19 genes that were important in multiple cancers, and observed that cancers originating from the same organ or function-related organs tended to share more influential genes. Collectively, our results demonstrated that the inFRank was a powerful approach for deep interpretation of high-throughput data and better understanding of complex diseases.

| S-EPMC5546442 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

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