Complementary incomplete weighted concept factorization methods for multi-view clustering
Knowledge and Information Systems · vol. 66 (12) · 7469-7494
المخرجات
Articles, reviews, conference papers and book chapters, indexed by DOI and linked to University researchers.
3 output Results for «multi-view clustering»
Knowledge and Information Systems · vol. 66 (12) · 7469-7494
IEEE Access · vol. 11 · 60681-60692
Ongoing researches on multiple view data are showing competitive behavior in the machine learning field. Multi-view clustering has gained widespread acceptance for managing multi-view data and improves clustering efficiency. Large dimensionality in data from various views has recently drawn a lot of interest from researchers. How to efficiently learns the appropriate lower dimensional subspace which can manage the valuable information from the diverse views is challenging and considerable issue. To concentrate on the mentioned issue, we asserted a novel clustering approach for multiple view data through low-rank representation. We consider the importance of each view by assigning the weight control factor. We combine consensus representation with the degree of disagreement among lower rank matrices. The single objective function unifies all factors. Furthermore, we give the efficient solution to update the variable and to optimized the objective function through the Augmented Lagrange’s Multiplier strategy. Real-world datasets are utilized in this study to exemplify the efficiency of the introduced technique, and it is contemplated to preceding algorithms to demonstrate its superiority.
IEEE Access · vol. 10 · 113249-113259
Clustering of multi-view data has got broad consideration of the researchers. Multi-view data is composed through different domain which shows the consistent and complementary behavior. The existing studies did not draw attention of over-fitting and sparsity among the diverse view, which is the considerable issue for getting the unique consensus knowledge from these complementary data. Herein article, a multi-view clustering approach is recommended to provide the consensus solution from the multi-view data. To accomplish this task, we exploit non-negative matrix factorized method to generate a cost function. Further, manifold learning model is used to build the graph through the nearest neighbor strategy, which is effective to save the geometrical design for data and feature matrix. Furthermore, the over-fitting problem, sparsity is handled through adaption of frobenious norm, and$L_{1}$-norm on basis and coefficient matrices. The whole formulation is done through the mathematical function, which is optimized through the iterative updating strategy to get the optimal solution. The computational experiment is carried on the available datasets to exhibits that the proposed strategy beats the current methodologies in terms of clustering execution.