gSpan

swMATH11908MaRDI QIDQ23844

No author found.

Related Items (90)

Mining interesting patterns from uncertain databases ⋮ An Efficient Approach for Mining Frequent Subgraphs ⋮ Enumeration of support-closed subsets in confluent systems ⋮ Analysis of Complex and Heterogeneous Data Using FCA and Monadic Predicates ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Mining frequent trajectory patterns in spatial-temporal databases ⋮ Inductive Logic Programming ⋮ Inductive Logic Programming ⋮ Mining preserving structures in a graph sequence ⋮ Unnamed Item ⋮ A new algorithm for fast mining frequent itemsets using N-lists ⋮ Mining weighted subgraphs in a single large graph ⋮ Finding the best not the most: regularized loss minimization subgraph selection for graph classification ⋮ Knowledge graphs completion via probabilistic reasoning ⋮ Efficient subgraph matching using topological node feature constraints ⋮ Optimal schema hierarchies in searching semistructured databases by conjunctive regular path queries ⋮ Enumeration of irredundant forests ⋮ Three-objective subgraph mining using multiobjective evolutionary programming ⋮ Distributed discovery of frequent subgraphs of a network using MapReduce ⋮ Improving constrained pattern mining with first-fail-based heuristics ⋮ Mining spatial colocation patterns: a different framework ⋮ Counting frequent patterns in large labeled graphs: a hypergraph-based approach ⋮ Multi-way set enumeration in weight tensors ⋮ Efficiently mining \(\delta \)-tolerance closed frequent subgraphs ⋮ Effective feature construction by maximum common subgraph sampling ⋮ Efficient mining for structurally diverse subgraph patterns in large molecular databases ⋮ The hybrid representation model for web document classification ⋮ Mining frequent subgraphs in multigraphs ⋮ Efficient algorithms for supergraph query processing on graph databases ⋮ Mining blackhole and volcano patterns in directed graphs: a general approach ⋮ Set-based approximate approach for lossless graph summarization ⋮ Formal methods for mining structured objects ⋮ ABACUS: frequent pattern mining-based community discovery in multidimensional networks ⋮ Nearly exact mining of frequent trees in large networks ⋮ G-Tries: a data structure for storing and finding subgraphs ⋮ Learning block-preserving graph patterns and its application to data mining ⋮ Mining frequent closed rooted trees ⋮ gBoost: a mathematical programming approach to graph classification and regression ⋮ The graph matching problem ⋮ Performance evaluation of frequent subgraph discovery techniques ⋮ kLog: a language for logical and relational learning with kernels ⋮ Data mining of social networks represented as graphs ⋮ Finding relational redescriptions ⋮ Mining Discriminative Subgraph Patterns from Structural Data ⋮ A Generalized Approach for Social Network Integration and Analysis with Privacy Preservation ⋮ Discovery Science ⋮ Unnamed Item ⋮ A distributed approach for graph mining in massive networks ⋮ Graph sampling with applications to estimating the number of pattern embeddings and the parameters of a statistical relational model ⋮ Frequent Submap Discovery ⋮ Learning an efficient constructive sampler for graphs ⋮ Variability-based model transformation: formal foundation and application ⋮ Mining closed patterns in relational, graph and network data ⋮ A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics ⋮ Probabilistic SimRank computation over uncertain graphs ⋮ Distributed and sequential algorithms for bioinformatics ⋮ Fitting Pattern Structures to Knowledge Discovery in Big Data ⋮ Frequency-based views to pattern collections ⋮ Data mining in bioinformatics ⋮ XRules: an effective algorithm for structural classification of XML data ⋮ Generalized median graphs and applications ⋮ Support measures for graph data ⋮ Mining Frequent Closed Unordered Trees Through Natural Representations ⋮ Computational aspects of mining maximal frequent patterns ⋮ An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence ⋮ Graph-FCA: an extension of formal concept analysis to knowledge graphs ⋮ RuleMerger: Automatic Construction of Variability-Based Model Transformation Rules ⋮ Hybrid ASP-based Approach to Pattern Mining ⋮ Disk-based shortest path discovery using distance index over large dynamic graphs ⋮ \textsc{Para}\textsc{Miner}: a generic pattern mining algorithm for multi-core architectures ⋮ Interesting pattern mining in multi-relational data ⋮ Algorithm and Experiments in Testing Planar Graphs for Isomorphism ⋮ ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns ⋮ Discriminative frequent subgraph mining with optimality guarantees ⋮ A framework for clustering massive graph streams ⋮ A classification for community discovery methods in complex networks ⋮ Effective graph classification based on topological and label attributes ⋮ Summarizing and understanding large graphs ⋮ Interactive knowledge discovery from hidden data through sampling of frequent patterns ⋮ COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets ⋮ Constraint-Based Mining and Inductive Databases ⋮ Transactions on Computational Systems Biology III ⋮ Knowledge representation analysis of graph mining ⋮ Distance metric learning for graph structured data ⋮ Concept Lattices ⋮ FP-GraphMiner-A Fast Frequent Pattern Mining Algorithm for Network Graphs ⋮ Speeding-up structured probabilistic inference using pattern mining

This page was built for software: gSpan