The following pages link to gSpan (Q23844):
Displaying 50 items.
- Mining preserving structures in a graph sequence (Q344786) (← links)
- A new algorithm for fast mining frequent itemsets using N-lists (Q362278) (← links)
- Three-objective subgraph mining using multiobjective evolutionary programming (Q394981) (← links)
- Improving constrained pattern mining with first-fail-based heuristics (Q408638) (← links)
- Mining spatial colocation patterns: a different framework (Q408691) (← links)
- Multi-way set enumeration in weight tensors (Q413829) (← links)
- Efficiently mining \(\delta \)-tolerance closed frequent subgraphs (Q413834) (← links)
- Effective feature construction by maximum common subgraph sampling (Q413859) (← links)
- Efficient mining for structurally diverse subgraph patterns in large molecular databases (Q413872) (← links)
- kLog: a language for logical and relational learning with kernels (Q464624) (← links)
- Data mining of social networks represented as graphs (Q465703) (← links)
- Finding relational redescriptions (Q479473) (← links)
- Learning an efficient constructive sampler for graphs (Q511780) (← links)
- Probabilistic SimRank computation over uncertain graphs (Q527175) (← links)
- Distributed and sequential algorithms for bioinformatics (Q530299) (← links)
- Efficient algorithms for supergraph query processing on graph databases (Q630186) (← links)
- Variability-based model transformation: formal foundation and application (Q682373) (← links)
- Data mining in bioinformatics (Q704866) (← links)
- \textsc{Para}\textsc{Miner}: a generic pattern mining algorithm for multi-core architectures (Q740594) (← links)
- Interesting pattern mining in multi-relational data (Q740605) (← links)
- Optimal schema hierarchies in searching semistructured databases by conjunctive regular path queries (Q885856) (← links)
- Distributed discovery of frequent subgraphs of a network using MapReduce (Q889838) (← links)
- Set-based approximate approach for lossless graph summarization (Q904121) (← links)
- An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence (Q996827) (← links)
- Mining interesting patterns from uncertain databases (Q1615722) (← links)
- Finding the best not the most: regularized loss minimization subgraph selection for graph classification (Q1669622) (← links)
- Efficient subgraph matching using topological node feature constraints (Q1677053) (← links)
- Performance evaluation of frequent subgraph discovery techniques (Q1719279) (← links)
- A distributed approach for graph mining in massive networks (Q1741266) (← 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)
- Formal methods for mining structured objects (Q1946770) (← links)
- Learning block-preserving graph patterns and its application to data mining (Q1959502) (← links)
- Mining frequent closed rooted trees (Q1959538) (← links)
- gBoost: a mathematical programming approach to graph classification and regression (Q1959643) (← links)
- Distance metric learning for graph structured data (Q2071320) (← links)
- Enumeration of support-closed subsets in confluent systems (Q2134743) (← links)
- Counting frequent patterns in large labeled graphs: a hypergraph-based approach (Q2194034) (← links)
- Mining frequent subgraphs in multigraphs (Q2195360) (← links)
- Mining closed patterns in relational, graph and network data (Q2248524) (← links)
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (Q2248525) (← links)
- Generalized median graphs and applications (Q2271138) (← links)
- Graph-FCA: an extension of formal concept analysis to knowledge graphs (Q2286389) (← links)
- Disk-based shortest path discovery using distance index over large dynamic graphs (Q2292955) (← links)
- Knowledge representation analysis of graph mining (Q2317967) (← links)
- Speeding-up structured probabilistic inference using pattern mining (Q2353925) (← links)
- Mining frequent trajectory patterns in spatial-temporal databases (Q2390345) (← links)
- ABACUS: frequent pattern mining-based community discovery in multidimensional networks (Q2435685) (← links)
- Nearly exact mining of frequent trees in large networks (Q2435702) (← links)
- G-Tries: a data structure for storing and finding subgraphs (Q2435716) (← links)
