A Song Clustering Method Based on Iterative K-means Algorithm

A clustering method and song technology, applied in the field of data processing, can solve the problems of low accuracy, low efficiency, and inability to search for similarity of songs by manual labeling, and achieve the effect of solving the difficulty of manual classification and solving the problem of accuracy rate disclosure

Active Publication Date: 2021-05-14
UNIV OF ELECTRONICS SCI & TECH OF CHINA
View PDF15 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Traditional search engines are only suitable for searching under the condition that the user has a clear understanding of the target song information, and cannot search based on the similarity of the emotions perceived by the human ear between songs
The traditional method of classifying music by manually setting music tags is inefficient, not suitable for processing massive data, and the accuracy of manual tags is low
Therefore, the music portals in the existing environment lack efficient and accurate methods for classifying massive songs, which makes it impossible for users to quickly and easily find songs that they may be interested in based on the similarity between the rest of the songs and their favorite songs.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A Song Clustering Method Based on Iterative K-means Algorithm
  • A Song Clustering Method Based on Iterative K-means Algorithm
  • A Song Clustering Method Based on Iterative K-means Algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0060] A kind of song clustering method based on iterative k-means algorithm of the present embodiment, such as Figure 1-4 As shown, it specifically includes the following steps:

[0061] Step S1: Extract the Mel-frequency cepstral coefficients of the songs in the music library by time intervals, and obtain the MFCC vectors of each frame of each time period of each song;

[0062] Step S2: Carry out song ID identification on all MFCC vectors in step S1, and compile the song information to which each MFCC vector belongs into a data set;

[0063] Step S3: use the data set in step S2 as the input data to carry out k-means clustering for the first time, obtain the cluster information to which each MFCC vector belongs, and obtain the clustering result of the MFCC vector;

[0064] Step S4: Generate a K-dimensional label vector set corresponding to the song by the ratio of the MFCC vector contained in each song in each cluster; each song has and only one corresponding K-dimensional ...

Embodiment 2

[0068] This embodiment is based on Embodiment 1, and limits the Mel-frequency cepstral coefficient of the song in the music storehouse to be extracted by time division in the step S1 and obtains the 26-dimensional MFCC vector of each frame of each time period of each song, that is, the first time The feature vector of k-means clustering is a 26-dimensional MFCC vector. At the same time, in the step S3, the value of the total number of clusters K of the first k-means clustering is set to 50, that is, 50 MFCC vectors with iconic features in the music library are extracted through the first k-means clustering Represents a vector.

[0069] Based on the above limitations, a song clustering method based on the iterative k-means algorithm in this embodiment specifically includes steps S1-S5.

[0070] Step S1: Extract the Mel-frequency cepstrum coefficients of the songs in the music library by time intervals, and obtain the MFCC vectors of each frame of each time period of each song....

Embodiment 3

[0148] This embodiment is further optimized on the basis of Embodiment 1 and Embodiment 2. The beginning period of the song refers to the beginning of the song for 0-15 seconds, the climax period of the song refers to the beginning of the song climax for 0-20 seconds, and the end period of the song refers to The first 15 seconds of the last 20 seconds of the song.

[0149] That is to say, in the described step S1-1, all songs in the music library are preprocessed, and the beginning (first 15 seconds) of the song is extracted, the climax (the middle 20 seconds), and the ending (the first 15 seconds in the ending 20 seconds) generate three A WAV format file, as a representative part of each song, and carry out song ID identification on it.

[0150] Other parts of this embodiment are the same as those of Embodiment 1 or Embodiment 2, so details are not repeated here.

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a song clustering method based on iterative k-means algorithm, extracts MFCC vectors of songs in a music library as acoustic features, and uses iterative k-means algorithm to perform emotion recognition and emotion classification on songs, specifically including the following Steps: extract the MFCC of the songs in the music library, and obtain the MFCC vector of each song; label all the MFCC vectors with song IDs and collect them into a data set; perform the first k-means clustering on the data set to obtain each MFCC vector Clustering results; generate a K-dimensional label vector set according to the proportion of the MFCC vectors contained in the songs belonging to each cluster; perform the second k-means clustering on all K-dimensional label vector sets to obtain the final song clustering result. The present invention can classify the massive songs in the music library according to the similarity of the emotions perceived by human ears among the songs, so as to recommend similar songs to users according to the emotion classification more accurately and effectively.

Description

technical field [0001] The invention relates to the technical field of data processing, in particular to a song clustering method based on an iterative k-means algorithm. Background technique [0002] In today's Internet era, large music portals have song libraries with massive data. Users often have the need to find songs that are similar to or belong to the same category as their favorite songs. Traditional search engines are only suitable for searching under the condition that the user has a clear understanding of the target song information, and cannot search based on the similarity of the emotions perceived by the human ear between songs. The traditional method of classifying music by manually setting music tags is inefficient, not suitable for processing massive data, and the accuracy of manual tags is low. Therefore, the music portal websites in the existing environment lack efficient and accurate methods for classifying massive songs, resulting in users being unabl...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Patents(China)
IPC IPC(8): G10L25/24G10L25/63G06K9/62
CPCG10L25/24G10L25/63G10H2240/081G06F18/23213
Inventor 戴鑫铉江春华龚超徐若航刘耀方王杰
Owner UNIV OF ELECTRONICS SCI & TECH OF CHINA
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products