gSpan

swMATH11908MaRDI QIDQ23844FDOQ23844

Author name not available (Why is that?)

Official website: http://www.cs.ucsb.edu/~xyan/software/gSpan.htm

Cited In (only showing first 100 items - show all)

• Knowledge representation analysis of graph mining
• Performance evaluation of frequent subgraph discovery techniques
• Variability-based model transformation: formal foundation and application
• Title not available (Why is that?)
• Distributed and sequential algorithms for bioinformatics
• ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns
• Mining frequent subgraphs in multigraphs
• Improving constrained pattern mining with first-fail-based heuristics
• Mining spatial colocation patterns: a different framework
• Algorithm and Experiments in Testing Planar Graphs for Isomorphism
• Mining interesting patterns from uncertain databases
• A distributed approach for graph mining in massive networks
• Graph sampling with applications to estimating the number of pattern embeddings and the parameters of a statistical relational model
• Efficiently mining \(\delta \)-tolerance closed frequent subgraphs
• Effective feature construction by maximum common subgraph sampling
• Efficient mining for structurally diverse subgraph patterns in large molecular databases
• Data mining in bioinformatics
• Learning an efficient constructive sampler for graphs
• Graph-FCA: an extension of formal concept analysis to knowledge graphs
• Effective graph classification based on topological and label attributes
• Knowledge graphs completion via probabilistic reasoning
• FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs
• Transactions on Computational Systems Biology III
• Mining closed patterns in relational, graph and network data
• Enumeration of support-closed subsets in confluent systems
• Discriminative frequent subgraph mining with optimality guarantees
• G-Tries: a data structure for storing and finding subgraphs
• Discovery Science
• Efficiently mining frequent embedded unordered trees
• Finding the best not the most: regularized loss minimization subgraph selection for graph classification
• Summarizing and understanding large graphs
• An efficient approach for mining frequent subgraphs
• OutRank
• Optimal schema hierarchies in searching semistructured databases by conjunctive regular path queries
• Distributed discovery of frequent subgraphs of a network using MapReduce
• Distance metric learning for graph structured data
• Data mining of social networks represented as graphs
• Mining Frequent Closed Unordered Trees Through Natural Representations
• Finding relational redescriptions
• Set-based approximate approach for lossless graph summarization
• Frequency-based views to pattern collections
• Efficient subgraph matching using topological node feature constraints
• Formal methods for mining structured objects
• Disk-based shortest path discovery using distance index over large dynamic graphs
• Inductive Logic Programming
• A framework for clustering massive graph streams
• A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics
• A classification for community discovery methods in complex networks
• Mining discriminative subgraph patterns from structural data
• Learning block-preserving graph patterns and its application to data mining
• Mining frequent closed rooted trees
• Adaptive stream mining: Pattern learning and mining from evolving data streams.
• Counting frequent patterns in large labeled graphs: a hypergraph-based approach
• Efficient algorithms for supergraph query processing on graph databases
• \textsc{Para}\textsc{Miner}: a generic pattern mining algorithm for multi-core architectures
• Inductive Logic Programming
• An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
• Probabilistic SimRank computation over uncertain graphs
• Interactive knowledge discovery from hidden data through sampling of frequent patterns
• A general framework for mining frequent subgraphs from labeled graphs
• A generalized approach for social network integration and analysis with privacy preservation
• Speeding-up structured probabilistic inference using pattern mining
• The hybrid representation model for web document classification
• Hybrid ASP-based approach to pattern mining
• Frequent submap discovery
• Mining weighted subgraphs in a single large graph
• Enumeration of irredundant forests
• Algorithms for context based sequential pattern mining
• Computational aspects of mining maximal frequent patterns
• Analysis of Complex and Heterogeneous Data Using FCA and Monadic Predicates
• Graph-based relational learning with application to security
• Nearly exact mining of frequent trees in large networks
• Three-objective subgraph mining using multiobjective evolutionary programming
• XRules: an effective algorithm for structural classification of XML data
• Concept Lattices
• Mining frequent trajectory patterns in spatial-temporal databases
• Generalized median graphs and applications
• DMTL
• CrossMine
• SPADE
• HAPLO
• AFGen
• approxBlackhole
• gBlackhole
• SPRINT
• MFinder
• TreeTagger
• SuLQ
• SLIQ
• BigML
• ANF
• Neo4J
• SPOOK
• Xproj
• ABACUS: frequent pattern mining-based community discovery in multidimensional networks
• TALE
• ParMol
• GeneSigDB
• PEGASUS
• PowerGraph

This page was built for software: gSpan