DocumentCode
2715560
Title
Signal Classification Using Random Forest with Kernels
Author
Cao, Jiguo ; Fan, Guangzhe
Author_Institution
Dept. of Stat. & Actuarial Sci., Simon Fraser Univ., Burnaby, BC, Canada
fYear
2010
fDate
9-15 May 2010
Firstpage
191
Lastpage
195
Abstract
Signal classification is an area of much interests in signal processing. Traditional classification methods designed for discrete variables are limited in its power. Here we propose a novel approach for some signal classification problems. It is a combination of three artificial intelligence approaches: tree-based approach, ensemble voting and kernel learning. We call this approach kernel-induced random forest (KIRF) for signal data. It is novel with respect to KIRF because a new type of kernel suitable for signal data is proposed and applied. We use two examples, a phoneme speech data and a waveform simulation data to illustrate its usage and evidences of improving on traditional methods such as neural networks and discriminant methods. Evidences from the data show that our results are significantly better than those traditional methods for signal classification.
Keywords
learning (artificial intelligence); signal classification; trees (mathematics); artificial intelligence; ensemble voting; kernel learning; kernel-induced random forest; signal classification; signal processing; tree-based approach; Artificial intelligence; Artificial neural networks; Kernel; Linear discriminant analysis; Pattern classification; Signal processing; Smoothing methods; Spline; Statistics; Voting; Functional principal component analysis; Penalized spline smoothing; Phoneme data; Waveform data;
fLanguage
English
Publisher
ieee
Conference_Titel
Telecommunications (AICT), 2010 Sixth Advanced International Conference on
Conference_Location
Barcelona
Print_ISBN
978-1-4244-6748-8
Type
conf
DOI
10.1109/AICT.2010.81
Filename
5489853
Link To Document