We present a computational framework to automatically discover high-order temporal social patterns from very noisy and sparse location data. We introduce the concept of social foo...
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
We present a family of algorithms to uncover tribes--groups of individuals who share unusual sequences of affiliations. While much work inferring community structure describes lar...
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
Large 0-1 datasets arise in various applications, such as market basket analysis and information retrieval. We concentrate on the study of topic models, aiming at results which in...