Comparison of Graph Distance Measures for Movie Similarity Using a Multilayer Network Model.

Graph distance measures have emerged as an effective tool for evaluating the similarity or dissimilarity between graphs. Recently, there has been a growing trend in the application of movie networks to analyze and understand movie stories. Previous studies focused on computing the distance between individual characters in narratives and identifying the most important ones. Unlike previous techniques, which often relied on representing movie stories through single-layer networks based on characters or keywords, a new multilayer network model was developed to allow a more comprehensive representation of movie stories, including character, keyword, and location aspects. To assess the similarities among movie stories, we propose a methodology that utilizes a multilayer network model and layer-to-layer distance measures. We aim to quantify the similarity between movie networks by verifying two aspects: (i) regarding many components of the movie story and (ii) quantifying the distance between their corresponding movie networks. We tend to explore how five graph distance measures reveal the similarity between movie stories in two aspects: (i) finding the order of similarity among movies within the same genre, and (ii) classifying movie stories based on genre. We select movies from various genres: sci-fi, horror, romance, and comedy. We extract movie stories from movie scripts regarding character, keyword, and location entities to perform this. Then, we compute the distance between movie networks using different methods, such as the network portrait divergence, the network Laplacian spectra descriptor (NetLSD), the network embedding as matrix factorization (NetMF), the Laplacian spectra, and D-measure. The study shows the effectiveness of different methods for identifying similarities among various genres and classifying movies across different genres. The results suggest that the efficiency of an approach on a specific network type depends on its capacity to capture the inherent network structure of that type. We propose incorporating the approach into movie recommendation systems.

DbKB a knowledge graph dataset for diabetes: A system biology approach.

Diabetes has emerged as a prevalent disease, affecting millions of individuals annually according to statistics. Numerous studies have delved into identifying key genes implicated in the causal mechanisms of diabetes. This paper specifically concentrates on 20 functional genes identified in various studies contributing to the complexities associated with Type 2 diabetes (T2D), encompassing complications such as nephropathy, retinopathy, cardiovascular disorders, and foot ulcers. These functional genes serve as a foundation for identifying regulatory genes, their regulators, and protein-protein interactions. The current study introduces a multi-layer Knowledge Graph (DbKB based on MSNMD: Multi-Scale Network Model for Diabetes), encompassing biological networks such as gene regulatory networks and protein-protein interaction networks. This Knowledge Graph facilitates the visualization and querying of inherent relationships between biological networks associated with diabetes, enabling the retrieval of regulatory genes, functional genes, interacting proteins, and their relationships. Through the integration of biologically relevant genetic, molecular, and regulatory information, we can scrutinize interactions among T2D candidate genes [1] and ascertain diseased genes [2]. The first layer of regulators comprises direct regulators to the functional genes, sourced from the TRRUST database in the human transcription factors dataset, thereby forming a multi-layered directed graph. A comprehensive exploration of these direct regulators reveals a total of 875 regulatory transcription factors, constituting the initial layer of regulating transcription factors. Moving to the second layer, we identify 550 regulatory genes. These functional genes engage with other proteins to form complexes, exhibiting specific functions. Leveraging these layers, we construct a Knowledge Graph aimed at identifying interaction-driven sub-networks involving (i) regulating functional genes, (ii) functional genes, and (iii) protein-protein interactions.

Interplay between vaccines and treatment for dengue control: An epidemic model.

Assessing public health intervention strategies is crucial for effectively managing dengue. While numerous studies have explored the impact of dengue interventions on its transmission dynamics, limited research has focused on the combined effects of implementing multiple therapeutic interventions for disease control. This study presents an epidemic model for understanding dengue transmission dynamics, incorporating two critical therapeutic measures: vaccination and treatment of infected individuals. The model is characterized by ordinary differential equations involving seven-state variables. The investigation encompasses both disease-free and endemic equilibria of the model. The findings reveal that the disease-free equilibrium (only) is globally stable when the basic reproduction number is below one. Interestingly, when the vaccine's effectiveness is low, treatment emerges as a more successful approach in reducing dengue cases than vaccination. In contrast, a highly effective vaccine alone significantly curtails dengue occurrences. Moreover, the study introduces an optimal control problem, featuring an objective function integrating two control mechanisms: vaccination and treatment. The analysis strongly suggests that implementing two control strategies outweighs the efficacy of a single approach in effectively mitigating the spread of the disease.

