<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Affective Feature Extraction for Music Emotion Prediction</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Yang Liu</string-name>
          <email>csygliu@hkbu.edu.hk</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yan Liu</string-name>
          <email>csyliu@comp.polyu.edu.hk</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Zhonglei Gu</string-name>
          <email>allen.koo@aaootech.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>AAOO Tech Limited</institution>
          ,
          <addr-line>Shatin, Hong Kong SAR, P. R.</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Computer</institution>
          ,
          <addr-line>Science</addr-line>
          ,
          <institution>Hong Kong Baptist University</institution>
          ,
          <addr-line>Kowloon Tong, Hong Kong, SAR</addr-line>
          ,
          <country country="CN">P. R. China</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Department of Computing, The Hong Kong Polytechnic, University</institution>
          ,
          <addr-line>Hung Hom, Hong Kong SAR</addr-line>
          ,
          <country country="CN">P. R. China</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2015</year>
      </pub-date>
      <fpage>14</fpage>
      <lpage>15</lpage>
      <abstract>
        <p>In this paper, we describe the methods designed for extracting the a ective features from the given music and predicting the dynamic emotion ratings along the arousal and valence dimensions. The algorithm called Arousal-Valence Similarity Preserving Embedding (AV-SPE) is presented to extract the intrinsic features embedded in music signal that essentially evoke human emotions. A standard support vector regressor is then employed to predict the emotion ratings of the music along the arousal and valence dimensions. The experimental results demonstrate that the performance of the proposed method along the arousal dimension is signi cantly better than the baseline.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>The Emotion in Music task in MediaEval 2015 Workshop
aims to detect the emotional dynamics of music using its
content. Speci cally, given a set of songs, participants are
asked to automatically generate continuous emotional
representations in arousal and valence. More details of the task
as well as the dataset can be found in [1].</p>
      <p>Feature extraction, which aims to discover the intrinsic
factors while capturing essentials of original data according
to some criteria, plays an important role in music emotion
analysis. Some algorithms have been proposed to learn the
genuine correlates of music signal evoking emotional
responses. You et al. presented a multi-label embedded feature
selection (MEFS) method for the task of music emotion
classi cation [12]. Liu et al. introduced an algorithm called
multi-emotion similarity preserving embedding (ME-SPE)
by considering the correlation between di erent music
emotions, and then analyzed the relationship between the
lowdimensional features and the music emotions [6]. In this
paper, we propose a feature extraction algorithm,
arousalvalence similarity preserving embedding (AV-SPE), which
inherits the basic idea from ME-SPE. The di erence is that
the emotion labels in ME-SPE are in the binary form, i.e.,
0 or 1, while those in AV-SPE could be any real number
between [ 1; 1].</p>
      <p>In order to learn the relationship between the feature
space and the dimensional emotion space, which is composed
of the arousal dimension and the valence dimension, many
popular machine learning approaches have already been
employed to train the model, such as k-Nearest Neighbor [11],
Support Vector Regression [9], Boosting [7], Conditional
Random Fields [2], and Gaussian Process [8]. In this task,
we employ the -Support Vector Regression ( -SVR) [10] to
predict the arousal and valence labels of the music.</p>
      <p>In the remaining part, we rst introduce the methods used
for feature extraction and label prediction in Section 2. In
Section 3, we report the evaluation results. Finally, we
conclude the paper in Section 4.
2.
2.1</p>
    </sec>
    <sec id="sec-2">
      <title>METHOD</title>
    </sec>
    <sec id="sec-3">
      <title>Feature Extraction via Arousal-Valence Similarity Preserving Embedding</title>
      <p>In order to discover the intrinsic factors in music signals
that convey or evoke emotions along the arousal and valence
dimensions, we propose a supervised feature extraction
algorithm dubbed AV-SPE to map the original high-dimensional
representations into a low-dimensional feature subspace, in
which we hope that a clearer linkage between the features
and emotions could be discovered.</p>
      <p>
        Let x 2 RD be the high-dimensional feature vector of the
music at a certain time point (in our speci c task, D = 260),
and y = [y(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ); y(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )] be the corresponding emotion label
vector, where y1 and y2 denote the arousal value and valence
value, respectively. The idea behind AV-SPE is simple: if
two pieces of music can convey similar emotions, they should
possess some hidden features in common. Speci cally,
given the training set f(x1; y1); :::; (xn; yn)g, AV-SPE aims to
learn a transformation matrix U = [u1; :::; ud] 2 RD d
which is able to project the original D-dimensional data to
an intrinsically low-dimensional subspace Z = Rd, where the
data with similar emotion labels are close to each other. The
objective function of AV-SPE is formulated as follows:
U = arg min J (U)
      </p>
      <p>U</p>
      <p>n n
= arg min X X kUT xi</p>
      <p>U
i=1 j=1</p>
      <p>UT xjk2 Sij;
