Cited in
(only showing first 100 items - show all)- Mining preserving structures in a graph sequence
- kLog: a language for logical and relational learning with kernels
- ABACUS: frequent pattern mining-based community discovery in multidimensional networks
- \textit{RuleMerger}: automatic construction of variability-based model transformation rules
- XRules: an effective algorithm for structural classification of XML data
- A new algorithm for fast mining frequent itemsets using N-lists
- 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
- MAVisto
- MotifClick
- MultiPhyl
- NeMoFinder
- ParaMEME
- ParaKMeans
- pCLUSTAL
- REPuter
- EXPANDER
- WebGraph
- treex
- MoTeX
- MotifMiner
- Mining blackhole and volcano patterns in directed graphs: a general approach
- CloseGraph
- CloSpan
- ROCK
- Concept Lattices
- Eclat
- NMEEF-SD
- SIAS-miner
- BIDE
- Apriori
- LCM
- MoSS
- XRules
- OddBall
- gBoost: a mathematical programming approach to graph classification and regression
- Constraint-Based Mining and Inductive Databases
- gBoost
- Fitting pattern structures to knowledge discovery in big data
- COOMA: a components overlaid mining algorithm for enumerating connected subgraphs with common itemsets
- HPStream
- Interesting pattern mining in multi-relational data
- Generalized median graphs and applications
- The graph matching problem
- Multi-way set enumeration in weight tensors
- Speeding-up structured probabilistic inference using pattern mining
This page was built for software: gSpan
