Abstract. For an arbitrary set E and a given closure operator σ : P (E) → P (E), we want to construct a symmetric closure operatorσ : P (E) → P (E) via some -possibly infinite -iteration process. If E is finite, the corresponding symmetric closure operatorσ defines a matroid. If E = R n and σ is the convex closure operator,σ turns out to be the affine closure operator. Moreover, we apply the symmetrization process to closure operators induced by visibility.