ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2006.13642
  4. Cited By
Online Dense Subgraph Discovery via Blurred-Graph Feedback

Online Dense Subgraph Discovery via Blurred-Graph Feedback

24 June 2020
Yuko Kuroki
Atsushi Miyauchi
Junya Honda
Masashi Sugiyama
ArXiv (abs)PDFHTML

Papers citing "Online Dense Subgraph Discovery via Blurred-Graph Feedback"

6 / 6 papers shown
Title
Query-Efficient Correlation Clustering with Noisy Oracle
Query-Efficient Correlation Clustering with Noisy Oracle
Yuko Kuroki
Atsushi Miyauchi
Francesco Bonchi
Wei Chen
66
2
0
02 Feb 2024
A Survey on the Densest Subgraph Problem and Its Variants
A Survey on the Densest Subgraph Problem and Its Variants
Tommaso Lanciano
Atsushi Miyauchi
Adriano Fazzone
Francesco Bonchi
72
43
0
25 Mar 2023
Combinatorial Pure Exploration with Bottleneck Reward Function
Combinatorial Pure Exploration with Bottleneck Reward Function
Yihan Du
Yuko Kuroki
Wei Chen
63
6
0
24 Feb 2021
Combinatorial Pure Exploration with Full-bandit Feedback and Beyond:
  Solving Combinatorial Optimization under Uncertainty with Limited Observation
Combinatorial Pure Exploration with Full-bandit Feedback and Beyond: Solving Combinatorial Optimization under Uncertainty with Limited Observation
Yuko Kuroki
Junya Honda
Masashi Sugiyama
OffRL
52
1
0
31 Dec 2020
Subgraph Neural Networks
Subgraph Neural Networks
Emily Alsentzer
S. G. Finlayson
Michelle M. Li
Marinka Zitnik
GNN
150
139
0
18 Jun 2020
Combinatorial Pure Exploration with Full-Bandit or Partial Linear
  Feedback
Combinatorial Pure Exploration with Full-Bandit or Partial Linear Feedback
Yihan Du
Yuko Kuroki
Wei Chen
OffRL
31
4
0
14 Jun 2020
1