where Sij = hy^i; y^ji = hyi=jjyijj; yj=jjyjjji denotes
emotional similarity between xi and xj (i; j = 1; :::; n).</p>
      <p>Following some standard operations in linear algebra, above
optimization problem could be reduced to a trace
minimization problem:</p>
      <p>U = arg min tr(UT XLXT U);</p>
      <p>
        U
where X = [x1; x2; :::; xn] 2 RD n is the data matrix, L =
D S^ is the n n Laplacian matrix [3], D is a diagonal
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
matrix de ned as Dii = Pn ^
      </p>
      <p>
        j=1 Sij (i = 1; :::; n), and tr( )
denotes the matrix trace operator. Obviously, L is positive
semi-de nite and D is positive de nite. By transforming
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) to (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ), the optimal solution can be easily obtained by
employing standard eigendecomposition. Additionally, we
introduce the constraint UT XDXT U = Id to remove the
scaling factor in the learning process, where Id denotes the
ddimensional identity matrix. So for the rst transformation
vector u1, the problem becomes
Letting @L(u1; )=@u1 = 0, the optimal u1 is the
eigenvector corresponding to the smallest non-zero eigenvalue of the
generalized eigendecomposition problem
      </p>
      <p>XLXT u =</p>
      <p>
        XDXT u:
Similarly, u2; :::; ud are the eigenvectors corresponding to
the 2-nd, ..., d-th smallest non-zero eigenvalues of (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ),
respectively.
2.2
      </p>
    </sec>
    <sec id="sec-4">
      <title>Music Emotion Prediction via Support Vector Regression</title>
      <p>
        After feature extraction, we can obtain the reduced
features by zi = UT xi. We then use the reduced features
as the input to predict the emotion labels of the music via
the -Support Vector Regression ( -SVR) [10]. Given the
training set f(z1; y1); :::; (zn; yn)g, where zi is the extracted
feature vector and yi = [yi(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ); yi(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )] is the corresponding label
vector including arousal and valence values. For predicting
the arousal and valence values, i.e., y(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) and yi(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ), we train
i
two regressor separately. The nal optimization problem,
i.e., the dual problem that -SVR aims to solve is:
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
min
;
1
      </p>
      <p>(
2
s:t: eT (
)T K(
) + (y(m))T (
)
) = 0; eT ( +
)</p>
      <p>
        C
