gSpan

swMATH11908MaRDI QIDQ23844FDOQ23844

Author name not available (Why is that?)

Cited In (90)

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

This page was built for software: gSpan