Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 4
Encontrada(s) 1 página(s)

Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Characterization and exploitation of community structure in cover song networks

  • Serrà Julià, Joan
  • Zanin, Massimiliano
  • Herrera Boyer, Perfecto, 1964-
  • Serra, Xavier
The use of community detection algorithms is explored within the framework of cover song identification, i.e. the automatic detection of different audio renditions of the same underlying musical piece. Until now, this task has been posed as a typical query-by-example task, where one submits a query song and the system retrieves a list of possible matches ranked by their similarity to the query. In this work, we propose a new approach which uses song communities (clusters, groups) to provide more relevant answers to a given query. Starting from the output of a state-of-the-art system, songs are embedded in a complex weighted network whose links represent similarity (related musical content). Communities inside the network are then recognized as groups of covers and this information is used to enhance the results of the system. In particular, we show that this approach increases both the coherence and the accuracy of the system. Furthermore, we provide insight into the internal organization of individual cover song communities, showing that there is a tendency for the original song to be central within the community. We postulate that the methods and results presented here could be relevant to other query-by-example tasks., This work has been supported by the following projects: Classical Planet (TSI-070100–2009-407; MITYC) and DRIMS (TIN2009–14247-C02–01; MICINN).
Repositorio Digital de la UPF
Publicación Contribución de congreso (ConferenceOutput)

Music retagging using label propagation and robust principal component analysis

  • Yang, Yi-Hsuan
  • Bogdanov, Dmitry
  • Herrera Boyer, Perfecto, 1964-
  • Sordo, Mohamed
Comunicació presentada a: WWW'12 Companion: The 21st International Conference on World Wide Web celebrat del 16 al 20 d'abril de 2012 a Lió, França., The emergence of social tagging websites such as Last.fm has provided new opportunities for learning computational models that automatically tag music. Researchers typically obtain music tags from the Internet and use them to construct machine learning models. Nevertheless, such tags are usually noisy and sparse. In this paper, we present a preliminary study that aims at refining (retagging) social tags by exploiting the content similarity between tracks and the semantic redundancy of the track-tag matrix. The evaluated algorithms include a graph-based label propagation method that is often used in semi-supervised learning and a robust principal component analysis (PCA) algorithm that has led to state-of-the-art results in matrix completion. The results indicate that robust PCA with content similarity constraint is particularly effective; it improves the robustness of tagging against three types of synthetic errors and boosts the recall rate of music auto-tagging by 7% in a real-world setting., This work was supported by a grant from the National Science Council of Taiwan under contract NSC 100-2218-E001-009 and partially supported by the following projects: Classical Planet: TSI-070100-2009-407 (MITYC), DRIMS: TIN2009-14247-C02-01 (MICINN) and MIRES: EC-FP7 ICT2011.1.5 Networked Media and Search Systems, grant agreement No. 287711.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Music retagging using label propagation and robust principal component analysis

  • Yang, Yi-Hsuan
  • Bogdanov, Dmitry
  • Herrera Boyer, Perfecto, 1964-
  • Sordo, Mohamed
Comunicació presentada a: WWW'12 Companion: The 21st International Conference on World Wide Web celebrat del 16 al 20 d'abril de 2012 a Lió, França., The emergence of social tagging websites such as Last.fm has provided new opportunities for learning computational models that automatically tag music. Researchers typically obtain music tags from the Internet and use them to construct machine learning models. Nevertheless, such tags are usually noisy and sparse. In this paper, we present a preliminary study that aims at refining (retagging) social tags by exploiting the content similarity between tracks and the semantic redundancy of the track-tag matrix. The evaluated algorithms include a graph-based label propagation method that is often used in semi-supervised learning and a robust principal component analysis (PCA) algorithm that has led to state-of-the-art results in matrix completion. The results indicate that robust PCA with content similarity constraint is particularly effective; it improves the robustness of tagging against three types of synthetic errors and boosts the recall rate of music auto-tagging by 7% in a real-world setting., This work was supported by a grant from the National Science Council of Taiwan under contract NSC 100-2218-E001-009 and partially supported by the following projects: Classical Planet: TSI-070100-2009-407 (MITYC), DRIMS: TIN2009-14247-C02-01 (MICINN) and MIRES: EC-FP7 ICT2011.1.5 Networked Media and Search Systems, grant agreement No. 287711.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Characterization and exploitation of community structure in cover song networks

  • Serrà Julià, Joan
  • Zanin, Massimiliano
  • Herrera Boyer, Perfecto, 1964-
  • Serra, Xavier
The use of community detection algorithms is explored within the framework of cover song identification, i.e. the automatic detection of different audio renditions of the same underlying musical piece. Until now, this task has been posed as a typical query-by-example task, where one submits a query song and the system retrieves a list of possible matches ranked by their similarity to the query. In this work, we propose a new approach which uses song communities (clusters, groups) to provide more relevant answers to a given query. Starting from the output of a state-of-the-art system, songs are embedded in a complex weighted network whose links represent similarity (related musical content). Communities inside the network are then recognized as groups of covers and this information is used to enhance the results of the system. In particular, we show that this approach increases both the coherence and the accuracy of the system. Furthermore, we provide insight into the internal organization of individual cover song communities, showing that there is a tendency for the original song to be central within the community. We postulate that the methods and results presented here could be relevant to other query-by-example tasks., This work has been supported by the following projects: Classical Planet (TSI-070100–2009-407; MITYC) and DRIMS (TIN2009–14247-C02–01; MICINN).