Аннотация:Any text can be presented as an infinite number of topic models.Any of these topics would not have any attributes that would make it possible to break them up into classes. The Author has suggested additive regularization when creating models to single out topic clusters from the Probabilistic Latent Semantic Analysis, PLSA.The method proposed by the Author allows singling out topic classes based on their density in the document-topic space (Matrix Θ) for a selected collection of documents.Such segmentation is similar to hierarchical variant LDA (HLDA) but has no such drawback as that the LDA models have.