Search

Large graphs are often used to simulate and model complex systems in various research and application fields. Because of its importance, frequent subgraph mining (FSM) in single large graphs is a vital issue, and recently, it has attracted numerous researchers, and played an important role in various tasks for both research and application purposes. FSM is aimed at finding all subgraphs whose number of appearances in a large graph is greater than or equal to a given frequency threshold. In most recent applications, the underlying graphs are very large, such as social networks, and therefore algorithms for FSM from a single large graph have been rapidly developed, but all of them have NP‐hard (nondeterministic polynomial time) complexity with huge search spaces, and therefore still need a lot of time and memory to restore and process. In this article, we present an overview of problems of FSM, important phases in FSM, main groups of FSM, as well as surveying many modern applied algorithms. This includes many practical applications and is a fundamental premise for many studies in the future. This article is categorized under:Algorithmic Development > Association RulesAlgorithmic Development > Structure Discovery [ABSTRACT FROM AUTHOR]

This article describes the methodology and the possibilities of collecting operation data in a mobile network provider. First, the architecture and the principles used in the system are described. The precision analysis of the population commuting in the region and during the pandemic and nonpandemic times. Moreover, several ideas about further utilization of the data will be formulated and described. Finally, a graph‐based approach that describes the creation of the community structure between the people and the means of its analysis. [ABSTRACT FROM AUTHOR]

Summary: Digital steganography aims at hiding secret messages in digital data transmitted over insecure channels. The JPEG format is prevalent in digital communication, and images are often used as cover objects in digital steganography. Optimization methods can improve the properties of images with embedded secret but introduce additional computational complexity to their processing. AVX instructions available in modern CPUs are, in this work, used to accelerate data parallel operations that are part of image steganography with advanced optimizations. [ABSTRACT FROM AUTHOR]