95,224 research outputs found
Context-aware Sequential Recommendation
Since sequential information plays an important role in modeling user
behaviors, various sequential recommendation methods have been proposed.
Methods based on Markov assumption are widely-used, but independently combine
several most recent components. Recently, Recurrent Neural Networks (RNN) based
methods have been successfully applied in several sequential modeling tasks.
However, for real-world applications, these methods have difficulty in modeling
the contextual information, which has been proved to be very important for
behavior modeling. In this paper, we propose a novel model, named Context-Aware
Recurrent Neural Networks (CA-RNN). Instead of using the constant input matrix
and transition matrix in conventional RNN models, CA-RNN employs adaptive
context-specific input matrices and adaptive context-specific transition
matrices. The adaptive context-specific input matrices capture external
situations where user behaviors happen, such as time, location, weather and so
on. And the adaptive context-specific transition matrices capture how lengths
of time intervals between adjacent behaviors in historical sequences affect the
transition of global sequential features. Experimental results show that the
proposed CA-RNN model yields significant improvements over state-of-the-art
sequential recommendation methods and context-aware recommendation methods on
two public datasets, i.e., the Taobao dataset and the Movielens-1M dataset.Comment: IEEE International Conference on Data Mining (ICDM) 2016, to apea
NASARI: a novel approach to a Semantically-Aware Representation of items
The semantic representation of individual word senses and concepts is of fundamental importance to several applications in Natural Language Processing. To date, concept modeling techniques have in the main based their representation either on lexicographic resources, such as WordNet, or on encyclopedic resources, such as Wikipedia. We propose a vector representation technique that combines the complementary knowledge of both these types of resource. Thanks to its use of explicit semantics combined with a novel cluster-based dimensionality reduction and an effective weighting scheme, our representation attains state-of-the-art performance on multiple datasets in two standard benchmarks: word similarity and sense clustering. We are releasing our vector representations at http://lcl.uniroma1.it/nasari/
Search Efficient Binary Network Embedding
Traditional network embedding primarily focuses on learning a dense vector
representation for each node, which encodes network structure and/or node
content information, such that off-the-shelf machine learning algorithms can be
easily applied to the vector-format node representations for network analysis.
However, the learned dense vector representations are inefficient for
large-scale similarity search, which requires to find the nearest neighbor
measured by Euclidean distance in a continuous vector space. In this paper, we
propose a search efficient binary network embedding algorithm called BinaryNE
to learn a sparse binary code for each node, by simultaneously modeling node
context relations and node attribute relations through a three-layer neural
network. BinaryNE learns binary node representations efficiently through a
stochastic gradient descent based online learning algorithm. The learned binary
encoding not only reduces memory usage to represent each node, but also allows
fast bit-wise comparisons to support much quicker network node search compared
to Euclidean distance or other distance measures. Our experiments and
comparisons show that BinaryNE not only delivers more than 23 times faster
search speed, but also provides comparable or better search quality than
traditional continuous vector based network embedding methods
Sequential Recommendation with Self-Attentive Multi-Adversarial Network
Recently, deep learning has made significant progress in the task of
sequential recommendation. Existing neural sequential recommenders typically
adopt a generative way trained with Maximum Likelihood Estimation (MLE). When
context information (called factor) is involved, it is difficult to analyze
when and how each individual factor would affect the final recommendation
performance. For this purpose, we take a new perspective and introduce
adversarial learning to sequential recommendation. In this paper, we present a
Multi-Factor Generative Adversarial Network (MFGAN) for explicitly modeling the
effect of context information on sequential recommendation. Specifically, our
proposed MFGAN has two kinds of modules: a Transformer-based generator taking
user behavior sequences as input to recommend the possible next items, and
multiple factor-specific discriminators to evaluate the generated sub-sequence
from the perspectives of different factors. To learn the parameters, we adopt
the classic policy gradient method, and utilize the reward signal of
discriminators for guiding the learning of the generator. Our framework is
flexible to incorporate multiple kinds of factor information, and is able to
trace how each factor contributes to the recommendation decision over time.
Extensive experiments conducted on three real-world datasets demonstrate the
superiority of our proposed model over the state-of-the-art methods, in terms
of effectiveness and interpretability
- …