PAS: A Position-Aware Similarity Measurement for Sequential Recommendation

@article{Zeng2022PASAP,
  title={PAS: A Position-Aware Similarity Measurement for Sequential Recommendation},
  author={Zijie Zeng and Jing Lin and Weike Pan and Zhong Ming and Zhongqi Lu},
  journal={ArXiv},
  year={2022},
  volume={abs/2205.06997}
}
—The common item-based collaborative filtering framework becomes a typical recommendation method when equipped with a certain item-to-item similarity measurement. On one hand, we realize that a well-designed similarity measurement is the key to providing satisfactory recommendation services. On the other hand, similarity measurements designed for sequential recommendation are rarely studied by the recommender systems community. Hence in this paper, we focus on devising a novel similarity… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 33 REFERENCES
Next-Item Recommendation via Collaborative Filtering with Bidirectional Item Similarity
TLDR
A simple yet effective similarity measurement called bidirectional item similarity (BIS) that is able to capture sequential patterns even from noisy data and a compound weighting function that leverages the complementarity between two well-known time-aware weighting functions.
NAIS: Neural Attentive Item Similarity Model for Recommendation
TLDR
This work proposes a neural network model named Neural Attentive Item Similarity model (NAIS), which 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.
Exploiting matrix factorization to asymmetric user similarities in recommendation systems
Deep Item-based Collaborative Filtering for Top-N Recommendation
TLDR
This article proposes a more expressive ICF solution by accounting for the nonlinear and higher-order relationships among items, and treats this solution as a deep variant of ICF, thus term it as DeepICF.
Time weight collaborative filtering
TLDR
This paper presents a novel algorithm to compute the time weights for different items in a manner that will assign a decreasing weight to old data, and uses clustering to discriminate between different kinds of items.
Recommendations Based on Collaborative Filtering by Exploiting Sequential Behaviors
TLDR
A method is proposed to capture the sequential behaviors of users and items, which can help find the set of neighbors that are most influential to the given users (items), and those influential neighbors are successfully applied into the recommendation process based on probabilistic matrix factorization.
Sequence-Aware Recommender Systems
TLDR
A categorization of the corresponding recommendation tasks and goals is proposed, existing algorithmic solutions are summarized, methodological approaches when benchmarking what the authors call sequence-aware recommender systems are discussed, and open challenges in the area are outlined.
Item-based top-N recommendation algorithms
TLDR
This article presents one class of model-based recommendation algorithms that first determines the similarities between the various items and then uses them to identify the set of items to be recommended, and shows that these item-based algorithms are up to two orders of magnitude faster than the traditional user-neighborhood based recommender systems and provide recommendations with comparable or better quality.
Fusing Similarity Models with Markov Chains for Sparse Sequential Recommendation
TLDR
Fossil is proposed, a similarity-based method that outperforms alternative algorithms, especially on sparse datasets, and qualitatively that it captures personalized dynamics and is able to make meaningful recommendations.
FISM: factored item similarity models for top-N recommender systems
TLDR
An item-based method for generating top-N recommendations that learns the item-item similarity matrix as the product of two low dimensional latent factor matrices using a structural equation modeling approach.
...
...