Laplacian Matrix for Dimensionality Reduction and Clustering

no code implementations • 18 Sep 2019 • Laurenz Wiskott, Fabian Schönfeld

Many problems in machine learning can be expressed by means of a graph with nodes representing training samples and edges representing the relationship between samples in terms of similarity, temporal proximity, or label information.

Clustering Dimensionality Reduction