Difference between revisions of "Symbolic Melodic Similarity"
(→Description) |
|||
| (One intermediate revision by the same user not shown) | |||
| Line 9: | Line 9: | ||
Each system will be given a query and is asked to | Each system will be given a query and is asked to | ||
return the 10 most melodically similar songs from those taken from | return the 10 most melodically similar songs from those taken from | ||
| − | the Essen Collection (5274 pieces in the MIDI format; see [http://www.esac-data.org ESAC | + | the Essen Collection (5274 pieces in the MIDI format; see [http://www.esac-data.org ESAC Data Homepage] for more information). |
| − | Data Homepage] for more information). For each of the six "base" | + | For each of the six "base" queries, we have created four classes of error-mutations, thus the |
| − | queries, we have created four classes of error-mutations, thus the | ||
query set comprises the following query classes: | query set comprises the following query classes: | ||
| Line 28: | Line 27: | ||
== Participation in previous years == | == Participation in previous years == | ||
| − | {| border="1" | + | {| border="1" cellpadding="5" cellspacing="0" |
|- style="background: yellow" | |- style="background: yellow" | ||
| rowspan="2" | '''Year''' | | rowspan="2" | '''Year''' | ||
Latest revision as of 14:20, 4 June 2010
Description
The goal of SMS is to retrieve the most similar items from a collection of symbolic pieces, given a symbolic query, and rank them by melodic similarity. There will be only 1 task this year which comprises a set of six "base" monophonic MIDI queries to be matched against a monophonic MIDI collection.
Each system will be given a query and is asked to return the 10 most melodically similar songs from those taken from the Essen Collection (5274 pieces in the MIDI format; see ESAC Data Homepage for more information). For each of the six "base" queries, we have created four classes of error-mutations, thus the query set comprises the following query classes:
- No errors (i.e., "base")
- One note deleted
- One note inserted
- One interval enlarged
- One interval compressed
Each system will be asked to return the top ten items for each of the 30 total queries. That is to say, 6(base queries) X 5(versions) = 30 query/candidate lists to be returned.
Participation in previous years
| Year | Participating Algorithms | URL | |
| Task1 | Task2 | ||
| 2007 | 8 | https://www.music-ir.org/mirex/wiki/2007:Symbolic_Melodic_Similarity_Results | |
| 2006 | 8 | 5 | https://www.music-ir.org/mirex/wiki/2006:Symbolic_Melodic_Similarity_Results |
| 2005 | 7 | https://www.music-ir.org/evaluation/mirex-results/sym-melody/index.html | |
