CloseGraph
From MaRDI portal
Cited in
(48)- DMTL
- PlanMine
- SPADE
- LOGML
- Performance evaluation of frequent subgraph discovery techniques
- Mining frequent closed rooted trees
- TreeTagger
- Counting frequent patterns in large labeled graphs: a hypergraph-based approach
- Mining closed patterns in relational, graph and network data
- Graph-FCA: an extension of formal concept analysis to knowledge graphs
- gSpan
- ANF
- Nearly exact mining of frequent trees in large networks
- The graph matching problem
- Xproj
- XRules: an effective algorithm for structural classification of XML data
- Computational aspects of mining maximal frequent patterns
- TALE
- Knowledge graphs completion via probabilistic reasoning
- ParMol
- Fg-index
- GString
- SAGA
- PrefixSpan
- COBBLER
- Carpenter
- CLOSET
- CMAR
- Efficiently mining \(\delta \)-tolerance closed frequent subgraphs
- Efficient mining for structurally diverse subgraph patterns in large molecular databases
- MotifMiner
- ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns
- A framework for clustering massive graph streams
- Warmr
- Arbor3D
- TreeDT
- RadCon
- CloSpan
- ROCK
- NMEEF-SD
- BIDE
- XRules
- MoSS
- Efficient algorithms for supergraph query processing on graph databases
- Data mining in bioinformatics
- Interesting pattern mining in multi-relational data
- Optimal schema hierarchies in searching semistructured databases by conjunctive regular path queries
- An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
This page was built for software: CloseGraph
