We describe a novel pipeline to automatically discover hierarchies of repeated sections in musical audio. The proposed method uses similarity network fusion (SNF) to combine different frame-level features into clean affinity matrices, which are then used as input to spectral clustering. While prior spectral clustering approaches to music structure analysis have pre-processed affinity matrices with heuristics specifically designed for this task, we show that the SNF approach directly yields segmentations which agree better with human annotators, as measured by the L-measure'' metric for hierarchical annotations. Furthermore, the SNF approach immediately supports arbitrarily many input features, allowing us to simultaneously discover structure encoded in timbral, harmonic, and rhythmic representations without any changes to the base algorithm.
 Metric learning is a fundamental problem in computer vision. Different features and algorithms may tackle a problem from different angles, and thus often provide complementary information. In this paper, we propose a fusion algorithm which outputs enhanced metrics by combining multiple given metrics (similarity measures). Unlike traditional co-training style algorithms where multi-view features or multiple data subsets are used for classification or regression, we focus on fusing multiple given metrics through diffusion process in an unsupervised way. Our algorithm has its particular advantage when the input similarity matrices are the outputs from diverse algorithms. We provide both theoretical and empirical explanations to our method. Significant improvements over the state-of-the-art results have been observed on various benchmark datasets. For example, we have achieved 100 accuracy (no longer the bull's eye measure) on the MPEG-7 shape dataset. Our method has a wide range of applications in machine learning and computer vision.  Abstract Similarity networks contain important topological features and patterns critical to understanding interactions among samples in a large dataset. To create a comprehensive view of the interactions within a dataset, the Similarity Network Fusion (SNF) technique has been proposed to fuse the similarity networks based on different data types into one similarity network that represents the full spectrum of underlying data. In this paper, a modified version of SNF, which is named as Contextual Information based SNF (CI-SNF), is proposed. In CI-SNF, first, modified Jaccard distance is performed on the SNF fused similarity to utilize the contextual information contained in the fused similarity network. Second, the local consistency of samples from the same category is enhanced by speculating that the samples which are located high in the Jaccard distance based ranking list of a specific query are from the same category as the query. Third, the inverted index technique is introduced to utilize the sparsity property of the locally consistent similarity network to enhance the computational efficiency. To verify the effectiveness and efficiency of CI-SNF model, it is applied in four different tasks, Cover Song Identification (CSI), image classification, cancer subtype identification, and drug taxonomy, respectively. Extensive experiments on thirteen challenging datasets demonstrate that CI-SNF scheme outperforms state-of-the-art similarity fusion algorithms including SNF in all four tasks. It is also verified that utilizing the contextual information contained in the SNF-based similarity network helps to enhance the performance of the SNF-based scheme, further. Cover Song Identification (CSI) technique, refers to the process of identifying an alternative version, performance, rendition, or recording of a previously recorded musical composition by measuring and modeling the musical similarity between them quantitatively and objectively. However, it is not possible to describe the similarity between tracks comprehensively and reliably with only one similarity function. In this paper, the Similarity Network Fusion (SNF) technique, which was originally proposed for combining different kernels for predicting drug-target interactions, is adopted to fuse different similarities based on the same descriptor and different similarity functions. First, the Harmonic Pitch Class Profile (HPCP) is extracted from each track. Next, the similarities, in terms of Qmax and Dmax measures, between the HPCP descriptors of any two tracks are calculated, respectively. Then, the track-by-track similarity networks based on Qmax and on Dmax similarity are constructed separately and then fused into one network by SNF. Finally, the fused similarities obtained from the fused similarity network are adopted to train a classifier, which can then be used to identify whether the input two tracks belong to reference cover or reference non-cover pair. Experimental results on Covers80 (http: labrosa.ee.columbia.edu projects coversongs covers80 ), subset of SecondHandSongs (SHS) (http: labrosa.ee.columbia.edu millionsong secondhand), and the Mixed Collection and Mazurka Cover Collection provided by MIREX (http: www.music-ir.org mirex wiki 2016:Audio_Cover_Song_Identification) demonstrate that the proposed scheme performs comparably with or even better than state-of-the-art CSI schemes. Similarity network fusion (SNF) is an approach to integrate multiple data types on the basis of similarity between biological samples rather than individual measurements. The authors demonstrate SNF by constructing patient networks to identify disease subtypes with differential survival profiles.