296 research outputs found
MCDAN: a Multi-scale Context-enhanced Dynamic Attention Network for Diffusion Prediction
Information diffusion prediction aims at predicting the target users in the
information diffusion path on social networks. Prior works mainly focus on the
observed structure or sequence of cascades, trying to predict to whom this
cascade will be infected passively. In this study, we argue that user intent
understanding is also a key part of information diffusion prediction. We
thereby propose a novel Multi-scale Context-enhanced Dynamic Attention Network
(MCDAN) to predict which user will most likely join the observed current
cascades. Specifically, to consider the global interactive relationship among
users, we take full advantage of user friendships and global cascading
relationships, which are extracted from the social network and historical
cascades, respectively. To refine the model's ability to understand the user's
preference for the current cascade, we propose a multi-scale sequential
hypergraph attention module to capture the dynamic preference of users at
different time scales. Moreover, we design a contextual attention enhancement
module to strengthen the interaction of user representations within the current
cascade. Finally, to engage the user's own susceptibility, we construct a
susceptibility label for each user based on user susceptibility analysis and
use the rank of this label for auxiliary prediction. We conduct experiments
over four widely used datasets and show that MCDAN significantly overperforms
the state-of-the-art models. The average improvements are up to 10.61% in terms
of Hits@100 and 9.71% in terms of MAP@100, respectively
The HyperBagGraph DataEdron: An Enriched Browsing Experience of Multimedia Datasets
Traditional verbatim browsers give back information in a linear way according
to a ranking performed by a search engine that may not be optimal for the
surfer. The latter may need to assess the pertinence of the information
retrieved, particularly when she wants to explore other facets of a
multi-facetted information space. For instance, in a multimedia dataset
different facets such as keywords, authors, publication category, organisations
and figures can be of interest. The facet simultaneous visualisation can help
to gain insights on the information retrieved and call for further searches.
Facets are co-occurence networks, modeled by HyperBag-Graphs -- families of
multisets -- and are in fact linked not only to the publication itself, but to
any chosen reference. These references allow to navigate inside the dataset and
perform visual queries. We explore here the case of scientific publications
based on Arxiv searches.Comment: Extension of the hypergraph framework shortly presented in
arXiv:1809.00164 (possible small overlaps); use the theoretical framework of
hb-graphs presented in arXiv:1809.0019
Recommending on graphs: a comprehensive review from a data perspective
Recent advances in graph-based learning approaches have demonstrated their
effectiveness in modelling users' preferences and items' characteristics for
Recommender Systems (RSS). Most of the data in RSS can be organized into graphs
where various objects (e.g., users, items, and attributes) are explicitly or
implicitly connected and influence each other via various relations. Such a
graph-based organization brings benefits to exploiting potential properties in
graph learning (e.g., random walk and network embedding) techniques to enrich
the representations of the user and item nodes, which is an essential factor
for successful recommendations. In this paper, we provide a comprehensive
survey of Graph Learning-based Recommender Systems (GLRSs). Specifically, we
start from a data-driven perspective to systematically categorize various
graphs in GLRSs and analyze their characteristics. Then, we discuss the
state-of-the-art frameworks with a focus on the graph learning module and how
they address practical recommendation challenges such as scalability, fairness,
diversity, explainability and so on. Finally, we share some potential research
directions in this rapidly growing area.Comment: Accepted by UMUA
Group Identification via Transitional Hypergraph Convolution with Cross-view Self-supervised Learning
With the proliferation of social media, a growing number of users search for
and join group activities in their daily life. This develops a need for the
study on the group identification (GI) task, i.e., recommending groups to
users. The major challenge in this task is how to predict users' preferences
for groups based on not only previous group participation of users but also
users' interests in items. Although recent developments in Graph Neural
Networks (GNNs) accomplish embedding multiple types of objects in graph-based
recommender systems, they, however, fail to address this GI problem
comprehensively. In this paper, we propose a novel framework named Group
Identification via Transitional Hypergraph Convolution with Graph
Self-supervised Learning (GTGS). We devise a novel transitional hypergraph
convolution layer to leverage users' preferences for items as prior knowledge
when seeking their group preferences. To construct comprehensive user/group
representations for GI task, we design the cross-view self-supervised learning
to encourage the intrinsic consistency between item and group preferences for
each user, and the group-based regularization to enhance the distinction among
group embeddings. Experimental results on three benchmark datasets verify the
superiority of GTGS. Additional detailed investigations are conducted to
demonstrate the effectiveness of the proposed framework.Comment: 11 pages. Accepted by CIKM'2
NAIS: Neural Attentive Item Similarity Model for Recommendation
Item-to-item collaborative filtering (aka. item-based CF) has been long used
for building recommender systems in industrial settings, owing to its
interpretability and efficiency in real-time personalization. It builds a
user's profile as her historically interacted items, recommending new items
that are similar to the user's profile. As such, the key to an item-based CF
method is in the estimation of item similarities. Early approaches use
statistical measures such as cosine similarity and Pearson coefficient to
estimate item similarities, which are less accurate since they lack tailored
optimization for the recommendation task. In recent years, several works
attempt to learn item similarities from data, by expressing the similarity as
an underlying model and estimating model parameters by optimizing a
recommendation-aware objective function. While extensive efforts have been made
to use shallow linear models for learning item similarities, there has been
relatively less work exploring nonlinear neural network models for item-based
CF.
In this work, we propose a neural network model named Neural Attentive Item
Similarity model (NAIS) for item-based CF. The key to our design of NAIS is an
attention network, which is capable of distinguishing which historical items in
a user profile are more important for a prediction. Compared to the
state-of-the-art item-based CF method Factored Item Similarity Model (FISM),
our NAIS has stronger representation power with only a few additional
parameters brought by the attention network. Extensive experiments on two
public benchmarks demonstrate the effectiveness of NAIS. This work is the first
attempt that designs neural network models for item-based CF, opening up new
research possibilities for future developments of neural recommender systems
Nothing Stands Alone: Relational Fake News Detection with Hypergraph Neural Networks
Nowadays, fake news easily propagates through online social networks and
becomes a grand threat to individuals and society. Assessing the authenticity
of news is challenging due to its elaborately fabricated contents, making it
difficult to obtain large-scale annotations for fake news data. Due to such
data scarcity issues, detecting fake news tends to fail and overfit in the
supervised setting. Recently, graph neural networks (GNNs) have been adopted to
leverage the richer relational information among both labeled and unlabeled
instances. Despite their promising results, they are inherently focused on
pairwise relations between news, which can limit the expressive power for
capturing fake news that spreads in a group-level. For example, detecting fake
news can be more effective when we better understand relations between news
pieces shared among susceptible users. To address those issues, we propose to
leverage a hypergraph to represent group-wise interaction among news, while
focusing on important news relations with its dual-level attention mechanism.
Experiments based on two benchmark datasets show that our approach yields
remarkable performance and maintains the high performance even with a small
subset of labeled news data.Comment: Accepted in IEEE Big Data 2
- …