Silla Jr., Carlos N. and Koerich, Alessandro L. and Kaestner, Celso A. A. (2009) A Feature Selection Approach for Automatic Music Genre Classification. International Journal of Semantic Computing, 3 (2). pp. 182-196.
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
In this paper we present an analysis of the suitability of four different feature sets which are currently employed to represent music signals in the context of the automatic music genre classification. To such an aim, feature selection is carried out through genetic algorithms, and it is applied to multiple feature vectors generated from different segments of the music signal. The feature sets used in this paper, which encompass time-domain and frequency-domain characteristics of the music signal, comprise: short-time Fourier transform, Mel frequency cepstral coefficient, beat-related features, pitch-related features, inter-onset interval histogram coefficients, rhythm histograms and statistical spectrum descriptors. The classification is based on the use of multiple feature vectors and an ensemble approach, according to time and space decomposition strategies. Feature vectors are extracted from music segments from the beginning, middle and end parts of the music signal (time-decomposition). Despite music genre classification being a multi-class problem, we accomplish the task using a combination of binary classifiers, whose results are merged to produce the final music genre label (space decomposition). Experiments were carried out on two databases: the Latin Music Database, which contains 3,227 music pieces categorized into ten musical genres; the ISMIR'2004 genre contest database which contains 1,458 music pieces categorized into six popular western musical genres. The experimental results have shown that the feature sets have different importance according to the part of the music signal from where the feature vectors are extracted. Furthermore, the ensemble approach provides better results than the individual segments in most cases. For high-dimensional feature sets, the feature selection provides a compact but discriminative feature subset which has an interesting trade-off between classification accuracy and computational effort.
|Uncontrolled keywords:||determinacy analysis, Craig interpolants|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Computational Intelligence Group|
|Depositing User:||C.N. Silla-Junior|
|Date Deposited:||21 Sep 2012 09:49|
|Last Modified:||21 Sep 2012 09:49|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/30593 (The current URI for this page, for reference purposes)|
- Depositors only (login required):