Dual Fuzzy-Possibilistic Coclustering for Categorization of Documents.

In this paper, we develop a new soft model dual fuzzy-possibilistic coclustering (DFPC) for document categorization. The proposed model targets robustness to outliers and richer representations of coclusters. DFPC is inspired by an existing algorithm called possibilistic fuzzy C-means (PFCM) that hybridizes fuzzy and possibilistic clustering. It has been shown that PFCM can perform effectively for low-dimensional data clustering. To achieve our goal, we expand this existing idea by introducing a novel PFCM-like coclustering model. The new algorithm DFPC preserves the desired properties of PFCM. In addition, as a coclustering algorithm, DFPC is more suitable for our intended high-dimensional application: document clustering. Besides, the coclustering mechanism enables DFPC to generate, together with document clusters, fuzzy-possibilistic word memberships. These word memberships, which are absent in the existing PFCM model, can play an important role in generating useful descriptions of document clusters. We detail the formulation of the proposed model and provide an extensive analytical study of the algorithm DFPC. Experiments on an artificial dataset and various benchmark document datasets demonstrate the effectiveness and potential of DFPC. [ABSTRACT FROM AUTHOR]