43 research outputs found
Dynamic Poisson Factorization
Models for recommender systems use latent factors to explain the preferences
and behaviors of users with respect to a set of items (e.g., movies, books,
academic papers). Typically, the latent factors are assumed to be static and,
given these factors, the observed preferences and behaviors of users are
assumed to be generated without order. These assumptions limit the explorative
and predictive capabilities of such models, since users' interests and item
popularity may evolve over time. To address this, we propose dPF, a dynamic
matrix factorization model based on the recent Poisson factorization model for
recommendations. dPF models the time evolving latent factors with a Kalman
filter and the actions with Poisson distributions. We derive a scalable
variational inference algorithm to infer the latent factors. Finally, we
demonstrate dPF on 10 years of user click data from arXiv.org, one of the
largest repository of scientific papers and a formidable source of information
about the behavior of scientists. Empirically we show performance improvement
over both static and, more recently proposed, dynamic recommendation models. We
also provide a thorough exploration of the inferred posteriors over the latent
variables.Comment: RecSys 201
Neural Attentive Session-based Recommendation
Given e-commerce scenarios that user profiles are invisible, session-based
recommendation is proposed to generate recommendation results from short
sessions. Previous work only considers the user's sequential behavior in the
current session, whereas the user's main purpose in the current session is not
emphasized. In this paper, we propose a novel neural networks framework, i.e.,
Neural Attentive Recommendation Machine (NARM), to tackle this problem.
Specifically, we explore a hybrid encoder with an attention mechanism to model
the user's sequential behavior and capture the user's main purpose in the
current session, which are combined as a unified session representation later.
We then compute the recommendation scores for each candidate item with a
bi-linear matching scheme based on this unified session representation. We
train NARM by jointly learning the item and session representations as well as
their matchings. We carried out extensive experiments on two benchmark
datasets. Our experimental results show that NARM outperforms state-of-the-art
baselines on both datasets. Furthermore, we also find that NARM achieves a
significant improvement on long sessions, which demonstrates its advantages in
modeling the user's sequential behavior and main purpose simultaneously.Comment: Proceedings of the 2017 ACM on Conference on Information and
Knowledge Management. arXiv admin note: text overlap with arXiv:1511.06939,
arXiv:1606.08117 by other author
Recurrent Latent Variable Networks for Session-Based Recommendation
In this work, we attempt to ameliorate the impact of data sparsity in the
context of session-based recommendation. Specifically, we seek to devise a
machine learning mechanism capable of extracting subtle and complex underlying
temporal dynamics in the observed session data, so as to inform the
recommendation algorithm. To this end, we improve upon systems that utilize
deep learning techniques with recurrently connected units; we do so by adopting
concepts from the field of Bayesian statistics, namely variational inference.
Our proposed approach consists in treating the network recurrent units as
stochastic latent variables with a prior distribution imposed over them. On
this basis, we proceed to infer corresponding posteriors; these can be used for
prediction and recommendation generation, in a way that accounts for the
uncertainty in the available sparse training data. To allow for our approach to
easily scale to large real-world datasets, we perform inference under an
approximate amortized variational inference (AVI) setup, whereby the learned
posteriors are parameterized via (conventional) neural networks. We perform an
extensive experimental evaluation of our approach using challenging benchmark
datasets, and illustrate its superiority over existing state-of-the-art
techniques
Expert recommendation via tensor factorization with regularizing hierarchical topical relationships
© Springer Nature Switzerland AG 2018. Knowledge acquisition and exchange are generally crucial yet costly for both businesses and individuals, especially when the knowledge concerns various areas. Question Answering Communities offer an opportunity for sharing knowledge at a low cost, where communities users, many of whom are domain experts, can potentially provide high-quality solutions to a given problem. In this paper, we propose a framework for finding experts across multiple collaborative networks. We employ the recent techniques of tree-guided learning (via tensor decomposition), and matrix factorization to explore user expertise from past voted posts. Tensor decomposition enables to leverage the latent expertise of users, and the posts and related tags help identify the related areas. The final result is an expertise score for every user on every knowledge area. We experiment on Stack Exchange Networks, a set of question answering websites on different topics with a huge group of users and posts. Experiments show our proposed approach produces steady and premium outputs
Incorporating User Micro-behaviors and Item Knowledge into Multi-task Learning for Session-based Recommendation
Session-based recommendation (SR) has become an important and popular
component of various e-commerce platforms, which aims to predict the next
interacted item based on a given session. Most of existing SR models only focus
on exploiting the consecutive items in a session interacted by a certain user,
to capture the transition pattern among the items. Although some of them have
been proven effective, the following two insights are often neglected. First, a
user's micro-behaviors, such as the manner in which the user locates an item,
the activities that the user commits on an item (e.g., reading comments, adding
to cart), offer fine-grained and deep understanding of the user's preference.
Second, the item attributes, also known as item knowledge, provide side
information to model the transition pattern among interacted items and
alleviate the data sparsity problem. These insights motivate us to propose a
novel SR model MKM-SR in this paper, which incorporates user Micro-behaviors
and item Knowledge into Multi-task learning for Session-based Recommendation.
Specifically, a given session is modeled on micro-behavior level in MKM-SR,
i.e., with a sequence of item-operation pairs rather than a sequence of items,
to capture the transition pattern in the session sufficiently. Furthermore, we
propose a multi-task learning paradigm to involve learning knowledge embeddings
which plays a role as an auxiliary task to promote the major task of SR. It
enables our model to obtain better session representations, resulting in more
precise SR recommendation results. The extensive evaluations on two benchmark
datasets demonstrate MKM-SR's superiority over the state-of-the-art SR models,
justifying the strategy of incorporating knowledge learning
Multi-dimension Tensor Factorization Collaborative Filtering Recommendation for Academic Profiles
The choice of academic itineraries and/or optional subjects to attend is not usually an easy decision since, in most cases, students lack the information, maturity, and knowledge required to make right decisions. This paper evaluates the support of Collaborative Systems for helping and guiding students in this decision-making process, considering the behavior and impact of these systems on the use of data different from the formal information the students usually use. For this purpose, the research applied the clustering based Multi-dimension Tensor Factorization approach to build a recommendation system and confirm that the increment in tensors improves the recommendation accuracy. As a result, this approach permits the user to take advantage of the contextual information to reduce the sparsity issue and increase the recommendation accuracy
Intelligent and Distributed Data Warehouse for Student’s Academic Performance Analysis
In the academic world, a large amount of data is handled each day, ranging from student’s assessments to their socio-economic data. In order to analyze this historical information, an interesting alternative is to implement a Data Warehouse. However, Data Warehouses are not able to perform predictive analysis by themselves, so machine intelligence techniques can be used for sorting, grouping, and predicting based on historical information to improve the analysis quality. This work describes a Data Warehouse architecture to carry out an academic performance analysis of students