gSpan
From MaRDI portal
GSpan
Cited in
(only showing first 100 items - show all)- DMTL
- PlanMine
- SeqLog
- TreeMiner
- CrossMine
- SPADE
- LOGML
- APRIORI
- Mining interesting patterns from uncertain databases
- Finding the best not the most: regularized loss minimization subgraph selection for graph classification
- HAPLO
- Efficient subgraph matching using topological node feature constraints
- Performance evaluation of frequent subgraph discovery techniques
- 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
- AFGen
- approxBlackhole
- gBlackhole
- Mining blackhole and volcano patterns in directed graphs: a general approach
- Formal methods for mining structured objects
- 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
- TreeTagger
- MFinder
- Distance metric learning for graph structured data
- Enumeration of support-closed subsets in confluent systems
- Counting frequent patterns in large labeled graphs: a hypergraph-based approach
- Mining frequent subgraphs in multigraphs
- Mining closed patterns in relational, graph and network data
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics
- Generalized median graphs and applications
- Graph-FCA: an extension of formal concept analysis to knowledge graphs
- Disk-based shortest path discovery using distance index over large dynamic graphs
- Knowledge representation analysis of graph mining
- SuLQ
- Speeding-up structured probabilistic inference using pattern mining
- SLIQ
- SPRINT
- Mining frequent trajectory patterns in spatial-temporal databases
- Neo4J
- BigML
- ANF
- 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
- The graph matching problem
- SPOOK
- Xproj
- Frequency-based views to pattern collections
- XRules: an effective algorithm for structural classification of XML data
- Support measures for graph data
- Computational aspects of mining maximal frequent patterns
- TALE
- Mining weighted subgraphs in a single large graph
- Knowledge graphs completion via probabilistic reasoning
- Enumeration of irredundant forests
- ParMol
- \textit{RuleMerger}: automatic construction of variability-based model transformation rules
- FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs
- GeneSigDB
- PowerGraph
- PEGASUS
- Frequent submap discovery
- GraphGrep
- Fg-index
- GADDI
- GString
- SING
- SAGA
- MiningZinc
- FacetNet
- GraphScope
- PrefixSpan
- Algorithm and Experiments in Testing Planar Graphs for Isomorphism
- Mining preserving structures in a graph sequence
- RuleMerger
- GGL
- VMQL
- GReAT
- The hybrid representation model for web document classification
- Adaptive stream mining: Pattern learning and mining from evolving data streams.
- Mining Frequent Closed Unordered Trees Through Natural Representations
- A new algorithm for fast mining frequent itemsets using N-lists
- Algorithm 457
- FANMOD
- COBBLER
- Carpenter
- CLOSET
- Three-objective subgraph mining using multiobjective evolutionary programming
- CMAR
- MDL4BMF
- Krimp
- Improving constrained pattern mining with first-fail-based heuristics
- Mining spatial colocation patterns: a different framework
- 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
- REPuter
This page was built for software: gSpan
