swMATH11908MaRDI QIDQ23844FDOQ23844
Author name not available (Why is that?)
Official website: http://www.cs.ucsb.edu/~xyan/software/gSpan.htm
Cited In (only showing first 100 items - show all)
- Three-objective subgraph mining using multiobjective evolutionary programming
- XRules: an effective algorithm for structural classification of XML data
- Concept Lattices
- Mining frequent trajectory patterns in spatial-temporal databases
- Generalized median graphs and applications
- DMTL
- CrossMine
- SPADE
- HAPLO
- AFGen
- approxBlackhole
- gBlackhole
- SPRINT
- MFinder
- TreeTagger
- SuLQ
- SLIQ
- BigML
- ANF
- Neo4J
- SPOOK
- Xproj
- ABACUS: frequent pattern mining-based community discovery in multidimensional networks
- 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
- Support measures for graph data
- ACME
- COOMA
- GeneWise
- Graemlin
- AnyDBC
- Kavosh
- MAVisto
- MotifClick
- MultiPhyl
- NeMoFinder
- ParaMEME
- ParaKMeans
- pCLUSTAL
- REPuter
- EXPANDER
- WebGraph
- treex
- MoTeX
- MotifMiner
- kLog: a language for logical and relational learning with kernels
- CloseGraph
- CloSpan
- ROCK
- Eclat
- NMEEF-SD
- SIAS-miner
- BIDE
- Apriori
- LCM
- MoSS
- XRules
- OddBall
- Mining preserving structures in a graph sequence
- Constraint-Based Mining and Inductive Databases
- Interesting pattern mining in multi-relational data
- gBoost
- A new algorithm for fast mining frequent itemsets using N-lists
- HPStream
- Multi-way set enumeration in weight tensors
- Fitting pattern structures to knowledge discovery in big data
- Mining blackhole and volcano patterns in directed graphs: a general approach
- gBoost: a mathematical programming approach to graph classification and regression
- The graph matching problem
- \textit{RuleMerger}: automatic construction of variability-based model transformation rules
- 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
This page was built for software: gSpan
