Audio Genre Classification with Semi-Supervised Feature Ensemble Learning

author:Zehra Cataltepe, Istanbul Technical University
published: Oct. 20, 2009,   recorded: September 2009,   views: 33
You might be experiencing some problems with Your Video player.

Related content

Visitors who watched this lecture also watched...
27:46
Stable and Accurate Feature Selection

58 views - Zehra Cataltepe, 2009
02:51:03
Introduction To Bayesian Inference

3197 views - Christopher Bishop, 2009
03:54:31
Support Vector Machines

12708 views - Chih-Jen Lin, 2006
20:01
The Feature Importance Ranking Measure

31 views - Nicole Krämer, 2009
18:46
Label Ranking with Partial Abstention Using Ensemble Learning

103 views - Weiwei Cheng, 2009
03:24:20
Lectures on Clustering

5718 views - Ulrike von Luxburg, 2007
10:50
Ten problems for the next 10 years

1605 views - Pedro Domingos, 2007
02:44:39
From Trees to Forests and Rule Sets - A Unified Overview of Ensemble Methods

1347 views - Giovanni Seni, John Elder, 2007
16:29
Anti-Learning Signature in Biological Classification

77 views - Adam Kowalczyk, 2005
47:38
Statistical Machine Translation

238 views - Roland Kuhn, 2007

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.

Description

Widespread availability and use of music have made automated audio genre classification an important field of research. Thanks to feature extraction systems, not only music data, but also features for them have become readily available. However, handlabeling of a large amount of music data is time consuming. In this study, we introduce a semi-supervised random feature ensemble method for audio classification which uses labeled and unlabeled data together for better genre classification. In order to have diverse subsets of features which are both relevant and non-redundant within themselves, we introduce the Prob-mRMR (Probabilistic minimum Redundancy Maximum Relevance) feature selection algorithm. ProbmRMR is based on mRMR of Ding and Peng 2003 and it selects the features probabilistically according to relevance and redundancy measures. Experimental results show that ensembles of classifiers using Prob-mRMR feature subsets outperform both Co-training and RASCO (Random Subspace Method for Co-training, Wang 2008) which uses random feature subsets.

Link this page  

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: