A new method has been developed in recent years, following Bourgain-Gamburd, for establishing spectral gaps for Cayley graphs of large finite groups. Its main combinatorial input is a classification of finite subsets that do not grow too much under multiplication, the so-called approximate groups. I will give an introduction to this notion and present several recent classification theorems for approximate subgroups of various groups.