Cargando…

Genetic Algorithm and Graph Theory Based Matrix Factorization Method for Online Friend Recommendation

Online friend recommendation is a fast developing topic in web mining. In this paper, we used SVD matrix factorization to model user and item feature vector and used stochastic gradient descent to amend parameter and improve accuracy. To tackle cold start problem and data sparsity, we used KNN model...

Descripción completa

Detalles Bibliográficos
Autores principales: Li, Qu, Yao, Min, Yang, Jianhua, Xu, Ning
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2014
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3976802/
https://www.ncbi.nlm.nih.gov/pubmed/24757410
http://dx.doi.org/10.1155/2014/162148
Descripción
Sumario:Online friend recommendation is a fast developing topic in web mining. In this paper, we used SVD matrix factorization to model user and item feature vector and used stochastic gradient descent to amend parameter and improve accuracy. To tackle cold start problem and data sparsity, we used KNN model to influence user feature vector. At the same time, we used graph theory to partition communities with fairly low time and space complexity. What is more, matrix factorization can combine online and offline recommendation. Experiments showed that the hybrid recommendation algorithm is able to recommend online friends with good accuracy.