Considering many graph clustering methods are with quadratic or cubic time complexity and
need post-processing to obtain the discrete solution. Combining with the anchor graph, we …

We propose sparse variants of correspondence analysis (CA) for large contingency tables
like documents-terms matrices used in text mining. By seeking to obtain many zero …

In this paper we propose a fuzzy co‐clustering algorithm via modularity maximization,
named MMFCC. In its objective function, we use the modularity measure as the criterion for …