Bassoma Diallo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Bassoma Diallo has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Ghufran Ahmad Khan
Department of Computer Science and Engineering, Koneru Lakshmaiah Education Foundation, Vaddeswaram, India
1 shared publication - Jalaluddin Khan
Department of Computer Science and Engineering, Koneru Lakshmaiah Education Foundation, Guntur, India
1 shared publication - Muhammad Hafeez Javed
School of Computing and Artificial Intelligence, Southwest Jiaotong University, Chengdu, People’s Republic of China
1 shared publication - Taushif Anwar
Department of Computer Science and Engineering, Koneru Lakshmaiah Education Foundation, Vaddeswaram, India
1 shared publication - Zubair Ashraf
Affiliation Department of Computer Science and Artificial Intelligence, College of Computing and Information Technology, University of Bisha, Bisha, Saudi Arabia
1 shared publication
Latest Publications
- 25 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Artificial Intelligence
- Vol. 5 (11) , 5699-5708
Weighted Concept Factorization Based Incomplete Multi-view Clustering
The primary objective of classical multi-view clustering is to categorize data into separate clusters under the assumption that all perspectives are completely available. However, in practical situations, it is common to encounter cases where not all viewpoints of the data are accessible. This limitation can impede the effectiveness of traditional multi-view clustering methods. The incompleteness of the clustering of multi-view data has witnessed substantial progress in recent years due to its promising applications. In response to the aforementioned issue, we have tackled it by introducing an inventive multi-view clustering algorithm that is tailored to handle incomplete data from various views. Additionally, we have proposed a distinct objective function that leverages a weighted concept factorization technique to address the absence of data instances within each incomplete perspective. To address inconsistencies between different views, we introduced a co-regularization factor, which operates in conjunction with a shared consensus matrix. It is important to highlight that the proposed objective function is intrinsically non-convex, presenting challenges in terms of optimization. To secure the optimal solution for this objective function, we have implemented an iterative optimization approach to reach the local minima for our method. To underscore the efficacy and validation of our approach, we experimented with real-world datasets and used state-of-the-art methods to perform comparative assessments.
- 25 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Artificial Intelligence
- Vol. 5 (11) , 5699-5708
Weighted Concept Factorization Based Incomplete Multi-view Clustering
The primary objective of classical multi-view clustering is to categorize data into separate clusters under the assumption that all perspectives are completely available. However, in practical situations, it is common to encounter cases where not all viewpoints of the data are accessible. This limitation can impede the effectiveness of traditional multi-view clustering methods. The incompleteness of the clustering of multi-view data has witnessed substantial progress in recent years due to its promising applications. In response to the aforementioned issue, we have tackled it by introducing an inventive multi-view clustering algorithm that is tailored to handle incomplete data from various views. Additionally, we have proposed a distinct objective function that leverages a weighted concept factorization technique to address the absence of data instances within each incomplete perspective. To address inconsistencies between different views, we introduced a co-regularization factor, which operates in conjunction with a shared consensus matrix. It is important to highlight that the proposed objective function is intrinsically non-convex, presenting challenges in terms of optimization. To secure the optimal solution for this objective function, we have implemented an iterative optimization approach to reach the local minima for our method. To underscore the efficacy and validation of our approach, we experimented with real-world datasets and used state-of-the-art methods to perform comparative assessments.