Pages that link to "Item:Q1395734"
From MaRDI portal
The following pages link to Complete mining of frequent patterns from graphs: Mining graph data (Q1395734):
Displaying 23 items.
- Mining preserving structures in a graph sequence (Q344786) (← links)
- Mining spatial colocation patterns: a different framework (Q408691) (← links)
- Distributed discovery of frequent subgraphs of a network using MapReduce (Q889838) (← links)
- Graph sampling with applications to estimating the number of pattern embeddings and the parameters of a statistical relational model (Q1741393) (← links)
- Mining blackhole and volcano patterns in directed graphs: a general approach (Q1945010) (← links)
- Learning block-preserving graph patterns and its application to data mining (Q1959502) (← links)
- Graph kernels based on tree patterns for molecules (Q1959635) (← links)
- Counting frequent patterns in large labeled graphs: a hypergraph-based approach (Q2194034) (← links)
- Mining closed patterns in relational, graph and network data (Q2248524) (← links)
- Network classification with applications to brain connectomics (Q2281212) (← links)
- The graph matching problem (Q2444585) (← links)
- Frequency-based views to pattern collections (Q2489656) (← links)
- XRules: an effective algorithm for structural classification of XML data (Q2491362) (← links)
- Support measures for graph data (Q2508500) (← links)
- Computational aspects of mining maximal frequent patterns (Q2508965) (← links)
- Mining patterns from graph traversals (Q2734639) (← links)
- Graph Pattern Analysis with PatternGravisto (Q3378506) (← links)
- Frequent mining of subgraph structures (Q3429325) (← links)
- Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data (Q4932736) (← links)
- ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns (Q4969622) (← links)
- Generating hypotheses about molecular structure–activity relationships (SARs) by solving an optimization problem (Q4969683) (← links)
- COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets (Q5227496) (← links)
- GTED: Graph Traversal Edit Distance (Q5881335) (← links)
