Abstract
In this paper we propose a new, improved version of a Monte Carlo projective clustering algorithm ?DOC. DOC was designed for general vector data and we extend it to deal with variable dimension significance and use it in web search snippets clustering.
We discuss advantages and weaknesses of our approach with respect to known algorithms.