Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/93290
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Applied Mathematicsen_US
dc.creatorWang, Xen_US
dc.creatorGu, Len_US
dc.creatorLee, HWen_US
dc.creatorZhang, Gen_US
dc.date.accessioned2022-06-15T03:42:39Z-
dc.date.available2022-06-15T03:42:39Z-
dc.identifier.issn1570-0755en_US
dc.identifier.urihttp://hdl.handle.net/10397/93290-
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.rights© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021en_US
dc.rightsThis version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use (https://www.springernature.com/gp/open-research/policies/accepted-manuscript-terms), but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: http://dx.doi.org/10.1007/s11128-021-03131-yen_US
dc.subjectContext-aware recommendation systemsen_US
dc.subjectQuantum Fourier transformen_US
dc.subjectQuantum singular value estimationen_US
dc.subjectT-svden_US
dc.titleQuantum context-aware recommendation systems based on tensor singular value decompositionen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.volume20en_US
dc.identifier.issue5en_US
dc.identifier.doi10.1007/s11128-021-03131-yen_US
dcterms.abstractIn this paper, we propose a quantum algorithm for recommendation systems which incorporates the contextual information of users to the personalized recommendation. The preference information of users is encoded in a third-order tensor of dimension N which can be approximated by the truncated tensor singular value decomposition (t-svd) of the subsample tensor. Unlike the classical algorithm that reconstructs the approximated preference tensor using truncated t-svd, our quantum algorithm obtains the recommended product under certain context by measuring the output quantum state corresponding to an approximation of a user’s dynamic preferences. The algorithm achieves the time complexity O(kNpolylog(N)), compared to the classical counterpart with complexity O(kN3) , where k is the truncated tubal rank.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationQuantum information processing, May 2021, v. 20, no. 5, 190en_US
dcterms.isPartOfQuantum information processingen_US
dcterms.issued2021-05-
dc.identifier.scopus2-s2.0-85106901077-
dc.identifier.artn190en_US
dc.description.validate202206 bcfcen_US
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberAMA-0049-
dc.description.fundingSourceRGCen_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTextShenzhen Fundamental Research Funden_US
dc.description.pubStatusPublisheden_US
dc.identifier.OPUS53013984-
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Wang_Quantum_Context-Aware_Recommendation.pdfPre-Published version1.38 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

57
Last Week
0
Last month
Citations as of May 19, 2024

Downloads

78
Citations as of May 19, 2024

SCOPUSTM   
Citations

2
Citations as of May 16, 2024

WEB OF SCIENCETM
Citations

2
Citations as of May 16, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.