Mori Kurokawa

Mori Kurokawa

Auto-generated profile, based on publicly available information

Mori Kurokawa

Division KDDI Research, Inc 2-1-15 Ohara Fujimino-shi 356-8502 Saitama Japan

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

10 July 2024
Verified
Conference Paper
Open access
ZLZhi Li
Zhi Li
DADaichi Amagata
Daichi Amagata
YZYihong Zhang
Yihong Zhang
Takahiro HaraTakahiro Hara
Takahiro Hara
SHShuichiro Haruta
Shuichiro Haruta
MKMori Kurokawa
Mori Kurokawa
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.

25 April 2024
Verified
Book Chapter
Closed access
PDF file
RSRei Sato
Rei Sato
SHShuichiro Haruta
Shuichiro Haruta
KSKazuhiro Saito
Kazuhiro Saito
MKMori Kurokawa
Mori Kurokawa

13 May 2019
Verified
Conference Paper
Open access
PDF file
YLYuan Lyu
Yuan Lyu
DADaichi Amagata
Daichi Amagata
TMTakuya Maekawa
Takuya Maekawa
Takahiro HaraTakahiro Hara
Takahiro Hara
HNHao Niu
Hao Niu
MKMori Kurokawa
Mori Kurokawa

12 June 2023
Verified
Conference Paper
Open access
TKTatsuya Konishi
Tatsuya Konishi
SHShuichiro Haruta
Shuichiro Haruta
MKMori Kurokawa
Mori Kurokawa
KTKenta Tsukatsune
Kenta Tsukatsune
YMYuto Mizutani
Yuto Mizutani
COChihiro Ono
Chihiro Ono
In this paper, we propose CG-GNN, a novel compiled graphs-based feature extraction method for Enterprise Social Networks (ESNs). For the provider of ESNs, extracting features from a given social graph is essential. However, since the amount of data available for a single enterprise is often limited, it is necessary to utilize data from other enterprises. We hypothesize that each enterprise has its own enterprise-specific features, while there is a general structure underlying in all enterprises. To reflect the hypothesis, our approach introduces “compiled graphs” to capture enterprise-specific features by mapping them through functions dedicated to that enterprise. The graphs are then handled by Graph Neural Networks (GNNs) that are commonly used across all enterprises to extract general structural information. Therefore, the obtained representations by CG-GNN are balanced in terms of enterprise-specific and enterprise-generic characteristics. Through experiments with private and publicly available datasets, we show that CG-GNN outperforms baselines by a large margin. In a practical scenario, we compute the ideal input of the proposed method for the purpose of ESNs revitalization. This experiment also demonstrates its feasibility and we believe the results are useful for many ESN providers.

12 October 2022
Verified
Conference Paper
Open access
KYKei Yonekawa
Kei Yonekawa
KSKazuhiro Saito
Kazuhiro Saito
MKMori Kurokawa
Mori Kurokawa
It is required to detect distribution shift in order to prevent a machine learning model from performance degradation, and human-mediated data analysis from erroneous conclusions. For the purpose of comparing between unknown distributions of high-dimensional data, histograms are suitable density estimators due to its computational efficiency. It is important for histograms for distribution shift detection to have uniform density, which has been demonstrated in existing tree-based or cluster-based histograms. However, existing histograms do not consider generalization capability to out-of-sample data, resulting in degraded detection performance at test time. In this paper, we propose a neural-based histogram for distribution shift detection, which generalizes well to out-of-sample data. The bins of histogram are determined by a model trained to discriminate between a handful reference instances, which reflects their underlying distribution. Due to the batch-wise maximum entropy regularizer calculated from a bootstrap sample, the bins as a subset of the feature space partitioned by the decision boundaries of the model generalize, and thus the histogram keeps its density uniform for out-of-sample data. We evaluate our method on distribution shift detection task using multi-domain real-world datasets. The results show that our method outperforms state-of-the-art histogram-based methods.