Feature selection in conditional random fields for activity recognition
Authors:
- 1 October 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 32 (21530858) , 3379-3384
Abstract
Temporal classification, such as activity recognition, is a key component for creating intelligent robot systems. In the case of robots, classification algorithms must robustly incorporate complex, non-independent features extracted from streams of sensor data. Conditional random fields are discriminatively trained temporal models that can easily incorporate such features. However, robots have few computational resources to spare for computing a large number of features from high bandwidth sensor data, which creates opportunities for feature selection. Creating models that contain only the most relevant features reduces the computational burden of temporal classification. In this paper, we show that lscr1 regularization is an effective technique for feature selection in conditional random fields. We present results from a multi-robot tag domain with data from both real and simulated robots that compare the classification accuracy of models trained with lscr1 regularization, which simultaneously smoothes the model and selects features; lscr2 regularization, which smoothes to avoid over-fitting, but performs no feature selection; and models trained with no smoothing.Keywords
This publication has 13 references indexed in Scilit:
- L1-Regularization Path Algorithm for Generalized Linear ModelsJournal of the Royal Statistical Society Series B: Statistical Methodology, 2007
- Conditional random fields for activity recognition2007
- Combining discriminative features to infer complex trajectories2006
- Conditional models for contextual human motion recognition2005
- Least angle regressionThe Annals of Statistics, 2004
- Fast and accurate vision-based pattern detection and identification2004
- Shallow parsing with conditional random fields2003
- RoboCup-97: Robot Soccer World Cup I1998
- On the limited memory BFGS method for large scale optimizationMathematical Programming, 1989
- A tutorial on hidden Markov models and selected applications in speech recognitionProceedings of the IEEE, 1989