Ensemble-based Top-k Recommender System Considering Incomplete Data

Authors

  • J. Hamidzadeh Faculty of computer engineering and information technology, Sadjad University of Technology, Mashhad, Iran.
  • M. Moradi Faculty of computer engineering and information technology, Sadjad University of Technology, Mashhad, Iran.
Abstract:

Recommender systems have been widely used in e-commerce applications. They are a subclass of information filtering system, used to either predict whether a user will prefer an item (prediction problem) or identify a set of k items that will be user-interest (Top-k recommendation problem). Demanding sufficient ratings to make robust predictions and suggesting qualified recommendations are two significant challenges in recommender systems. However, the latter is far from satisfactory because human decisions affected by environmental conditions and they might change over time. In this paper, we introduce an innovative method to impute ratings to missed components of the rating matrix. We also design an ensemble-based method to obtain Top-k recommendations. To evaluate the performance of the proposed method, several experiments have been conducted based on 10-fold cross validation over real-world data sets. Experimental results show that the proposed method is superior to the state-of-the-art competing methods regarding applied evaluation metrics.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Multi-Level Ensemble Learning based Recommender System

In this paper, we have tried to go beyond conventional ensemble learning & explore multi-level ensemble learning with reference to recommender systems. In particular, we have focused on stacked generalization for building Movie Recommender System. We have tried to analyze the transition from single level to multi-level ensemble learning and its effects on the overall accuracy. We have used movi...

full text

TopCrowd - Efficient Crowd-enabled Top-k Retrieval on Incomplete Data

Building databases and information systems over data extracted from heterogeneous sources like the Web poses a severe challenge: most data is incomplete and thus difficult to process in structured queries. This is especially true for sophisticated query techniques like Top-k querying where rankings are aggregated over several sources. The intelligent combination of efficient data processing alg...

full text

A Review on Top-K Dominating Queries on Incomplete Data

Data mining is a powerful way to discover knowledge within the large amount of the data. Incomplete data is general, finding out and querying these type of data is important recently. The top-k dominating (TKD) queries return k objects that overrides maximum number of objects in a given dataset. It merges the advantages of skyline and top-k queries. This plays an important role in many decision...

full text

Top-k Querying of Incomplete Data under Order Constraints

Obtaining data values is often expensive, e.g., when they are retrieved from human workers, from remote data repositories, or via complex computations. In this paper, we consider a scenario where the values are taken from a numerical domain, and where some partial order constraints are given over missing and known values. We study the evaluation of top-k selection queries over incomplete data i...

full text

A social recommender system based on matrix factorization considering dynamics of user preferences

With the expansion of social networks, the use of recommender systems in these networks has attracted considerable attention. Recommender systems have become an important tool for alleviating the information that overload problem of users by providing personalized recommendations to a user who might like based on past preferences or observed behavior about one or various items. In these systems...

full text

Top-N Recommender System via Matrix Completion

Top-N recommender systems have been investigated widely both in industry and academia. However, the recommendation quality is far from satisfactory. In this paper, we propose a simple yet promising algorithm. We fill the user-item matrix based on a low-rank assumption and simultaneously keep the original information. To do that, a nonconvex rank relaxation rather than the nuclear norm is adopte...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 7  issue 3

pages  393- 402

publication date 2019-07-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023