Using Generic Summarization to Improve Music Information Retrieval Tasks
Francisco Raposo, Ricardo Ribeiro, David Martins de Matos

TL;DR
This paper applies generic text and speech summarization algorithms to music data to create concise, diverse summaries that improve music genre classification performance while maintaining comparable accuracy to full songs.
Contribution
It introduces the novel application of summarization algorithms to music datasets, demonstrating their effectiveness in enhancing MIR tasks under time constraints.
Findings
Summarized datasets improve genre classification performance.
Summaries achieve similar accuracy to full songs.
Algorithms like GRASSHOPPER and LexRank outperform baselines.
Abstract
In order to satisfy processing time constraints, many MIR tasks process only a segment of the whole music signal. This practice may lead to decreasing performance, since the most important information for the tasks may not be in those processed segments. In this paper, we leverage generic summarization algorithms, previously applied to text and speech summarization, to summarize items in music datasets. These algorithms build summaries, that are both concise and diverse, by selecting appropriate segments from the input signal which makes them good candidates to summarize music as well. We evaluate the summarization process on binary and multiclass music genre classification tasks, by comparing the performance obtained using summarized datasets against the performances obtained using continuous segments (which is the traditional method used for addressing the previously mentioned time…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
