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.
