Co-occurring keywords · papers mentioning both
Papers
Enhancing User Safety: Context-Aware Detection of Offensive Query-Ad Pairs in Multimodal Search Advertising
EACL 2026
Densest k-Subgraph Mining via a Provably Tight Relaxation
AAAI 2025
SLRL: Semi-Supervised Local Community Detection Based on Reinforcement Learning
AAAI 2025
Efficient Correlated Subgraph Searches for AI-powered Drug Discovery
IJCAI 2024
Is Your Large Language Model Knowledgeable or a Choices-Only Cheater?
ACL 2024
Optimal Quasi-clique: Hardness, Equivalence with Densest-k-Subgraph, and Quasi-partitioned Community Mining
AAAI 2024
PyGOD: A Python Library for Graph Outlier Detection
JMLR 2024
UGC: Universal Graph Coarsening
NeurIPS 2024
Distributed Community Detection in Large Networks
JMLR 2023
Exact recovery and Bregman hard clustering of node-attributed Stochastic Block Model
NeurIPS 2023
Accelerating COVID-19 Research with Graph Mining and Transformer-Based Learning
AAAI 2022
Efficient Attribute (α,β)-Core Detection in Large Bipartite Graphs (Student Abstract)
AAAI 2022
Adversarial Directed Graph Embedding
AAAI 2021
A New Upper Bound Based on Vertex Partitioning for the Maximum K-plex Problem
IJCAI 2021
Differentially Private Densest Subgraph Detection
ICML 2021
Hybrid-order Stochastic Block Model
AAAI 2021
Midas: Microcluster-Based Detector of Anomalies in Edge Streams
AAAI 2020
Mining Topological Structure in Graphs through Forest Representations
JMLR 2020
MixedAD: A Scalable Algorithm for Detecting Mixed Anomalies in Attributed Graphs
AAAI 2020
Online Dense Subgraph Discovery via Blurred-Graph Feedback
ICML 2020
Pivot-based Maximal Biclique Enumeration
IJCAI 2020
Sequential Motif Profiles and Topological Plots for Offline Signature Verification
CVPR 2020
TellTail: Fast Scoring and Detection of Dense Subgraphs
AAAI 2020
Distributed PageRank Computation: An Improved Theoretical Study
AAAI 2019
Fine-Grained Search Space Classification for Hard Enumeration Variants of Subset Problems
AAAI 2019