• gSpan

  • Referenced in 114 articles [sw11908]
  • gSpan: graph-based substructure pattern mining ... investigate new approaches for frequent graph-based pattern mining in graph datasets and propose ... novel algorithm called gSpan (graph-based substructure pattern mining), which discovers frequent substructures without candidate ... gSpan builds a new lexicographic order among graphs, and maps each graph to a unique...
  • CloseGraph

  • Referenced in 31 articles [sw37017]
  • CloseGraph: mining closed frequent graph patterns. Recent research on pattern discovery has progressed form mining ... exploration, and etc. However, mining large graph patterns in challenging due to the presence ... propose to mine closed frequent graph patterns. A graph g is closed in a database ... same support as g. A closed graph pattern mining algorithm, CloseGraph, is developed by exploring...
  • VIATRA2

  • Referenced in 33 articles [sw03511]
  • provides a rule- and pattern-based transformation language for manipulating graph models by combining graph ... advanced constructs for querying (e.g. recursive graph patterns) and manipulating models (e.g. generic transformation...
  • GraphLog

  • Referenced in 32 articles [sw20098]
  • both data and queries. Queries are graph patterns. Edges in queries represent edges or paths...
  • GrGen

  • Referenced in 21 articles [sw00387]
  • abstraction level of graphs, with declarative pattern matching and rewriting, on a visualization of your...
  • DSJM

  • Referenced in 6 articles [sw12532]
  • exploits the recently proposed unifying framework ”pattern graph” and employs cache-friendly array-based sparse ... data structures. The pattern graph remains invariant for one-sided, two-sided, full column...
  • GVF

  • Referenced in 27 articles [sw07463]
  • Visualization Framework. The Graph Visualization Framework is a set of design patterns and approaches that...
  • Graph transformation benchmarks

  • Referenced in 11 articles [sw04099]
  • several parameter combinations for measurements). Graph transformation provides a pattern and rule based manipulation ... implemented by tool providers. In case of graph transformation benchmarks the sole measurable feature, which ... turn, is the execution time of pattern matching and updating phases. (Note that the time...
  • NetLSD

  • Referenced in 5 articles [sw32341]
  • graphs, adaptive to the scale of graph patterns, and scalable. Unfortunately, these properties have...
  • SVMlight

  • Referenced in 264 articles [sw04076]
  • Machine [Vapnik, 1995] for the problem of pattern recognition, for the problem of regression ... Nearest Neighbor is the Spectral Graph Transducer. SVMlight can also train SVMs with cost models...
  • gBoost

  • Referenced in 8 articles [sw42199]
  • classification and regression. Graph mining methods enumerate frequently appearing subgraph patterns, which can be used ... boosting method (gBoost) that progressively collects informative patterns. Compared to AdaBoost, gBoost can build ... boosting method to graph data, a branch-and-bound pattern search algorithm is developed based...
  • GRAPPA

  • Referenced in 9 articles [sw20931]
  • style semantics for argument graphs. We also introduce a pattern language for specifying acceptance functions...
  • Gephi

  • Referenced in 62 articles [sw12110]
  • people that have to explore and understand graphs. Like Photoshop but for data, the user ... data analysts to make hypothesis, intuitively discover patterns, isolate structure singularities or faults during data...
  • EmptyHeaded

  • Referenced in 3 articles [sw32535]
  • three orders of magnitude on graph pattern queries, PageRank, and Single-Source Shortest Paths (SSSP...
  • Isorropia

  • Referenced in 13 articles [sw10746]
  • called after the matrix (graph) is filled, so the sparsity pattern is known...
  • DGL

  • Referenced in 11 articles [sw33907]
  • implementation of Deep Graph Library (DGL). DGL distills the computational patterns of GNNs into ... operations suitable for extensive parallelization. By advocating graph as the central programming abstraction...
  • Colibri

  • Referenced in 9 articles [sw12043]
  • adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting ... track the low-rank structure as the graph evolves over time, efficiently and within limited...
  • COWS

  • Referenced in 51 articles [sw06955]
  • process calculi, e.g. asynchronous communication, polyadic synchronization, pattern matching, protection, delimited receiving and killing activities ... orchestration constructs, e.g. web services, flow graphs, fault and compensation handlers, and for encoding other...
  • Graph Investigator

  • Referenced in 2 articles [sw26160]
  • quantify inter-graph similarity by embedding graph patterns into low-dimensional space or distance measurement ... feature vectors. The set of available graph descriptors includes over eighty statistical and algebraic measures...
  • GraphScope

  • Referenced in 25 articles [sw20427]
  • designed to operate on large graphs, in a streaming fashion. We demonstrate the efficiency ... cases it produces meaningful time-evolving patterns that agree with human intuition...