22 February 2023 in IEEE Transactions on Fuzzy Systems
Fuzzy clustering decomposes data into clusters using partial memberships by exploring the cluster structure information, which demonstrates comparable performance for knowledge exploitation under the circumstance of information incompleteness. In general, this scheme considers the memberships of objects to cluster centroids and applies to clusters with the spherical distribution. In addition, the noises and outliers may significantly influence the clustering process; a common mitigation measure is the application of separate noise processing algorithms, but this usually introduces multiple parameters which are challenging to be determined for different data types. This paper proposes a new fuzzy-rough intrigued harmonic discrepancy clustering (HDC) algorithm by noting that fuzzy-rough sets offer a higher degree of uncertainty modelling for both vagueness and imprecision present in real-valued datasets. The HDC is implemented by introducing a novel concept of harmonic discrepancy, which effectively indicates the dissimilarity between a data instance and foreign clusters with their distributions fully considered. The proposed HDC is thus featured by a powerful processing ability on complex data distribution leading to enhanced clustering performance, particularly on noisy datasets, without the use of explicit noise handling parameters. The experimental results confirm the effectiveness of the proposed HDC, which generally outperforms the popular representative clustering algorithms on both synthetic and benchmark datasets, demonstrating the superiority of the proposed algorithm.
4 July 2023 in IEEE Access
Collaborative Software Development (CSD) as an effective software development paradigm has achieved rapid development. In CSD, one critical and challenging problem is to find a group of compatible and diverse developers who can complete the assigned task as quickly as possible. To solve this problem, most previous approaches focus on measuring the relevance of tasks and developers based on their historical interactions. However, such approaches usually suffer from data sparsity and cold start problem which may reduce the recommendation accuracy. Moreover, previous approaches often ignored the diversity of team members which may reduce the overall collaboration efficiency. In this paper, we propose an attentive text-enhanced graph embedding learning framework, termed as CsdRec. We first incorporate text embedding into one-hop interaction learning and two-hop graph learning to learn the relevance between tasks and team members. Then, we explicitly model the team members’ diversity and incorporate it with relevance. Finally, to evaluate the performance of CsdRec, we conduct extensive experiments on two real-world datasets. The experimental results show that CsdRec outperforms other state-of-the-art approaches significantly.