23 papers · ranked by Valyu relevance
Chiwan Park, Ha-Myung Park, U. Kang, Roland Bouffanais
How can we analyze large graphs such as the Web, and social networks with hundreds of billions of vertices and edges? Although many graph mining systems have been proposed to perform various graph mining algorithms on such large graphs, they have difficulties in processing Web-scale graphs due to massive communication…
Sabeur Aridhi, Engelbert Mephu Nguifo
Big graph mining is an important research area and it has attracted considerable attention. It allows to process, analyze, and extract meaningful information from large amounts of graph data. Big graph mining has been highly motivated not only by the tremendously increasing size of graphs but also by its huge number of…
Yuzhong Chen, Zhenyu Liu, Yulin Liu, Chen Dong
Attack graph modeling aims to generate attack models by investigating attack behaviors recorded in intrusion alerts raised in network security devices. Attack models can help network security administrators discover an attack strategy that intruders use to compromise the network and implement a timely response to…
Lorenzo Di Rocco, Umberto Ferraro Petrillo, Simona E. Rombo
Background Huge amounts of molecular interaction data are continuously produced and stored in public databases. Although many bioinformatics tools have been proposed in the literature for their analysis, based on their modeling through different types of biological networks, several problems still remain unsolved when…
Erfan Farhangi Maleki, Nasser Ghadiri, Maryam Lotfi Shahreza, Zeinab Maleki
Heterogeneous complex networks are large graphs consisting of different types of nodes and edges. The process of mining and knowledge extraction from these networks is so complicated. Moreover, the scale of these networks is steadily increasing. Thus, scalable methods are required. In this paper, two distributed label…
Carlos H. C. Teixeira, Alexandre J. Fonseca, Marco Serafini, Georgos Siganos + 2 more
Distributed data processing platforms such as MapReduce and Pregel have substantially simplified the design and deployment of certain classes of distributed graph analytics algorithms. However, these platforms do not represent a good match for distributed graph mining problems, as for example finding frequent subgraphs…
Lingkai Meng, Yu Shao, Long Yuan, Longbin Lai + 6 more
'Wenyuan Yu' 'Wenjie Zhang' 'Xuemin Lin' 'Jingren Zhou'] LINGKAI MENG, Antai College of Economics and Management, Shanghai Jiao Tong University, China YU SHAO, East China Normal University, China LONG YUAN∗ , Nanjing University of Science and Technology, China LONGBIN LAI, Alibaba Group, China PENG CHENG, East China…
Vasiliki Kalavri, Vladimir Vlassov, Seif Haridi
—Efficient processing of large-scale graphs in distributed environments has been an increasingly popular topic of research in recent years. Inter-connected data that can be modeled as graphs arise in application domains such as machine learning, recommendation, web search, and social network analysis. Writing…
Alessio Guerrieri, Alberto Montresor
—The availability of larger and larger graph datasets, growing exponentially over the years, has created several new algorithmic challenges to be addressed. Sequential approaches have become unfeasible, while interest on parallel and distributed algorithms has greatly increased. Appropriately partitioning the graph as…
Xavier Martinez-Palau, David Domínguez-Sal, Reza Akbarinia, Patrick Valduriez + 1 more
'Patrick Valduriez' 'Josep-L. Larriba-Pey'] In this paper, we propose the DN-tree that is a data structure to build lossy summaries of the frequent data access patterns of the queries in a distributed graph data management system. These compact representations allow us an efficient communication of the data structure…
Ha-Myung Park, Namyong Park, Sung-Hyon Myaeng, U Kang + 1 more
'Tatsuro Kawamoto'] A connected component in a graph is a set of nodes linked to each other by paths. The problem of finding connected components has been applied to diverse graph analysis tasks such as graph partitioning, graph compression, and pattern recognition. Several distributed algorithms have been proposed to…
Miguel E. Coimbra, Alexandre P. Francisco, Luís Veiga
The value of graph-based big data can be unlocked by exploring the topology and metrics of the networks they represent, and the computational approaches to this exploration take on many forms. For the use-case of performing global computations over a graph, it is first ingested into a graph processing system from one…
Sebastian Keller, Pauli Miettinen, Olga V. Kalinina
Identification of biologically relevant motifs in proteins is a long-standing problem in bioinformatics, especially when considering distantly related proteins where sequence analysis alone becomes increasingly difficult. Here we present a novel approach to identify such motifs in protein three-dimensional structures…
Omar Batarfi, Radwa Elshawi, Ayman Fayoumi, Ahmed Barnawi + 1 more
'Sherif Sakr'] A graph is a popular data model that has become pervasively used for modeling structural relationships between objects. In practice, in many real-world graphs, the graph vertices and edges need to be associated with descriptive attributes. Such type of graphs are referred to as attributed graphs.…
Wilfried Agbeto, Camille Coti, Vladimir Reinharz
Advances in graph algorithmics have allowed in-depth study of many natural objects from molecular biology or chemistry to social networks. Particularly in molecular biology and cheminformatics, understanding complex structures by identifying conserved sub-structures is a key milestone towards the artificial design of…
Authors not listed
Background: Chemical reactions form intricate, highly connected networks whose exploration is essential for discovering more efficient and sustainable synthetic routes. As reaction data from literature, patents, and high‑throughput experimentation continue to surge, so does the need for tools that can collectively…
Haotian Li
Machine learning and deep learning are novel and trending approaches to solving real-world scientific problems. Graph machine learning is dedicated to performing learning methods, such as graph neural networks, on non-Euclidean data such as graphs. Molecules, with their natural graph structures, could be analyzed by…
Aaron J. Gutknecht, Michael Wibral
We describe how the recently introduced method of significant subgraph mining can be employed as a useful tool in network comparison. It is applicable whenever the goal is to compare two sets of unweighted graphs and to determine differences in the processes that generate them. We provide an extension of the method to…
Michael Statt, Brian Rohr, Dan Guevarra, Ja'Nya Breeden + 2 more
Materials knowledge is inherently hierarchical. While high-level descriptors such as composition and structure are valuable for contextualizing materials data, the data must ultimately be considered in the context of its low-level acquisition details. Graph databases offer an opportunity to represent hierarchical…
Jana Weber, Pietro Lio’, Alexei Lapkin
Networks of chemical reactions represent relationships between molecules within chemical supply chains and promise to enhance planning of multi-step synthesis routes from bio-renewable feedstocks. This study aims to identify strategic molecules in chemical reaction networks that may potentially play a significant role…
Lionel Zoubritzky, François-Xavier Coudert
We present here an open-source Julia library for the topological identification of crystalline materials, with algorithmic and computational improvements over the previously available software in the field, resulting in a speed increase of one order of magnitude. This new algorithm and implementation can therefore be…
Murat Cihan Sorkun, Dajt Mullaj, J. M. Vianney A. Koelman, Süleyman Er
Visualizing chemical spaces streamlines the analysis of molecular datasets by reducing the information to human perception level, hence it forms an integral piece of molecular engineering, including chemical library design, high-throughput screening, diversity analysis, and outlier detection. We present here ChemPlot…
Authors not listed
Effective visualization of complex synthesis routes is critical for computeraided synthesis planning (CASP), yet current solutions are limited in scope, integration flexibility, and chemical intuition. We introduce RouteWise, a versatile, containerized web application designed to address these unmet needs. Its modular…