(
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
0
i; i
      </p>
      <p>C=n; i = 1; :::; n;
where i; i are the Lagrange multipliers, K is an n n
positive semide nite matrix, in which Kij = K(zi; zj) =
(zi)T (zj) is the kernel function, m = 1 or 2, e = [1; :::; 1]T
is the n-dimensional vector of all ones, and C &gt; 0 is the
regularization parameter. The prediction label of a new coming
vector z is:</p>
      <p>
        n
y = X( i
i=1
i)K(zi; z) + b:
(
        <xref ref-type="bibr" rid="ref7">7</xref>
        )
3.
      </p>
    </sec>
    <sec id="sec-5">
      <title>EVALUATION RESULTS</title>
      <p>In this section, we report the experimental settings and
the evaluation results. The features used in our experiments
are extracted via the openSMILE toolbox [5]. The original
dimension of the feature space, i.e., D, is 260. We set the
reduced dimension d = 10 for AV-SPE. The SVR toolbox
we have used is the LIBSVM [4]. In the training process, we
use the radial basis function (RBF) as the kernel function.
The ten-fold cross-validation is employed to select the best
parameters and C. We nally select = 0:125, C = 2,
and = 0:5 for our model.</p>
      <p>Table 1 and Table 2 list the averaged Root-Mean-Square
Error (RMSE) and the averaged correlation, respectively.
From the tables, we can observe that the arousal result of
SVR and that of AV-SPE + -SVR are signi cantly better
than the baseline. Moreover, the results on the reduced
feature space (d = 10), i.e., the results of AV-SPE +
SVR, are comparable to the results on the original feature
space (D = 260), which indicates that the extracted features
play an important role in representing the music emotions.
4.</p>
    </sec>
    <sec id="sec-6">
      <title>CONCLUSIONS</title>
      <p>In this working notes paper, we have introduced our
system for music emotional dynamics prediction. The system
is composed of a feature extraction algorithm and a support
vector regressor. The evaluation results shown that the
features extracted by the proposed AV-SPE are informative,
and the system worked well in predicting the arousal
values. Our future work will focus on extending the proposed
algorithm by considering the dynamic nature of the music
data.
5.</p>
    </sec>
    <sec id="sec-7">
      <title>ACKNOWLEDGMENTS</title>
      <p>The authors would like to thank the reviewer for the
helpful comments. This work was supported in part by the
National Natural Science Foundation of China under Grants
61373122.
6.</p>
    </sec>
    <sec id="sec-8">
      <title>REFERENCES</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Aljanaki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.-H.</given-names>
            <surname>Yang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Soleymani</surname>
          </string-name>
          .
          <article-title>Emotion in music task at mediaeval 2015</article-title>
          .
          <source>In Working Notes Proceedings of the MediaEval 2015 Workshop</source>
          ,
          <year>September 2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>T.</given-names>
            <surname>Baltrusaitis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Banda</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Robinson</surname>
          </string-name>
          .
          <article-title>Dimensional a ect recognition using continuous conditional random elds</article-title>
          .
          <source>In IEEE Conference on Automatic Face and Gesture Recognition</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Belkin</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Niyogi</surname>
          </string-name>
          .
          <article-title>Laplacian eigenmaps for dimensionality reduction and data representation</article-title>
          .
          <source>Neural Comput.</source>
          ,
          <volume>15</volume>
          (
          <issue>6</issue>
          ):
          <volume>1373</volume>
          {
          <fpage>1396</fpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>C.-C.</given-names>
            <surname>Chang</surname>
          </string-name>
          and
          <string-name>
            <given-names>C.-J.</given-names>
            <surname>Lin</surname>
          </string-name>
          .
          <article-title>LIBSVM: A library for support vector machines</article-title>
          .
          <source>ACM Transactions on Intelligent Systems and Technology</source>
          ,
          <volume>2</volume>
          :
          <issue>27</issue>
          :1{
          <fpage>27</fpage>
          :
          <fpage>27</fpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>F.</given-names>
            <surname>Eyben</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Weninger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Gross</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Schuller</surname>
          </string-name>
          .
          <article-title>Recent developments in opensmile, the munich open-source multimedia feature extractor</article-title>
          .
          <source>In Proc. 21st ACM International Conference on Multimedia</source>
          , pages
          <volume>835</volume>
          {
          <fpage>838</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhao</surname>
          </string-name>
          , and
          <string-name>
            <given-names>K.</given-names>
            <surname>Hua</surname>
          </string-name>
          .
          <article-title>What strikes the strings of your heart? { feature mining for music emotion analysis</article-title>
          .
          <source>IEEE Transactions on A ective Computing</source>
          ,
          <source>PP(99):1{1</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Yang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          .
          <article-title>Boosting for multi-modal music emotion classi cation</article-title>
          .
          <source>In Proc. 11th ISMIR</source>
          , pages
          <volume>105</volume>
          {
          <fpage>110</fpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>K.</given-names>
            <surname>Markov</surname>
          </string-name>
          and
          <string-name>
            <given-names>T.</given-names>
            <surname>Matsui</surname>
          </string-name>
          .
          <article-title>Music genre and emotion recognition using gaussian processes</article-title>
          .
          <source>IEEE Access</source>
          ,
          <volume>2</volume>
          :
          <fpage>688</fpage>
          {
          <fpage>697</fpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>S.</given-names>
            <surname>Rho</surname>
          </string-name>
          , B.-j. Han, and
          <string-name>
            <given-names>E.</given-names>
            <surname>Hwang</surname>
          </string-name>
          .
          <article-title>Svr-based music mood classi cation and context-based music recommendation</article-title>
          .
          <source>In Proc. 17th ACM Multimedia</source>
          , pages
          <volume>713</volume>
          {
          <fpage>716</fpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>B.</given-names>
            <surname>Scho</surname>
          </string-name>
          lkopf,
          <string-name>
            <given-names>A. J.</given-names>
            <surname>Smola</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. C.</given-names>
            <surname>Williamson</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P. L.</given-names>
            <surname>Bartlett</surname>
          </string-name>
          .
          <article-title>New support vector algorithms</article-title>
          .
          <source>Neural Comput.</source>
          ,
          <volume>12</volume>
          (
          <issue>5</issue>
          ):
          <volume>1207</volume>
          {
          <fpage>1245</fpage>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Y.-H.</given-names>
            <surname>Yang</surname>
          </string-name>
          , C.-C. Liu, and
          <string-name>
            <given-names>H. H.</given-names>
            <surname>Chen</surname>
          </string-name>
          .
          <article-title>Music emotion classi cation: A fuzzy approach</article-title>
          .
          <source>In Proc. 14th ACM Multimedia</source>
          , pages
          <volume>81</volume>
          {
          <fpage>84</fpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>M.</given-names>
            <surname>You</surname>
          </string-name>
          , J. Liu, G.-
          <string-name>
            <given-names>Z.</given-names>
            <surname>Li</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Chen</surname>
          </string-name>
          .
          <article-title>Embedded feature selection for multi-label classi cation of music emotions</article-title>
          .
          <source>International Journal of Computational Intelligence Systems</source>
          ,
          <volume>5</volume>
          (
          <issue>4</issue>
          ):
          <volume>668</volume>
          {
          <fpage>678</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>