Recommender systems are useful tools to give personalized recommendations to users. One of the most popular techniques used in these systems is collaborative filtering. Recommender system algorithms get into trouble with data sparsity and scalability. These challenges cause lack of convergence in our algorithms. In this research, we propose a new method based on matrix factorization which alleviates data sparsity. We suggest a new method which can be performed as a preprocessing method for initial latent factor matrices of users and items. Initialized latent factors in matrix factorization lead to two advantages: (1) sparsity and scalability would be covered and (2) convergence of algorithms would be faster. We have shown that our method has improved the accuracy of optimization-based matrix factorization technique. Also it has increased the speed of matrix factorization convergence.