An evaluation tool for backbone extraction techniques in weighted complex networks.

Networks are essential for analyzing complex systems. However, their growing size necessitates backbone extraction techniques aimed at reducing their size while retaining critical features. In practice, selecting, implementing, and evaluating the most suitable backbone extraction method may be challenging. This paper introduces netbone, a Python package designed for assessing the performance of backbone extraction techniques in weighted networks. Its comparison framework is the standout feature of netbone. Indeed, the tool incorporates state-of-the-art backbone extraction techniques. Furthermore, it provides a comprehensive suite of evaluation metrics allowing users to evaluate different backbones techniques. We illustrate the flexibility and effectiveness of netbone through the US air transportation network analysis. We compare the performance of different backbone extraction techniques using the evaluation metrics. We also show how users can integrate a new backbone extraction method into the comparison framework. netbone is publicly available as an open-source tool, ensuring its accessibility to researchers and practitioners. Promoting standardized evaluation practices contributes to the advancement of backbone extraction techniques and fosters reproducibility and comparability in research efforts. We anticipate that netbone will serve as a valuable resource for researchers and practitioners enabling them to make informed decisions when selecting backbone extraction techniques to gain insights into the structural and functional properties of complex systems.

Ranking influential nodes in complex networks with community structure.

Quantifying a node's importance is decisive for developing efficient strategies to curb or accelerate any spreading phenomena. Centrality measures are well-known methods used to quantify the influence of nodes by extracting information from the network's structure. The pitfall of these measures is to pinpoint nodes located in the vicinity of each other, saturating their shared zone of influence. In this paper, we propose a ranking strategy exploiting the ubiquity of the community structure in real-world networks. The proposed community-aware ranking strategy naturally selects a set of distant spreaders with the most significant influence in the networks. One can use it with any centrality measure. We investigate its effectiveness using real-world and synthetic networks with controlled parameters in a Susceptible-Infected-Recovered (SIR) diffusion model scenario. Experimental results indicate the superiority of the proposed ranking strategy over all its counterparts agnostic about the community structure. Additionally, results show that it performs better in networks with a strong community structure and a high number of communities of heterogeneous sizes.

MIGAN: Mutual-Interaction Graph Attention Network for Collaborative Filtering.

Many web platforms now include recommender systems. Network representation learning has been a successful approach for building these efficient recommender systems. However, learning the mutual influence of nodes in the network is challenging. Indeed, it carries collaborative signals accounting for complex user-item interactions on user decisions. For this purpose, in this paper, we develop a Mutual Interaction Graph Attention Network "MIGAN", a new algorithm based on self-supervised representation learning on a large-scale bipartite graph (BGNN). Experimental investigation with real-world data demonstrates that MIGAN compares favorably with the baselines in terms of prediction accuracy and recommendation efficiency.

Complex Network Analysis of Mass Violation, Specifically Mass Killing.

News reports in media contain news about society's social and political conditions. With the help of publicly available digital datasets of events, it is possible to study a complex network of mass violations, i.e., Mass Killings. Multiple approaches have been applied to bring essential insights into the events and involved actors. Power law distribution behavior finds in the tail of actor mention, co-actor mention, and actor degree tells us about the dominant behavior of influential actors that grows their network with time. The United States, France, Israel, and a few other countries have been identified as major players in the propagation of Mass Killing throughout the past 20 years. It is demonstrated that targeting the removal of influential actors may stop the spreading of such conflicting events and help policymakers and organizations. This paper aims to identify and formulate the conflicts with the actor's perspective at a global level for a period of time. This process is a generalization to be applied to any level of news, i.e., it is not restricted to only the global level.

Revealing the component structure of the world air transportation network.

