Using Machine Learning Techniques to Reduce Data Annotation Time

Abstract

Manually annotating large databases in any domain is costly and time-consuming. We present a semi-automatic annotation tool for this purpose that uses Random Forests as bootstrapped classifiers. We describe an application of this tool on a large database of simulated driving data. The tool enables the user to verify automatically generated annotations, rather than annotating from scratch. This tool reduced the amount of time required to annotate one minute of video by a factor of six, down to approximately thirty-five seconds of annotation time per minute of video for a database of simulated driving data. The tool is limited in that its effectiveness is dependent upon the types of data collected, and the statistical boundaries between the different annotations.

Get full access to this article

View all access options for this article.

References

Breiman

(2001). Random forests. Machine Learning, 45(1):5–32.

Cohn

Atlas

Ladner

(1994). Improving generalization with active learning. Machine Learning, 15(2):201–221.

Rabiner

(1989). A tutorial on Hidden Markov Models and selected applications in speech recognition. Proceedings of the IEEE, 77(2):257–286.

Torkkola

Massey

Wood

(2004). Driver inattention detection through intelligent analysis of readily available sensors. In Proceedings of the 7th Annual IEEE Conference on Intelligent Transportation Systems (ITSC 2004), pages 326–331, Washington, D. C., USA.

Torkkola

Massey

Leivian

Wood

Summers

Kundalkar

(2003). Classification of critical driving events. In Proceedings of the International Conference on Machine Learning and Applications (ICMLA), pages 81–85, Los Angeles, CA, USA.

Torkkola

Venkatesan

Liu

(2005). Sensor sequence modeling for driving. In Proceedings of the 18th International FLAIRS Conference, Clearwater Beach, FL, USA, AAAI Press.