Corpus ID: 235417159

A Large-Scale Rich Context Query and Recommendation Dataset in Online Knowledge-Sharing

@article{Hao2021ALR,
  title={A Large-Scale Rich Context Query and Recommendation Dataset in Online Knowledge-Sharing},
  author={Bin Hao and Min Zhang and Weizhi Ma and Shaoyun Shi and Xinxing Yu and Houzhi Shan and Yiqun Liu and Shaoping Ma},
  journal={ArXiv},
  year={2021},
  volume={abs/2106.06467}
}
Data plays a vital role in machine learning studies. In the research of recommendation, both user behaviors and side information are helpful to model users. So, large-scale real scenario datasets with abundant user behaviors will contribute a lot. However, it is not easy to get such datasets as most of them are only hold and protected by companies. In this paper, a new large-scale dataset collected from a knowledge-sharing platform is presented, which is composed of around 100M interactions… Expand

References

SHOWING 1-10 OF 32 REFERENCES
Adaptive Feature Sampling for Recommendation with Missing Content Feature Values
TLDR
This work proposes a new adaptive "Feature Sampling'' strategy to help train different models to fit distinct scenarios, no matter for cold-start or missing feature value cases, and is the first clear and powerful model that proposed to handle the missing feature values problem in deep neural network frameworks for recommender systems. Expand
Contextual Recommendation based on Text Mining
TLDR
The experimental results demonstrate that 1) IE-based techniques can help create a large scale context data with decent quality from online reviews, at least for restaurant recommendations; 2) context helps recommender systems rank items, however, does not help predict user ratings; 3) simply using context to filter items hurts recommendation performance, while a new probabilistic latent relational model the authors proposed helps. Expand
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. Expand
Context-Aware Recommender Systems for Learning: A Survey and Future Challenges
TLDR
A context framework that identifies relevant context dimensions for TEL applications is presented and an analysis of existing TEL recommender systems along these dimensions is presented, and topics on which further research is needed are outlined. Expand
On Sampled Metrics for Item Recommendation
TLDR
It is shown that sampled metrics are inconsistent with their exact version, in the sense that they do not persist relative statements, and it is suggested that sampling should be avoided for metric calculation, however if an experimental study needs to sample, the proposed corrections can improve the quality of the estimate. Expand
Efficient Neural Matrix Factorization without Sampling for Recommendation
TLDR
This work derives three new optimization methods through rigorous mathematical reasoning, which can efficiently learn model parameters from the whole data with a rather low time complexity, and presents a general framework named ENMF, short for Efficient Neural Matrix Factorization. Expand
One-Class Collaborative Filtering
TLDR
This paper considers the one-class problem under the CF setting, and proposes two frameworks to tackle OCCF, one based on weighted low rank approximation; the other based on negative example sampling. Expand
Loss Aversion in Recommender Systems: Utilizing Negative User Preference to Improve Recommendation Quality
TLDR
This work describes a new recommender algorithm that explicitly models negative user preferences in order to recommend more positive items at the top of recommendation-lists and shows the value of the contextual information provided by negative feedback, and can be extended to signed social networks and link prediction in other networks. Expand
Self-Attentive Sequential Recommendation
TLDR
Extensive empirical studies show that the proposed self-attention based sequential model (SASRec) outperforms various state-of-the-art sequential models (including MC/CNN/RNN-based approaches) on both sparse and dense datasets. Expand
The Adressa dataset for news recommendation
TLDR
This paper introduces the Adressa compact news dataset, which supports all these aspects of news recommendation, and explains the structure of the dataset and discusses how it can be used in advanced news recommender systems. Expand
...
1
2
3
4
...