ADtrees for Fast Counting and for Fast Learning of Association Rules. - Brigham S. Anderson; Andrew W. Moore 001 (KDD, 1998)

The interaction of size and density with graph-level indices. - Brigham S. Anderson; Carter T. Butts; Kathleen M. Carley (Soc. Networks, 1999)

A Nonparametric Approach to Noisy and Costly Optimization. - Brigham S. Anderson; Andrew W. Moore 001; David Cohn (ICML, 2000)

Fast nonlinear regression via eigenimages applied to galactic morphology. - Brigham S. Anderson; Andrew W. Moore 001; Andrew J. Connolly; Robert Nichol (KDD, 2004)

Active learning for Hidden Markov Models: objective functions and algorithms. - Brigham S. Anderson; Andrew Moore (ICML, 2005)

Fast Information Value for Graphical Models. - Brigham S. Anderson; Andrew W. Moore 001 (NIPS, 2005)

The Effect of Model Granularity on Student Performance Prediction Using Bayesian Networks. - Zachary A. Pardos; Neil T. Heffernan; Brigham S. Anderson; Cristina Linquist-Heffernan (User Modeling, 2007)