Shuichiro Haruta

dblp:173/8348 · DBLP profile ↗
← Back
5ranked-venue papers in the field
0as first author
5since 2021 · last 2024
0000-0002-0695-9963ORCID · corroborated

Domains — venue-derived; a paper can count in several

Data Mining & Knowledge Discovery · 2Big Data, Cloud & Distributed Data Systems · 2Information Retrieval & Web Search · 1
YearPublicationVenuePosition
2024 QWalkVec: Node Embedding by Quantum Walk
Rei Sato, Shuichiro Haruta, Kazuhiro Saito, Mori Kurokawa
PAKDD (1)2
2024 Mutual Information-based Preference Disentangling and Transferring for Non-overlapped Multi-target Cross-domain Recommendations
abstract
Building high-quality recommender systems is challenging for new services and small companies, because of their sparse interactions. Cross-domain recommendations (CDRs) alleviate this issue by transferring knowledge from data in external domains. However, most existing CDRs leverage data from only a single external domain and serve only two domains. CDRs serving multiple domains require domain-shared entities (i.e., users and items) to transfer knowledge, which significantly limits their applications due to the hardness and privacy concerns of finding such entities. We therefore focus on a more general scenario, non-overlapped multi-target CDRs (NO-MTCDRs), which require no domain-shared entities and serve multiple domains. Existing methods require domain-shared users to learn user preferences and cannot work on NO-MTCDRs. We hence propose MITrans, a novel mutual information-based (MI-based) preference disentangling and transferring framework to improve recommendations for all domains. MITrans effectively leverages knowledge from multiple domains as well as learning both domain-shared and domain-specific preferences without using domain-shared users. In MITrans, we devise two novel MI constraints to disentangle domain-shared and domain-specific preferences. Moreover, we introduce a module that fuses domain-shared preferences in different domains and combines them with domain-specific preferences to improve recommendations. Our experimental results on two real-world datasets demonstrate the superiority of MITrans in terms of recommendation quality and application range against state-of-the-art overlapped and non-overlapped CDRs.
Zhi Li 0084, Daichi Amagata, Yihong Zhang 0001, Takahiro Hara, Shuichiro Haruta, Kei Yonekawa, Mori Kurokawa
SIGIR5
2023 Unvisited Out-Of-Town POI Recommendation with Simultaneous Learning of Multiple Regions
abstract
In recent years, Point Of Interest (POI) recommendations have been actively studied because of the widespread use of location-based social network services. Out-Of-Town POI recommendation methods recommend POIs outside a user’s residence, such as travel and business trip destinations. Most existing methods require a certain number of past visit sequences at destination regions or can be used only between two specific unidirectional regions. In this study, we propose an Unvisited Out-Of-Town POI Recommendation framework (UOPR), which can recommend POIs for Out-Of-Town regions that have not yet been visited by users. In addition, UOPR can learn users’ visit patterns for multiple regions simultaneously. UOPR takes into account the fact that user’s Out-Of-Town visiting tendencies vary depending on the geographical distance from their residences. It therefore adopts an approach that calculates two scores, one determined by user’s Home-Town visiting tendencies and the other by their Out-Of-Town visiting tendencies, and uses them differently. Furthermore, we propose a mask-input learning and user-embedding creation method that enables learning with enhanced interaction between POI embeddings in an Out-Of-Town POI recommendation environment, where the data are often sparse. UOPR achieves higher recommendation accuracy than existing methods on a dataset collected on a real-world service.
Rikuto Tsubouchi, Takahiro Hara, Kei Yonekawa, Shuichiro Haruta
IEEE Big Data4
2023 Semantic Relation Transfer for Non-overlapped Cross-domain Recommendations
Zhi Li 0084, Daichi Amagata, Yihong Zhang 0001, Takahiro Hara, Shuichiro Haruta, Kei Yonekawa, Mori Kurokawa
PAKDD (3)5
2022 Debiasing Graph Transfer Learning via Item Semantic Clustering for Cross-Domain Recommendations
abstract
Deep learning-based recommender systems may lead to over-fitting when lacking training interaction data. This over-fitting significantly degrades recommendation performances. To address this data sparsity problem, cross-domain recommender systems (CDRSs) exploit the data from an auxiliary source domain to facilitate the recommendation on the sparse target domain. Most existing CDRSs rely on overlapping users or items to connect domains and transfer knowledge. However, matching users is an arduous task and may involve privacy issues when data comes from different companies, resulting in a limited application for the above CDRSs. Some studies develop CDRSs that require no overlapping users and items by transferring learned user interaction patterns. However, they ignore the bias in user interaction patterns between domains and hence suffer from an inferior performance compared with single-domain recommender systems. In this paper, based on the above findings, we propose a novel CDRS, namely semantic clustering enhanced debiasing graph neural recommender system (SCDGN), that requires no overlapping users and items and can handle the domain bias. More precisely, SCDGN semantically clusters items from both domains and constructs a cross-domain bipartite graph generated from item clusters and users. Then, the knowledge is transferred via this cross-domain user-cluster graph from source to the target. Furthermore, we design a debiasing graph convolutional layer for SCDGN to extract unbiased structural knowledge from the cross-domain user-cluster graph. Our Experimental results on three public datasets and a pair of proprietary datasets verify the effectiveness of SCDGN over stateof-the-art models in terms of cross-domain recommendations.
Zhi Li 0084, Daichi Amagata, Yihong Zhang 0001, Takahiro Hara, Shuichiro Haruta, Kei Yonekawa, Mori Kurokawa
IEEE Big Data5