Graphs, recommendations, and time series · MLD-0488
Graph Laplacian
A matrix encoding graph connectivity through node degrees and adjacency, with several normalized variants.
Original reference page · detailed expansion pending. Original definitions, examples, notes and citations are preserved below. New examples are illustrative, not benchmark results.
Original example
Perform spectral clustering or graph smoothing.
Original caveat
Properties depend on the chosen graph and Laplacian definition.
Context and aliases
Level: Intermediate. Stages: Architecture · Data · Training · Inference.
Tags: ML · DL · Graph ML.
Aliases: None recorded.
Related concepts
Concepts linking here
Original references
- PyTorch Geometric documentation ↗ · Consulted
- scikit-learn User Guide ↗ · Consulted
- statsmodels: time series analysis ↗ · Reference link
- Original reference URL ↗