Abstract

Collaborative filtering (CF) is the prevalent solution to mitigate massive information overload in modern recommender systems. However, it usually suffers from data sparsity and popularity bias problems. Existing studies exploit auxiliary information or data augmentation, requiring additional data collection or expensive computational overheads. Inspired by Mixup used in the classification problem, we propose a simple-yet-effective data augmentation method for CF, namely Collaborative Mixup (CoMix), for implicit feedback datasets. The underlying idea of CoMix is to generate virtual users/items by logically combining random users/items. Unlike the original Mixup, we synthesize virtual users/items to complement weak collaborative signals by distinguishing the intersection and non-overlapping parts between two users/items. Despite its simplicity, extensive experimental results show that various CF models equipped with CoMix consistently improve the base models on four benchmark datasets.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.