Unsupervised active learning method for speech emotion calculation
A technology of emotional computing and active learning, applied in the field of emotional computing, to achieve the effect of wide application range, convenient use, and few restrictions
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1—— 1
[0049] Embodiment 1—one-step optimization
[0050] Such as figure 1 As shown, the method includes the following steps:
[0051] Step S1. Obtain the dimension d=46 of the feature vector of the samples in the VAM data set, set the number of voice samples handed over to experts for marking as M=1, and set the maximum value of the number of iterations c as c max =5, the optimization method is set to the linear manifold method (see later description for details).
[0052] This embodiment preferably c max =5.
[0053] Step S2. Use Principal Component Analysis (PCA) to reduce the dimension of the VAM data set to d=M−1=9 dimensions.
[0054] This is to perform feature processing on the VAM data set so as to implement the linear manifold method. The steps after Embodiment 1 are all calculated based on the VAM data set after dimensionality reduction. m 1 =M=d+1=10.
[0055] Step S3. The number of iterations c is initialized to 1, and the sample set to be marked corresponding to t...
Embodiment 2
[0064] Example 2 - two-step optimization.
[0065] Such as figure 2 As shown, the method includes the following steps:
[0066] Step S1. Obtain the dimension d=46 of the feature vector of the sample in the VAM data set, set the number of speech samples handed over to experts for marking as M=60, and set the maximum value of the number of iterations c as c max = 5, the optimization method of the first step is set to the linear manifold method, the optimization method of the second step is set to the greedy search method (see later description for details), and the first step selects M 1 =d+1=47 samples to be marked, choose M in the second step 2 =M-M 1 = 13 samples.
[0067] The sum of the number of samples to be marked selected in each step must be equal to M, that is, M 1 +M 2 =M.
[0068] Step S2. Start to execute the first step optimization of the algorithm. The number of iterations c is initialized to 1, and the sample set to be marked corresponding to the cth ite...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 

