Open Access
June 2010 High-throughput data analysis in behavior genetics
Anat Sakov, Ilan Golani, Dina Lipkind, Yoav Benjamini
Ann. Appl. Stat. 4(2): 743-763 (June 2010). DOI: 10.1214/09-AOAS304


In recent years, a growing need has arisen in different fields for the development of computational systems for automated analysis of large amounts of data (high-throughput). Dealing with nonstandard noise structure and outliers, that could have been detected and corrected in manual analysis, must now be built into the system with the aid of robust methods. We discuss such problems and present insights and solutions in the context of behavior genetics, where data consists of a time series of locations of a mouse in a circular arena. In order to estimate the location, velocity and acceleration of the mouse, and identify stops, we use a nonstandard mix of robust and resistant methods: LOWESS and repeated running median. In addition, we argue that protection against small deviations from experimental protocols can be handled automatically using statistical methods. In our case, it is of biological interest to measure a rodent’s distance from the arena’s wall, but this measure is corrupted if the arena is not a perfect circle, as required in the protocol. The problem is addressed by estimating robustly the actual boundary of the arena and its center using a nonparametric regression quantile of the behavioral data, with the aid of a fast algorithm developed for that purpose.


Download Citation

Anat Sakov. Ilan Golani. Dina Lipkind. Yoav Benjamini. "High-throughput data analysis in behavior genetics." Ann. Appl. Stat. 4 (2) 743 - 763, June 2010.


Published: June 2010
First available in Project Euclid: 3 August 2010

zbMATH: 1194.62120
MathSciNet: MR2758419
Digital Object Identifier: 10.1214/09-AOAS304

Keywords: behavior genetics , boundary estimation , center estimation , LOWESS , Outliers , path data , regression quantile , robustness , running median

Rights: Copyright © 2010 Institute of Mathematical Statistics

Vol.4 • No. 2 • June 2010
Back to Top