paper-with-me

Papers

Expressive recommender systems through normalized nonnegative models

2015-11-15 · Cyril Stark

We introduce normalized nonnegative models (NNM) for explorative data analysis. NNMs are partial convexifications of models from probability theory. We demonstrate their value at the example of item recommendation. We show that NNM-based recommender systems satisfy three criteria that all recommender systems should ideally satisfy: high predictive power, computational tractability, and expressive representations of users and items. Expressive user and item representations are important in practice to succinctly summarize the pool of customers and the pool of items. In NNMs, user representations are expressive because each user's preference can be regarded as normalized mixture of preferences of stereotypical users. The interpretability of item and user representations allow us to arrange properties of items (e.g., genres of movies or topics of documents) or users (e.g., personality traits) hierarchically.

📄 PDF Abstract BibTeX arXiv:1511.04775

Code (0)

등록된 구현이 없습니다.

Tasks

Recommendation Systems

Methods 이 논문이 사용한 방법론

Interpretability 설명 없음

Similar Papers 제목 키워드 기반

Top-N recommendations from expressive recommender systems

2015-11-20 · Cyril Stark

Normalized nonnegative models assign probability distributions to users and random variables to items; see [Stark, 2015]. Rating an item is regarded as sampling the random variable assigned to the item with respect to th…

Recommendation Systems

CF Recommender System Based on Ontology and Nonnegative Matrix Factorization (NMF)

2024-05-31 · Sajida Mhammedi, Hakim El Massari, Noreddine Gherabi, Amnai Mohamed

Recommender systems are a kind of data filtering that guides the user to interesting and valuable resources within an extensive dataset. by providing suggestions of products that are expected to match their preferences. …

Collaborative FilteringRecommendation Systems

Spectral Clustering by Ellipsoid and Its Connection to Separable Nonnegative Matrix Factorization

2015-03-05 · Tomohiko Mizutani

This paper proposes a variant of the normalized cut algorithm for spectral clustering. Although the normalized cut algorithm applies the K-means algorithm to the eigenvectors of a normalized graph Laplacian for finding c…

Clustering

Linear-Time Graph Neural Networks for Scalable Recommendations

2024-02-21 · Jiahao Zhang, Rui Xue, Wenqi Fan, Xin Xu 외

In an era of information explosion, recommender systems are vital tools to deliver personalized recommendations for users. The key of recommender systems is to forecast users' future behaviors based on previous user-item…

Graph Neural NetworkRecommendation Systems

On Algorithms for Sparse Multi-factor NMF

2013-12-01 · NeurIPS 2013 12 · Siwei Lyu, Xin Wang

Nonnegative matrix factorization (NMF) is a popular data analysis method, the objective of which is to decompose a matrix with all nonnegative components into the product of two other nonnegative matrices. In this work,…