Spectral Clustering Based on the Graph p-Laplacian thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Spectral Clustering Based on the Graph p-Laplacian

Published on Aug 26, 20096265 Views

We present a generalized version of spectral clustering using the graph p-Laplacian, a nonlinear generalization of the standard graph Laplacian. We show that the second eigenvector of the graph p-

Related categories