CloseGraph
From MaRDI portal
Software:52719
No author found.
Related Items (19)
Knowledge graphs completion via probabilistic reasoning ⋮ Optimal schema hierarchies in searching semistructured databases by conjunctive regular path queries ⋮ Counting frequent patterns in large labeled graphs: a hypergraph-based approach ⋮ Efficiently mining \(\delta \)-tolerance closed frequent subgraphs ⋮ Efficient mining for structurally diverse subgraph patterns in large molecular databases ⋮ Efficient algorithms for supergraph query processing on graph databases ⋮ Nearly exact mining of frequent trees in large networks ⋮ Mining frequent closed rooted trees ⋮ The graph matching problem ⋮ Performance evaluation of frequent subgraph discovery techniques ⋮ Mining closed patterns in relational, graph and network data ⋮ Data mining in bioinformatics ⋮ XRules: an effective algorithm for structural classification of XML data ⋮ Computational aspects of mining maximal frequent patterns ⋮ An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence ⋮ Graph-FCA: an extension of formal concept analysis to knowledge graphs ⋮ Interesting pattern mining in multi-relational data ⋮ ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns ⋮ A framework for clustering massive graph streams
This page was built for software: CloseGraph
