2024-03-29T06:26:47Zhttps://eprints.lib.hokudai.ac.jp/dspace-oai/requestoai:eprints.lib.hokudai.ac.jp:2115/398292022-11-17T02:08:08Zhdl_2115_39595hdl_2115_39594hdl_2115_33096Efficient Repeating Segments Discovery in Music using Adaptive Motif Generation AlgorithmWang, LeiChng, Eng SiongLi, Haizhouopen access548APSIPA ASC 2009: Asia-Pacific Signal and Information Processing Association, 2009 Annual Summit and Conference. 4-7 October 2009. Sapporo, Japan. Oral session: Multimedia Analysis and Processing (7 October 2009).This paper introduces an efficient unsupervised algorithm to discover motifs in multivariate data sequence. Specifically, we apply our proposed work to detect repeating segments on music feature vectors. The proposed algorithm, namely Adaptive Motif Generation, scans the music features online to construct a list of repeating candidate segments in linear time. The candidate list is then used to populate a sparse self-similarity matrix for further processing to generate the final selections. The experimental results showed that the proposed approach was able to obtain similar average F1 score compared to the traditional self-similarity approach with significant reduction in computational cost and memory usage.Asia-Pacific Signal and Information Processing Association, 2009 Annual Summit and Conference, International Organizing Committee2009-10-04engconference paperVoRhttp://hdl.handle.net/2115/39829Proceedings : APSIPA ASC 2009 : Asia-Pacific Signal and Information Processing Association, 2009 Annual Summit and Conference895903APSIPA ASC 2009: Asia-Pacific Signal and Information Processing Association, 2009 Annual Summit and Conference2009年アジア太平洋信号情報処理連合学会アニュアルサミット・国際会議SapporoJPNhttps://eprints.lib.hokudai.ac.jp/dspace/bitstream/2115/39829/1/WA-L4-2.pdfapplication/pdf302.75 KB2009-10-04