Genetic algorithm-based matrix factorization for missing value prediction

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Sparsity is a major problem in the areas like data mining and pattern recognition. In recommender systems, predictions based on these few observations lead to avoidance of inherent latent features of the user corresponding to the item. Similarly, in different crowdsourcing based opinion aggregation models, there is a minimal chance to obtain opinions from all the crowd workers. Even this sparsity problem has an extensive effect in predicting actual rating of a particular item due to limited and incomplete observations. To deal with this issue, in this article, a genetic algorithm based matrix factorization technique is proposed to estimate the missing entries in the response matrix that contains workers’ responses over some questions. We have created three synthetic datasets and used one real-life dataset to show the efficacy of the proposed method over the other state-of-the-art approaches.

Cite

CITATION STYLE

APA

Chatterjee, S., & Mukhopadhyay, A. (2017). Genetic algorithm-based matrix factorization for missing value prediction. In Communications in Computer and Information Science (Vol. 776, pp. 504–516). Springer Verlag. https://doi.org/10.1007/978-981-10-6430-2_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free