No evaluation results yet. Help compare methods by
submit
evaluation metrics.

We propose GraphMineSuite (GMS): the first benchmarking suite for graph mining that facilitates evaluating and constructing high-performance graph mining algorithms.

This paper proposes for the first time an algorithm PSpan for mining frequent complete subnets from a set of Petri nets.

In this work, we propose Angelica, a single-machine graph pattern mining system aiming at supporting large patterns.

We propose to mine knowledge graphs for identifying biomolecular features that may enable reproducing automatically expert classifications that distinguish drug causative or not for a given type of ADR.

Existing graph mining techniques including both custom graph mining applications and general-purpose graph mining systems, develop efficient execution plans to speed up the exploration of the given query patterns that represent subgraph structures of interest.

For end-to-end efficiency, unlike previous work that assumes random hyperparameter tuning, which over-emphasizes the tuning time, we propose to evaluate with a bandit hyperparameter tuning strategy.

In this work, we formally establish that two recurring characteristics of real-world graphs, namely heavy-tailed degree distributions and large clustering coefficients, imply the existence of substantially large vertex neighborhoods with high edge-density.

These properties of social networks which are known as 5'Vs of big data has led to many unique and enlightenment algorithms and techniques applied to large social networking datasets and data streams.

COMMUNITY DETECTION GRAPH MINING NAMED ENTITY RECOGNITION TRANSFER LEARNING

To capture the directed edges between nodes, existing methods mostly learn two embedding vectors for each node, source vector and target vector.

(3) A near-optimal algorithm for $\epsilon$-uniform graphlet sampling.