User Tools
spectral_clustering_for_pattern_discovery
Table of Contents
Spectral Clustering for Pattern Discovery (The McFee Hack, Part 2)
| Authors | Oriol Nieto, Brian McFee |
| Affiliation | New York University |
| Code | https://github.com/urinieto/laplacian_segmentation |
What
We modified the Spectral Clustering algorithm such that it identifies musical patterns (motives, sections, segments) of a piece.
How
It works like this:
- Obtain segments from a small scale layer (e.g. m > 8) using spectral clustering.
- Filter segments by keeping the repeated ones only (by using the label information).
- Repeat for N layers
- Aggregate patterns, because overlap is allowed in pattern discovery.
Spectral Clustering on Come Together by The Beatles for m layers:
Results
spectral_clustering_for_pattern_discovery.txt ยท Last modified: 2014/10/26 05:19 by urinieto
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 3.0 Unported
