Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

New approach for similarity #1

Closed
mkb218 opened this issue Apr 23, 2012 · 2 comments
Closed

New approach for similarity #1

mkb218 opened this issue Apr 23, 2012 · 2 comments
Assignees
Labels
Milestone

Comments

@mkb218
Copy link
Owner

mkb218 commented Apr 23, 2012

Right now, for each root segment in the analysis of the target track, we re-sort the set of all segments by the root. This gets ridiculously slow once the library has about 5 tracks.

One approach to make the search space smaller is this:
Pick a few attributes and thresholds. These can be static or dynamic based on the root (three largest pitch or timbre members, let's say). We filter the search space before sorting, by these criteria

As the number of segments grows, the thresholds get tighter.

@ghost ghost assigned mkb218 Apr 23, 2012
@mkb218
Copy link
Owner Author

mkb218 commented Apr 25, 2012

Bucketing doesn't work well. Need something different.

@mkb218
Copy link
Owner Author

mkb218 commented Apr 26, 2012

This sounds like a job for mapreduce. that puts this to 2.0

@mkb218 mkb218 closed this as completed in f9c0f00 Apr 27, 2012
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

No branches or pull requests

1 participant