The eccentricity of a vertex $u$ in a connected graph $G$ is the maximum distance from $u$ to other vertices of $G$. The $n$-vertex unicyclic graphs with the $i$-th largest average eccentricity are determined for all $i$ up to $\lfloor\frac n2\rfloor-1$ with $n\geq6$.