Destination similarity based on implicit user interest

• URL: http://arxiv.org/abs/2102.06687v1
• Date: Fri, 12 Feb 2021 18:45:23 GMT
• Title: Destination similarity based on implicit user interest
• Authors: Hongliu Cao, Eoin Thomas
• Abstract summary: A new similarity method is proposed to measure the destination similarity in terms of implicit user interest. By comparing the proposed method to several other widely used similarity measures in recommender systems, the proposed method achieves a significant improvement on travel data.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: With the digitization of travel industry, it is more and more important to understand users from their online behaviors. However, online travel industry data are more challenging to analyze due to extra sparseness, dispersed user history actions, fast change of user interest and lack of direct or indirect feedbacks. In this work, a new similarity method is proposed to measure the destination similarity in terms of implicit user interest. By comparing the proposed method to several other widely used similarity measures in recommender systems, the proposed method achieves a significant improvement on travel data. Key words: Destination similarity, Travel industry, Recommender System, Implicit user interest

Related papers

• Accelerated Stochastic ExtraGradient: Mixing Hessian and Gradient Similarity to Reduce Communication in Distributed and Federated Learning [50.382793324572845]
  Distributed computing involves communication between devices, which requires solving two key problems: efficiency and privacy. In this paper, we analyze a new method that incorporates the ideas of using data similarity and clients sampling. To address privacy concerns, we apply the technique of additional noise and analyze its impact on the convergence of the proposed method.
  arXiv  Detail & Related papers  (2024-09-22T00:49:10Z)
• Multi-view user representation learning for user matching without personal information [0.0]
  We propose a similarity based multi-view information fusion to learn a better user representation from URLs. The experimental results show that the proposed multi-view user representation learning can take advantage of the complementary information from different views.
  arXiv  Detail & Related papers  (2023-12-22T08:58:42Z)
• When Search Meets Recommendation: Learning Disentangled Search Representation for Recommendation [56.98380787425388]
  We propose a search-Enhanced framework for the Sequential Recommendation (SESRec) SESRec disentangling similar and dissimilar representations within S&R behaviors. Experiments on both industrial and public datasets demonstrate that SESRec consistently outperforms state-of-the-art models.
  arXiv  Detail & Related papers  (2023-05-18T09:04:50Z)
• Improving Recommendation Relevance by simulating User Interest [77.34726150561087]
  We observe that recommendation "recency" can be straightforwardly and transparently maintained by iterative reduction of ranks of inactive items. The basic idea behind this work is patented in a context of online recommendation systems.
  arXiv  Detail & Related papers  (2023-02-03T03:35:28Z)
• Simpson's Paradox in Recommender Fairness: Reconciling differences between per-user and aggregated evaluations [16.053419956606557]
  We argue that two notions of fairness in ranking and recommender systems can lead to opposite conclusions. We reconcile these notions and show that the tension is due to differences in distributions of users where items are relevant. Based on this new understanding, practitioners might be interested in either notions, but might face challenges with the per-user metric.
  arXiv  Detail & Related papers  (2022-10-14T12:43:32Z)
• PARSRec: Explainable Personalized Attention-fused Recurrent Sequential Recommendation Using Session Partial Actions [0.5801044612920815]
  We propose an architecture that relies on common patterns as well as individual behaviors to tailor its recommendations for each person. Our empirical results on Nielsen Consumer Panel dataset indicate that the proposed approach achieves up to 27.9% performance improvement.
  arXiv  Detail & Related papers  (2022-09-16T12:07:43Z)
• Recommending POIs for Tourists by User Behavior Modeling and Pseudo-Rating [3.839157829013354]
  Most tourist visit a few sightseeing spots once and most of these spots have no check-in data from new tourists. Most conventional systems rank sightseeing spots based on their popularity, reputations, and category-based similarities with users' preferences. We propose a mechanism to recommend POIs to tourists.
  arXiv  Detail & Related papers  (2021-10-13T06:21:41Z)
• Recall@k Surrogate Loss with Large Batches and Similarity Mixup [62.67458021725227]
  Direct optimization, by gradient descent, of an evaluation metric is not possible when it is non-differentiable. In this work, a differentiable surrogate loss for the recall is proposed. The proposed method achieves state-of-the-art results in several image retrieval benchmarks.
  arXiv  Detail & Related papers  (2021-08-25T11:09:11Z)
• Out-of-Town Recommendation with Travel Intention Modeling [45.61038400572223]
  Out-of-town recommendation is designed for those users who leave their home-town areas and visit the areas they have never been to before. It is challenging to recommend Point-of-Interests (POIs) for out-of-town users since the out-of-town check-in behavior is determined by not only the user's home-town preference but also the user's travel intention. We propose a TRAvel-INtention-aware Out-of-town Recommendation framework, named TRAINOR.
  arXiv  Detail & Related papers  (2021-01-29T13:14:29Z)
• Learning Transferrable Parameters for Long-tailed Sequential User Behavior Modeling [70.64257515361972]
  We argue that focusing on tail users could bring more benefits and address the long tails issue. Specifically, we propose a gradient alignment and adopt an adversarial training scheme to facilitate knowledge transfer from the head to the tail.
  arXiv  Detail & Related papers  (2020-10-22T03:12:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.