KI-Glossar
Das vollständige Wörterbuch der Künstlichen Intelligenz
Node-link diagram
Standard visual representation where nodes are points and edges are lines connecting these points, preferred for sparse graphs.
Adjacency matrix visualization
Matrix representation where cells indicate connections between nodes, effective for detecting patterns in dense graphs.
Edge bundling
Visual grouping technique of similar edges to reduce clutter and reveal main connection structures in complex graphs.
Hierarchical layout
Layered or tree-like layout that organizes nodes according to hierarchical levels, ideal for directed acyclic graphs.
Graph embedding visualization
Projection of nodes into a low-dimensional vector space where distances preserve the structural relationships of the original graph.
Community detection visualization
Visual highlighting of highly interconnected node clusters using distinct colors or spatial groupings.
Circular layout
Radial layout where nodes are positioned on a circle, optimized to reveal symmetries and cyclic patterns in graphs.
Sankey diagram
Flow visualization where the width of edges represents the intensity or volume of connections between source and destination nodes.
Chord diagram
Circular representation where edges are curves connecting points on the perimeter, effective for visualizing bidirectional relationships.
Graph coloring algorithms
Methods for assigning colors to nodes or edges to visually distinguish properties, minimize conflicts, or reveal patterns.
Dynamic graph visualization
Animated or interactive techniques to represent the temporal evolution of graph structures, including the appearance/disappearance of nodes and edges.
Graph clustering visualization
Visual representation of groups of similar nodes using borders, colors, or spacing to delimit identified clusters.
Interactive graph exploration
User interface allowing navigation, filtering, zooming, and direct manipulation of graph elements for in-depth analysis.
Graph partitioning visualization
Highlighting of graph divisions into disjoint subgraphs to optimize parallel processing or reveal modular structures.
Treemap visualization
Hierarchical representation using nested rectangles whose area is proportional to a metric, suitable for tree-like structures.
Sunburst diagram
Radial visualization of hierarchical data with concentric rings representing successive levels of the structure.