Research on the fairness of spectral clustering has gradually increased attention. Normally, existing methods of fair spectral clustering add a fairness constraint to the original objective function so that fairness is guaranteed. However, similar to the solver of traditional spectral clustering, that of fairness spectral clustering has to relax a discrete value condition into an arbitrary one, which leads to the deterioration of both fairness and clustering quality. Moreover, the eigen-problem is inevitable in the solver, which takes $\mathcal{O}\left(n^3\right)$ time complexity and is not available for large-scale data. In this paper, we propose a fair spectral clustering algorithm by employing the coordinate descent method to find the solution. As the relaxation of the discreteness condition is discarded, the fairness is improved. Furthermore, we refine the process of coordinate descent by avoiding redundant calculations, and as a result, the time complexity is reduced from $\mathcal{O}\left(n^3\right)$ to $\mathcal{O}\left(n^2\right)$. Additionally, the importance of clustering quality and fairness is symmetric; hence, we achieve a trade-off between them by adjusting the parameters. The experimental findings, obtained from both real-world and synthetic datasets, clearly illustrate that our proposal delivers superior fairness and clustering quality with the best BAL compared to other fair clustering methods. In addition, our method is more efficient than existing fair spectral clustering algorithms.

Ensemble clustering has become a widely used technique for improving robustness and accuracy by combining multiple clustering results. However, traditional ensemble clustering methods often fail to provide fair treatment between groups defined by sensitive attributes. Central to many ensemble methods is the symmetric co-association matrix, which captures pairwise similarity between data points based on their co-occurrence across base clusterings. This paper introduces a fair ensemble clustering method based on the symmetric co-association matrix. The proposed method integrates fairness constraints into the objective function of the ensemble process, using the results from base clusterings that lack fairness considerations as input. The optimization is performed iteratively, and the final clustering results are represented directly by a label matrix obtained efficiently using a coordinate descent approach. By integrating fairness into the clustering process, the method avoids the need for post-processing to achieve fair results. Comprehensive experiments on both real-world and synthetic datasets validate the effectiveness and practicality of the proposed method.