EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Noisy Graph Patterns via Ordered Matrices

J. Wulms, W. Meulemans, B. Speckmann

Computer Graphics Forum · 11.06.2026

DOI: 10.1111/cgf.70433 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computer Graphics Forum, online erschienen am 11.06.2026. Verfasst von J. Wulms und 2 weiteren Autor:innen. Die Arbeit nennt 26 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The high‐level structure of a graph is a crucial ingredient for the analysis and visualization of relational data. However, discovering the salient graph patterns that form this structure is notoriously difficult for two reasons. (1) Finding important patterns, such as cliques and bicliques, is computationally hard. (2) Real‐world graphs contain noise, and therefore do not always exhibit patterns in their pure form. Defining meaningful noisy patterns and detecting them efficiently is a currently unsolved challenge. In this paper, we propose to use well‐ordered matrices as a tool to both define and effectively detect noisy patterns. Specifically, we represent a graph as its adjacency matrix and optimally order it using Moran's I. Standard graph patterns (cliques, bicliques, and stars) now translate to rectangular submatrices. Using Moran's I, we define a permitted level of noise for such patterns. A combination of exact algorithms and heuristics allows us to efficiently decompose the matrix into noisy patterns. We also introduce a novel motif simplification that visualizes noisy patterns while explicitly encoding the level of noise. We showcase our techniques on several real‐world data sets.

Zitieren

APA

Wulms, J., Meulemans, W., & Speckmann, B. (2026). Noisy Graph Patterns via Ordered Matrices. Computer Graphics Forum. https://doi.org/10.1111/cgf.70433

Vancouver

Wulms J, Meulemans W, Speckmann B. Noisy Graph Patterns via Ordered Matrices. Computer Graphics Forum. 2026. doi:10.1111/cgf.70433

BibTeX
@article{Wulms2026,
  author = {Wulms, J. and Meulemans, W. and Speckmann, B.},
  title = {Noisy Graph Patterns via Ordered Matrices},
  journal = {Computer Graphics Forum},
  year = {2026},
  doi = {10.1111/cgf.70433}
}
Kostenlos starten →