Open Research will be unavailable from 10.15am - 11am on Saturday 14th March 2026 AEDT due to scheduled maintenance.
 

A Universal Sets-level Optimization Framework for Next Set Recommendation

dc.contributor.authorLiu, Yulien
dc.contributor.authorLiu, Minen
dc.contributor.authorWalder, Christianen
dc.contributor.authorXie, Lexingen
dc.date.accessioned2025-05-23T01:15:46Z
dc.date.available2025-05-23T01:15:46Z
dc.date.issued2024-10-21en
dc.description.abstractNext Set Recommendation (NSRec), encompassing related tasks such as next basket recommendation and temporal sets prediction, stands as a trending research topic. Although numerous attempts have been made on this topic, there are certain drawbacks: (i) Existing studies are still confined to utilizing objective functions commonly found in Next Item Recommendation (NIRec), such as binary cross entropy and BPR, which are calculated based on individual item comparisons; (ii) They place emphasis on building sophisticated learning models to capture intricate dependency relationships across sequential sets, but frequently overlook pivotal dependency in their objective functions; (iii) Diversity factor within sequential sets is frequently overlooked. In this research, we endeavor to unveil a universal and Sets-level optimization framework for Next Set Recommendation (SNSRec), offering a holistic fusion of diversity distribution and intricate dependency relationships within temporal sets. To realize this, the following contributions are made: (i) We directly model the temporal set in a sequence as a cohesive entity, leveraging the Structured Determinantal Point Process (SDPP), wherein the probabilistic DPP distribution prioritizes collections of structures (sequential sets) instead of individual items; (ii) We introduce a co-occurrence representation to discern and acknowledge the importance of different sets; (iii) We propose a sets-level optimization criterion, which integrates the diversity distribution and dependency relations across the entire sequence of sets, guiding the model to recommend relevant and diversified set. Extensive experiments on real-world datasets show that our approach consistently outperforms previous methods on both relevance and diversity.en
dc.description.sponsorshipThis work is supported by high performance computing center of Qinghai University.en
dc.description.statusPeer-revieweden
dc.format.extent11en
dc.identifier.isbn9798400704369en
dc.identifier.issn2155-0751en
dc.identifier.scopus85210024583en
dc.identifier.urihttp://www.scopus.com/inward/record.url?scp=85210024583&partnerID=8YFLogxKen
dc.identifier.urihttps://hdl.handle.net/1885/733750700
dc.language.isoenen
dc.publisherAssociation for Computing Machinery (ACM)en
dc.relation.ispartofCIKM 2024 - Proceedings of the 33rd ACM International Conference on Information and Knowledge Managementen
dc.relation.ispartofseries33rd ACM International Conference on Information and Knowledge Management, CIKM 2024en
dc.relation.ispartofseriesInternational Conference on Information and Knowledge Management, Proceedingsen
dc.rightsPublisher Copyright: © 2024 ACM.en
dc.subjectnext set predictionen
dc.subjectoptimization approachen
dc.subjectsdppsen
dc.titleA Universal Sets-level Optimization Framework for Next Set Recommendationen
dc.typeConference paperen
dspace.entity.typePublicationen
local.bibliographicCitation.lastpage1554en
local.bibliographicCitation.startpage1544en
local.contributor.affiliationLiu, Yuli; Qinghai Universityen
local.contributor.affiliationLiu, Min; Qinghai Universityen
local.contributor.affiliationWalder, Christian; Alphabet Inc.en
local.contributor.affiliationXie, Lexing; School of Computing, ANU College of Systems and Society, The Australian National Universityen
local.identifier.doi10.1145/3627673.3679610en
local.identifier.pure8b80e582-830c-41a8-a65f-f911771b434den
local.identifier.urlhttps://www.scopus.com/pages/publications/85210024583en
local.type.statusPublisheden

Downloads