10,007 research outputs found
Representation Learning for Attributed Multiplex Heterogeneous Network
Network embedding (or graph embedding) has been widely used in many
real-world applications. However, existing methods mainly focus on networks
with single-typed nodes/edges and cannot scale well to handle large networks.
Many real-world networks consist of billions of nodes and edges of multiple
types, and each node is associated with different attributes. In this paper, we
formalize the problem of embedding learning for the Attributed Multiplex
Heterogeneous Network and propose a unified framework to address this problem.
The framework supports both transductive and inductive learning. We also give
the theoretical analysis of the proposed framework, showing its connection with
previous works and proving its better expressiveness. We conduct systematical
evaluations for the proposed framework on four different genres of challenging
datasets: Amazon, YouTube, Twitter, and Alibaba. Experimental results
demonstrate that with the learned embeddings from the proposed framework, we
can achieve statistically significant improvements (e.g., 5.99-28.23% lift by
F1 scores; p<<0.01, t-test) over previous state-of-the-art methods for link
prediction. The framework has also been successfully deployed on the
recommendation system of a worldwide leading e-commerce company, Alibaba Group.
Results of the offline A/B tests on product recommendation further confirm the
effectiveness and efficiency of the framework in practice.Comment: Accepted to KDD 2019. Website: https://sites.google.com/view/gatn
From Group Recommendations to Group Formation
There has been significant recent interest in the area of group
recommendations, where, given groups of users of a recommender system, one
wants to recommend top-k items to a group that maximize the satisfaction of the
group members, according to a chosen semantics of group satisfaction. Examples
semantics of satisfaction of a recommended itemset to a group include the
so-called least misery (LM) and aggregate voting (AV). We consider the
complementary problem of how to form groups such that the users in the formed
groups are most satisfied with the suggested top-k recommendations. We assume
that the recommendations will be generated according to one of the two group
recommendation semantics - LM or AV. Rather than assuming groups are given, or
rely on ad hoc group formation dynamics, our framework allows a strategic
approach for forming groups of users in order to maximize satisfaction. We show
that the problem is NP-hard to solve optimally under both semantics.
Furthermore, we develop two efficient algorithms for group formation under LM
and show that they achieve bounded absolute error. We develop efficient
heuristic algorithms for group formation under AV. We validate our results and
demonstrate the scalability and effectiveness of our group formation algorithms
on two large real data sets.Comment: 14 pages, 22 figure
- …