Discovering bands from graphs
From MaRDI portal
Classification and discrimination; cluster analysis (statistical aspects) (62H30) General nonlinear regression (62J02) Learning and adaptive systems in artificial intelligence (68T05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Abstract: Discovering the underlying structure of a given graph is one of the fundamental goals in graph mining. Given a graph, we can often order vertices in a way that neighboring vertices have a higher probability of being connected to each other. This implies that the edges form a band around the diagonal in the adjacency matrix. Such structure may rise for example if the graph was created over time: each vertex had an active time interval during which the vertex was connected with other active vertices. The goal of this paper is to model this phenomenon. To this end, we formulate an optimization problem: given a graph and an integer , we want to order graph vertices and partition the ordered adjacency matrix into bands such that bands closer to the diagonal are more dense. We measure the goodness of a segmentation using the log-likelihood of a log-linear model, a flexible family of distributions containing many standard distributions. We divide the problem into two subproblems: finding the order and finding the bands. We show that discovering bands can be done in polynomial time with isotonic regression, and we also introduce a heuristic iterative approach. For discovering the order we use Fiedler order accompanied with a simple combinatorial refinement. We demonstrate empirically that our heuristic works well in practice.
Recommendations
- scientific article; zbMATH DE number 3859182
- Bounding the bandwidths for graphs
- Computing the Bandwidth of Interval Graphs
- On finding the minimum bandwidth of interval graphs
- Finding the minimum bandwidth of an interval graph
- scientific article; zbMATH DE number 3974992
- Finding patterns in an unknown graph
- On bandwidth sums of graphs
- scientific article; zbMATH DE number 3963886
- Determining graphs by the complementary spectrum
Cites work
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3681933 (Why is no real title available?)
- A Spectral Algorithm for Seriation and the Consecutive Ones Problem
- An Empirical Distribution Function for Sampling with Incomplete Information
- Least squares isotonic regression in two dimensions
- On the approximation of curves by line segments using dynamic programming
This page was built for publication: Discovering bands from graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q736508)
