Discovering Non‑Redundant K‑means Clusterings in Optimal Subspaces thumbnail
Pause
Mute
Subtitles not available
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Discovering Non‑Redundant K‑means Clusterings in Optimal Subspaces

Published on Nov 23, 2018474 Views

A huge object collection in high-dimensional space can often be clustered in more than one way, for instance, objects could be clustered by their shape or alternatively by their color. Each grouping r

Related categories