gSpan
From MaRDI portal
GSpan
Cited in
(only showing first 100 items - show all)- Three-objective subgraph mining using multiobjective evolutionary programming
- COOMA: a components overlaid mining algorithm for enumerating connected subgraphs with common itemsets
- Knowledge representation analysis of graph mining
- Performance evaluation of frequent subgraph discovery techniques
- Variability-based model transformation: formal foundation and application
- Distributed and sequential algorithms for bioinformatics
- scientific article; zbMATH DE number 1977808 (Why is no real title available?)
- Mining frequent subgraphs in multigraphs
- 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
- Interactive knowledge discovery from hidden data through sampling of frequent patterns
- Mining interesting patterns from uncertain databases
- Algorithm and Experiments in Testing Planar Graphs for Isomorphism
- 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
- A general framework for mining frequent subgraphs from labeled graphs
- XRules: an effective algorithm for structural classification of XML data
- Data mining in bioinformatics
- Learning an efficient constructive sampler for graphs
- A generalized approach for social network integration and analysis with privacy preservation
- Graph-FCA: an extension of formal concept analysis to knowledge graphs
- Effective graph classification based on topological and label attributes
- Knowledge graphs completion via probabilistic reasoning
- FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs
- Speeding-up structured probabilistic inference using pattern mining
- Transactions on Computational Systems Biology III
- Concept Lattices
- Enumeration of support-closed subsets in confluent systems
- Mining closed patterns in relational, graph and network data
- G-Tries: a data structure for storing and finding subgraphs
- Discriminative frequent subgraph mining with optimality guarantees
- Discovery Science
- Finding the best not the most: regularized loss minimization subgraph selection for graph classification
- Efficiently mining frequent embedded unordered trees
- The hybrid representation model for web document classification
- Summarizing and understanding large graphs
- An efficient approach for mining frequent subgraphs
- 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
- DMTL
- PlanMine
- CrossMine
- SeqLog
- TreeMiner
- LOGML
- SPADE
- APRIORI
- HAPLO
- AFGen
- approxBlackhole
- gBlackhole
- SPRINT
- MFinder
- TreeTagger
- SuLQ
- SLIQ
- BigML
- ANF
- Neo4J
- SPOOK
- Xproj
- TALE
- ParMol
- GeneSigDB
- PEGASUS
- PowerGraph
- SAGA
- Fg-index
- MODA
- GADDI
- GraphGrep
- GString
- MiningZinc
- SING
- FacetNet
- GraphScope
- PrefixSpan
- GGL
- GReAT
- RuleMerger
- VMQL
- Algorithm 457
- FANMOD
- Carpenter
- COBBLER
- CLOSET
- CMAR
- Krimp
- MDL4BMF
- ACME
- COOMA
- GeneWise
- Graemlin
- AnyDBC
- Kavosh
This page was built for software: gSpan
