Academia.eduAcademia.edu

Random Forests for Laughter Detection

In this study, we investigate several methods on the Interspeech 2013 Paralinguistic Challenge -Social Signals Sub-Challenge dataset. The task of this sub-challenge is to detect laughter and fillers per frame. We apply Random Forests with varying number of trees and randomly selected features. We then proceed with minimum Redundancy Maximum Relevance (mRMR) ranking of features. We employ SVM with linear kernel to form a relative baseline for comparability to baseline provided in the challenge paper. The results indicate the relative superiority of Random Forests to SVMs in terms of subchallenge performance measure, namely UAAUC. We also observe that using mRMR based feature selection, it is possible to reduce the number of features to half with negligible loss of performance. Furthermore, the performance loss due to feature reduction is found to be less in Random Forests compared to SVMs. We also make use of neighboring frames to smooth the posteriors. On the overall, we attain an increase of 5.1% (absolute) in UAAUC in challenge test set.