Air transportation plays an essential role in the global economy. Therefore, there is a great deal of work to understand better the complex network formed by the links between the origins and destinations of flights. Some investigations show that the world air transportation network exhibits a community and a core-periphery structure. Although precious, these representations do not distinguish the inter-regional (global) web of connections from the regional (local) one. Therefore, we propose a new mesoscopic model called the component structure that decomposes the network into local and global components. Local components are the dense areas of the network, and global components are the nodes and links bridging the local components. As a case study, we consider the unweighted and undirected world air transportation network. Experiments show that it contains seven large local components and multiple small ones spatially well-defined. Moreover, it has a main global component covering the world. We perform an extensive comparative analysis of the structure of the components. Results demonstrate the non-homogeneous nature of the world air transportation network. The local components structure highlights regional differences, and the global component organization captures the efficiency of inter-regional travel. Centrality analysis of the components allows distinguishing airports centered on regional destinations from those focused on inter-regional exchanges. Core analysis is more accurate in the components than in the whole network where Europe dominates, blurring the rest of the world. Besides the world air transportation network, this paper demonstrates the potential of the component decomposition for modeling and analyzing the mesoscale structure of networks.

A Hybrid Robust Image Watermarking Method Based on DWT-DCT and SIFT for Copyright Protection.

In this paper, a robust hybrid watermarking method based on discrete wavelet transform (DWT), discrete cosine transform (DCT), and scale-invariant feature transformation (SIFT) is proposed. Indeed, it is of prime interest to develop robust feature-based image watermarking schemes to withstand both image processing attacks and geometric distortions while preserving good imperceptibility. To this end, a robust watermark is embedded in the DWT-DCT domain to withstand image processing manipulations, while SIFT is used to protect the watermark from geometric attacks. First, the watermark is embedded in the middle band of the discrete cosine transform (DCT) coefficients of the HL1 band of the discrete wavelet transform (DWT). Then, the SIFT feature points are registered to be used in the extraction process to correct the geometric transformations. Extensive experiments have been conducted to assess the effectiveness of the proposed scheme. The results demonstrate its high robustness against standard image processing attacks and geometric manipulations while preserving a high imperceptibility. Furthermore, it compares favorably with alternative methods.

Characterizing the interactions between classical and community-aware centrality measures in complex networks.

Identifying vital nodes in networks exhibiting a community structure is a fundamental issue. Indeed, community structure is one of the main properties of real-world networks. Recent works have shown that community-aware centrality measures compare favorably with classical measures agnostic about this ubiquitous property. Nonetheless, there is no clear consensus about how they relate and in which situation it is better to use a classical or a community-aware centrality measure. To this end, in this paper, we perform an extensive investigation to get a better understanding of the relationship between classical and community-aware centrality measures reported in the literature. Experiments use artificial networks with controlled community structure properties and a large sample of real-world networks originating from various domains. Results indicate that the stronger the community structure, the more appropriate the community-aware centrality measures. Furthermore, variations of the degree and community size distribution parameters do not affect the results. Finally, network transitivity and community structure strength are the most significant drivers controlling the interactions between classical and community-aware centrality measures.

Extracting backbones in weighted modular complex networks.

Network science provides effective tools to model and analyze complex systems. However, the increasing size of real-world networks becomes a major hurdle in order to understand their structure and topological features. Therefore, mapping the original network into a smaller one while preserving its information is an important issue. Extracting the so-called backbone of a network is a very challenging problem that is generally handled either by coarse-graining or filter-based methods. Coarse-graining methods reduce the network size by grouping similar nodes, while filter-based methods prune the network by discarding nodes or edges based on a statistical property. In this paper, we propose and investigate two filter-based methods exploiting the overlapping community structure in order to extract the backbone in weighted networks. Indeed, highly connected nodes (hubs) and overlapping nodes are at the heart of the network. In the first method, called "overlapping nodes ego backbone", the backbone is formed simply from the set of overlapping nodes and their neighbors. In the second method, called "overlapping nodes and hubs backbone", the backbone is formed from the set of overlapping nodes and the hubs. For both methods, the links with the lowest weights are removed from the network as long as a backbone with a single connected component is preserved. Experiments have been performed on real-world weighted networks originating from various domains (social, co-appearance, collaboration, biological, and technological) and different sizes. Results show that both backbone extraction methods are quite similar. Furthermore, comparison with the most influential alternative filtering method demonstrates the greater ability of the proposed backbones extraction methods to uncover the most relevant parts of the network.

Centrality in Complex Networks with Overlapping Community Structure.

Identifying influential spreaders in networks is an essential issue in order to prevent epidemic spreading, or to accelerate information diffusion. Several centrality measures take advantage of various network topological properties to quantify the notion of influence. However, the vast majority of works ignore its community structure while it is one of the main features of many real-world networks. In a recent study, we show that the centrality of a node in a network with non-overlapping communities depends on two features: Its local influence on the nodes belonging to its community, and its global influence on the nodes belonging to the other communities. Using global and local connectivity of the nodes, we introduced a framework allowing to redefine all the classical centrality measures (designed for networks without community structure) to non-overlapping modular networks. In this paper, we extend the so-called "Modular Centrality" to networks with overlapping communities. Indeed, it is a frequent scenario in real-world networks, especially for social networks where nodes usually belong to several communities. The "Overlapping Modular Centrality" is a two-dimensional measure that quantifies the local and global influence of overlapping and non-overlapping nodes. Extensive experiments have been performed on synthetic and real-world data using the Susceptible-Infected-Recovered (SIR) epidemic model. Results show that the Overlapping Modular Centrality outperforms its alternatives designed for non-modular networks. These investigations provide better knowledge on the influence of the various parameters governing the overlapping community structure on the nodes' centrality. Additionally, two combinations of the components of the Overlapping Modular Centrality are evaluated. Comparative analysis with competing methods shows that they produce more efficient centrality scores.

Choosing Optimal Seed Nodes in Competitive Contagion.

In recent years there has been a growing interest in simulating competitive markets to find out the efficient ways to advertise a product or spread an ideology. Along this line, we consider a binary competitive contagion process where two infections, A and B, interact with each other and diffuse simultaneously in a network. We investigate which is the best centrality measure to find out the seed nodes a company should adopt in the presence of rivals so that it can maximize its influence. These nodes can be used as the initial spreaders or advertisers by firms when two firms compete with each other. Each node is assigned a price tag to become an initial advertiser which varies according to their importance in the network. Considering their fixed budgets, they initially determine the payoff of their products and the number of their initial seeds in the network. Under this setting, we study the question of whether to choose a small number of influential nodes or a larger number of less influential nodes.

Maximum likelihood difference scaling of image quality in compression-degraded images.

Lossy image compression techniques allow arbitrarily high compression rates but at the price of poor image quality. We applied maximum likelihood difference scaling to evaluate image quality of nine images, each compressed via vector quantization to ten different levels, within two different color spaces, RGB and CIE 1976 L*a*b*. In L*a*b* space, images could be compressed on average by 32% more than in RGB space, with little additional loss in quality. Further compression led to marked perceptual changes. Our approach permits a rapid, direct measurement of the consequences of image compression for human observers.

HOS-based image sequence noise removal.

In this paper, a new spatiotemporal filtering scheme is described for noise reduction in video sequences. For this purpose, the scheme processes each group of three consecutive sequence frames in two steps: 1) estimate motion between frames and 2) use motion vectors to get the final denoised current frame. A family of adaptive spatiotemporal L-filters is applied. A recursive implementation of these filters is used and compared with its nonrecursive counterpart. The motion trajectories are obtained recursively by a region-recursive estimation method. Both motion parameters and filter weights are computed by minimizing the kurtosis of error instead of mean squared error. Using the kurtosis in the algorithms adaptation is appropriate in the presence of mixed and impulsive noises. The filter performance is evaluated by considering different types of video sequences. Simulations show marked improvement in visual quality and SNRI measures cost as well as compared to those reported in literature.