Results 41 to 50 of about 11,781 (210)
An Optimization of Closed Frequent Subgraph Mining Algorithm
Graph mining isamajor area of interest within the field of data mining in recent years. Akey aspect of graph mining is frequent subgraph mining. Central to the entire discipline of frequent subgraph mining is the concept of subgraph isomorphism.
Demetrovics J. +3 more
doaj +1 more source
Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than ...
Sofie Demeyer +5 more
doaj +1 more source
Efficient Densest Subgraphs Discovery in Large Dynamic Graphs by Greedy Approximation
Densest subgraph detection has become an important primitive in graph mining tasks when analyzing communities and detecting events in a wide range of application domains.
Tao Han
doaj +1 more source
Detecting Incremental Frequent Subgraph Patterns in IoT Environments
As graph stream data are continuously generated in Internet of Things (IoT) environments, many studies on the detection and analysis of changes in graphs have been conducted. In this paper, we propose a method that incrementally detects frequent subgraph
Kyoungsoo Bok +3 more
doaj +1 more source
Complex Network Filtering and Compression Algorithm Based on Triangle-Subgraph
Compressing the data of a complex network is important for visualization. Based on the triangle-subgraph structure in complex networks, complex network filtering compression algorithm based on the triangle-subgraph is proposed.
Shuxia Ren, Tao Wu, Shubo Zhang
doaj +1 more source
Phase‐Sensitive Engineering of Optical Disordered Materials Using Heterogeneous Networks
Networks provide an insightful framework for describing complex interactions. Here, we develop heterogeneous network modeling of light scattering to engineer multiphase random heterogeneous materials. We devise multipartite network decomposition, separating intra‐ and inter‐phase wave interferences.
Seungmok Youn +5 more
wiley +1 more source
Lung cancer is the most diagnosed malignant neoplasm worldwide and it is associated with great mortality. Currently, developing antineoplastic agents is a challenging, time-consuming, and costly process.
Valeria V. Kleandrova +2 more
doaj +1 more source
On Minimal Unique Induced Subgraph Queries
In this paper, a novel type of interesting subgraph query is proposed: Minimal Unique Induced Subgraph (MUIS) query. Given a (large) graph G and a query vertex (position) q in the graph, can we find an induced subgraph containing q with the minimal ...
Lincheng Jiang +6 more
doaj +1 more source
Scalable Task Planning via Large Language Models and Structured World Representations
This work efficiently combines graph‐based world representations with the commonsense knowledge in Large Language Models to enhance planning techniques for the large‐scale environments that modern robots will need to face. Planning methods often struggle with computational intractability when solving task‐level problems in large‐scale environments ...
Rodrigo Pérez‐Dattari +4 more
wiley +1 more source
Unveil Fundamental Graph Properties for Neural Architecture Search
This paper proposes NASGraph, a graph‐based framework that represents neural architectures as graphs whose structural properties determine performance. By revealing structure–performance relationships, NASGraph enables efficient neural architecture search with significantly reduced computation.
Zhenhan Huang +4 more
wiley +1 more source

