A Two-Stage Item Recommendation Method Using Probabilistic Ranking with Reconstructed Tensor Model
نویسندگان
چکیده
In a tag-based recommender system, the multi-dimensional correlation should be modeled effectively for finding quality recommendations. Recently, few researchers have used tensor models in recommendation to represent and analyze latent relationships inherent in multidimensions data. A common approach is to build the tensor model, decompose it and, then, directly use the reconstructed tensor to generate the recommendation based on the maximum values of tensor elements. In order to improve the accuracy and scalability, we propose an implementation of the mode block-striped (matrix) product for scalable tensor reconstruction and probabilistically ranking the candidate items generated from the reconstructed tensor. With testing on real-world datasets, we demonstrate that the proposed method outperforms the benchmarking methods in terms of recommendation accuracy and scalability.
منابع مشابه
A User-Item Relevance Model for Log-Based Collaborative Filtering
Implicit acquisition of user preferences makes log-based collaborative filtering favorable in practice to accomplish recommendations. In this paper, we follow a formal approach in text retrieval to re-formulate the problem. Based on the classic probability ranking principle, we propose a probabilistic user-item relevance model. Under this formal model, we show that user-based and item-based app...
متن کاملRanking Efficient DMUs in Two-stage Network DEA with Common Weights method
Two stages DEA models are used in many fields of management and industry. One of the concepts that has attracted the attention of researchers in the theory of production is the concept of ranking the units with a two-stage network. A unit ranking can provide useful information to decision makers (DMUs) about optimal decision making activities. This concept defines the superiority of a unit in t...
متن کاملLearning to Hash for Recommendation with Tensor Data
Recommender systems usually need to compare user interests and item characteristics in the context of large user and item space, making hashing based algorithms a promising strategy to speed up recommendation. Existing hashing based recommendation methods only model the users and items and dealing with the matrix data, e.g., user-item rating matrix. In practice, recommendation scenarios can be ...
متن کاملCollaborative Topic Ranking: Leveraging Item Meta-Data for Sparsity Reduction
Pair-wise ranking methods have been widely used in recommender systems to deal with implicit feedback. They attempt to discriminate between a handful of observed items and the large set of unobserved items. In these approaches, however, user preferences and item characteristics cannot be estimated reliably due to overfitting given highly sparse data. To alleviate this problem, in this paper, we...
متن کاملMulti-item inventory model with probabilistic demand function under permissible delay in payment and fuzzy-stochastic budget constraint: A signomial geometric programming method
This study proposes a new multi-item inventory model with hybrid cost parameters under a fuzzy-stochastic constraint and permissible delay in payment. The price and marketing expenditure dependent stochastic demand and the demand dependent the unit production cost are considered. Shortages are allowed and partially backordered. The main objective of this paper is to determine selling price, mar...
متن کامل