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