3260 papers • 126 benchmarks • 313 datasets
This task has no description! Would you like to contribute one?
(Image credit: Papersgraph)
These leaderboards are used to track progress in graph-mining-5
No benchmarks available.
Use these libraries to find graph-mining-5 models and implementations
No subtasks available.
This paper introduces two types of camouflages based on recent empirical studies, i.e., the feature camouflage and the relation camouflage and proposes a new model named CAmouflage-REsistant GNN (CARE-GNN), to enhance the GNN aggregation process with three unique modules against camouflages.
A comprehensive survey spanning diverse aspects of false information is presented, namely the actors involved in spreading false information, rationale behind successfully deceiving readers, quantifying the impact offalse information, and algorithms developed to detect false information.
This paper investigates if graph embeddings are approximating something analogous to traditional vertex-level graph features, and demonstrates that several topological features are indeed being approximated in the embedding space, allowing key insight into how graph embeds create good representations.
This paper performs a thorough empirical evaluation of four prominent GNN models and suggests that simpler GNN architectures are able to outperform the more sophisticated ones if the hyperparameters and the training procedure are tuned fairly for all models.
Karate Club - a Python framework combining more than 30 state-of-the-art graph mining algorithms that make it easy to identify and represent common graph features, and its efficiency in learning performance on a wide range of real world clustering problems and classification tasks is shown.
A Prolog-based dialog engine that explores interactively a ranked fact database extracted from a text document and reorganizes dependency graphs to focus on the most relevant content elements of a sentence and integrate sentence identifiers as graph nodes is designed.
Descriptive analysis of the social network and node classification experiments illustrate that Twitch Gamers is suitable for assessing the predictive performance of novel proximity-preserving and structural role-based node embedding algorithms.
This survey provides a comprehensive overview of these fusion works to Graph Reinforcement Learning (GRL) as a unified formulation and creates a collection of papers for both interested scholars who want to enter this rapidly developing domain and experts who would like to compare GRL methods.
A novel taxonomy of fairness notions on graphs is proposed, which sheds light on their connections and differences, and an organized summary of existing techniques that promote fairness in graph mining is presented.
This survey is the first one dedicated to fairness for relational data and provides a comprehensive overview of recent contributions in the domain of fair machine learning for graphs, that is classify into pre-processing, in-processing and post-processing models.
Adding a benchmark result helps the community track progress.