@article {16338,
	title = {Pooled ANOVA},
	journal = {Computational Statistics \& Data Analysis},
	volume = {52},
	year = {2008},
	month = {2008/08/15/},
	pages = {5215 - 5228},
	abstract = {We introduce Pooled ANOVA, a greedy algorithm to sequentially select the rare important factors from a large set of factors. Problems such as computer simulations and software performance tuning involve a large number of factors, few of which have an important effect on the outcome or performance measure. We pool multiple factors together, and test the pool for significance. If the pool has a significant effect we retain the factors for deconfounding. If not, we either declare that none of the factors are important, or retain them for follow-up decoding, depending on our assumptions and stage of testing. The sparser important factors are, the bigger the savings. Pooled ANOVA requires fewer assumptions than other, similar methods (e.g.~sequential bifurcation), such as not requiring all important effects to have the same sign. We demonstrate savings of 25\%-35\% when compared to a conventional ANOVA, and also the ability to work in a setting where Sequential Bifurcation fails.},
	isbn = {0167-9473},
	doi = {16/j.csda.2008.04.024},
	url = {http://www.sciencedirect.com/science/article/pii/S0167947308002168},
	author = {Last,Michael and Luta,Gheorghe and Orso,Alex and Porter, Adam and Young,Stan}
}
