34 research outputs found
RecipeMeta: Metapath-enhanced Recipe Recommendation on Heterogeneous Recipe Network
Recipe is a set of instructions that describes how to make food. It can help
people from the preparation of ingredients, food cooking process, etc. to
prepare the food, and increasingly in demand on the Web. To help users find the
vast amount of recipes on the Web, we address the task of recipe
recommendation. Due to multiple data types and relationships in a recipe, we
can treat it as a heterogeneous network to describe its information more
accurately. To effectively utilize the heterogeneous network, metapath was
proposed to describe the higher-level semantic information between two entities
by defining a compound path from peer entities. Therefore, we propose a
metapath-enhanced recipe recommendation framework, RecipeMeta, that combines
GNN (Graph Neural Network)-based representation learning and specific
metapath-based information in a recipe to predict User-Recipe pairs for
recommendation. Through extensive experiments, we demonstrate that the proposed
model, RecipeMeta, outperforms state-of-the-art methods for recipe
recommendation
Semi-supervised co-clustering on attributed heterogeneous information networks
trueThe embargo period should be 2 years -- not sure why under the drop down I can only select one year. Please validate.</p
Unsupervised keyword extraction from microblog posts via hashtags
© River Publishers. Nowadays, huge amounts of texts are being generated for social networking purposes on Web. Keyword extraction from such texts like microblog posts benefits many applications such as advertising, search, and content filtering. Unlike traditional web pages, a microblog post usually has some special social feature like a hashtag that is topical in nature and generated by users. Extracting keywords related to hashtags can reflect the intents of users and thus provides us better understanding on post content. In this paper, we propose a novel unsupervised keyword extraction approach for microblog posts by treating hashtags as topical indicators. Our approach consists of two hashtag enhanced algorithms. One is a topic model algorithm that infers topic distributions biased to hashtags on a collection of microblog posts. The words are ranked by their average topic probabilities. Our topic model algorithm can not only find the topics of a collection, but also extract hashtag-related keywords. The other is a random walk based algorithm. It first builds a word-post weighted graph by taking into account posts themselves. Then, a hashtag biased random walk is applied on this graph, which guides the algorithm to extract keywords according to hashtag topics. Last, the final ranking score of a word is determined by the stationary probability after a number of iterations. We evaluate our proposed approach on a collection of real Chinese microblog posts. Experiments show that our approach is more effective in terms of precision than traditional approaches considering no hashtag. The result achieved by the combination of two algorithms performs even better than each individual algorithm
HUPSMT: AN EFFICIENT ALGORITHM FOR MINING HIGH UTILITY-PROBABILITY SEQUENCES IN UNCERTAIN DATABASES WITH MULTIPLE MINIMUM UTILITY THRESHOLDS
The problem of high utility sequence mining (HUSM) in quantitative se-quence databases (QSDBs) is more general than that of frequent sequence mining in se-quence databases. An important limitation of HUSM is that a user-predened minimum tility threshold is used commonly to decide if a sequence is high utility. However, this is not convincing in many real-life applications as sequences may have diferent importance. Another limitation of HUSM is that data in QSDBs are assumed to be precise. But in the real world, collected data such as by sensor maybe uncertain. Thus, this paper proposes a framework for mining high utility-probability sequences (HUPSs) in uncertain QSDBs (UQS-DBs) with multiple minimum utility thresholds using a minimum utility. Two new width and depth pruning strategies are also introduced to early eliminate low utility or low probability sequences as well as their extensions, and to reduce sets of candidate items for extensions during the mining process. Based on these strategies, a novel ecient algorithm named HUPSMT is designed for discovering HUPSs. Finally, an experimental study conducted in both real-life and synthetic UQSDBs shows the performance of HUPSMT in terms of time and memory consumption
Memory efficient location recommendation through proximity-aware representation
Sequential location recommendation plays a huge role in modern life, which
can enhance user experience, bring more profit to businesses and assist in
government administration. Although methods for location recommendation have
evolved significantly thanks to the development of recommendation systems,
there is still limited utilization of geographic information, along with the
ongoing challenge of addressing data sparsity. In response, we introduce a
Proximity-aware based region representation for Sequential Recommendation (PASR
for short), built upon the Self-Attention Network architecture. We tackle the
sparsity issue through a novel loss function employing importance sampling,
which emphasizes informative negative samples during optimization. Moreover,
PASR enhances the integration of geographic information by employing a
self-attention-based geography encoder to the hierarchical grid and proximity
grid at each GPS point. To further leverage geographic information, we utilize
the proximity-aware negative samplers to enhance the quality of negative
samples. We conducted evaluations using three real-world Location-Based Social
Networking (LBSN) datasets, demonstrating that PASR surpasses state-of-the-art
sequential location recommendation method