Online Dense Subgraph Discovery via Blurred-Graph Feedback

06/24/2020
by   Yuko Kuroki, et al.
0

Dense subgraph discovery aims to find a dense component in edge-weighted graphs. This is a fundamental graph-mining task with a variety of applications and thus has received much attention recently. Although most existing methods assume that each individual edge weight is easily obtained, such an assumption is not necessarily valid in practice. In this paper, we introduce a novel learning problem for dense subgraph discovery in which a learner queries edge subsets rather than only single edges and observes a noisy sum of edge weights in a queried subset. For this problem, we first propose a polynomial-time algorithm that obtains a nearly-optimal solution with high probability. Moreover, to deal with large-sized graphs, we design a more scalable algorithm with a theoretical guarantee. Computational experiments using real-world graphs demonstrate the effectiveness of our algorithms.

READ FULL TEXT
research
09/13/2018

Robust Densest Subgraph Discovery

Dense subgraph discovery is an important primitive in graph mining, whic...
research
11/07/2022

Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks

Network analysis has played a key role in knowledge discovery and data m...
research
06/01/2019

Fast Algorithm for K-Truss Discovery on Public-Private Graphs

In public-private graphs, users share one public graph and have their ow...
research
04/17/2019

Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries

In the densest subgraph problem, given a weighted undirected graph G(V,E...
research
10/02/2021

Random Subgraph Detection Using Queries

The planted densest subgraph detection problem refers to the task of tes...
research
07/29/2023

Fast Searching The Densest Subgraph And Decomposition With Local Optimality

Densest Subgraph Problem (DSP) is an important primitive problem with a ...
research
02/27/2021

Parallel Algorithms for Densest Subgraph Discovery Using Shared Memory Model

The problem of finding dense components of a graph is a widely explored ...

Please sign up or login with your details

Forgot password? Click here to reset