
Kei HARADA
| Department of Informatics | Professor | 
| Cluster I (Informatics and Computer Engineering) | Professor | 
| Center for Industrial and Governmental Relations | Professor | 
Researcher Information
Research Activity Information
Award
- Sep. 2025
 Recommender Systems Challenge 2025 (RecSys Challenge 2025)
 2nd Position Award (Academic Track), Kaito Terasaki;Taketo Yoneda;Kiyotakashi Takagawa;Hayato Maruyama;Yongzhi Jin;Hibiki Ayabe;Kei Harada;Kazushi Okamoto
- Jun. 2025
 Comparison of Motion Study and Data Science Methods for Proficiency in Disassembly Task Movement via Motion Capture
 Sullivan Best Paper Award - 2nd Position, Taku Hayashi;Kei Harada;Koki Karube;Munenori Kakehi;Masao Sugi;Tetsuo Yamada
Paper
- Unveiling Key Movements in Disassembly Task through Motion Capture Analysis and Machine Learning
 Taku Hayashi; Kei Harada; Koki Karube; Tetsuo Yamada; Masao Sugi
 Corresponding, Asian Journal of Management Science and Applications, Dec. 2025, Peer-reviwed
 Scientific journal, English
- Book Recommendation System in University Libraries Considering Course Subjects and Users' Learning Situation
 Ryuhei Miyazato; Tetsuro Nishino; Kei Harada
 Corresponding, 情報処理学会論文誌数理モデル化と応用(TOM), 情報処理学会, 18, 1, 1-9, 25 Feb. 2025, Peer-reviwed, 推薦システムは,利用者にとって価値があるアイテムを特定することで,利用者のアイテム探しを補助するシステムである.大学図書館においても,貸出履歴や図書の内容情報を使って利用者に図書を推薦する手法が提案されている.しかし,異なる学習状況や目的を持って図書を探しに訪れる利用者を考慮した図書推薦手法は実現されていない.本研究では,授業と関連した図書に,授業科目や用途,難易度,その他図書の特徴を表すラベルを手作業で付加した蔵書DBを構築し,利用者の希望を選択式で受付けることで,利用者の目的と状況に合った図書を推薦することを可能にした.この手法を実装し,既存システムOPACを比較対象とした被験者実験を行った.その結果,「借りてみたい図書を見つけることができる」,「要望が推薦結果によく反映されている」といった観点において,提案手法がOPACを有意に上回ることが示された.
 Recommendation system is designed to assist users in finding their desired items by identifying users' preference. In university libraries, recommendation methods have been proposed that use borrowing histories and book content information to recommend books to users. However, existing approaches do not adequately consider users' diverse and dynamic learning situations and objectives when recommending books. The purpose of this study is to propose a recommendation method for recommending class-related books in university libraries. In this study, we created a library database that each book is manually labeled with information on relevant course subjects, intended usage, difficulty level, and other characteristics. Allowing users to select their preferences through a simple choice-based interface, we elicit users' preference and recommend books with considering their purpose and current learning needs. We implemented this method and conducted a comparative experiment with OPAC. The results showed that our proposed system significantly outperformed OPAC in terms of the following aspects: whether you could find desired books and you felt that the recommendations reflected your preferences.
 Scientific journal, Japanese
- Generators of Brownian motions on abstract Wiener spaces
 Kei Harada
 Lead, Noncommutative Harmonic Analysis with Applications to Probability II, Institute of Mathematics Polish Academy of Sciences, 135-142, 2010, Peer-reviwed
 International conference proceedings, English
MISC
- Generation and annotation of item usage scenarios in e-commerce using large language models
 Madoka Hagiri; Kazushi Okamoto; Koki Karube; Kei Harada; Atsushi Shibata
 Complementary recommendations suggest combinations of useful items that play
 important roles in e-commerce. However, complementary relationships are often
 subjective and vary among individuals, making them difficult to infer from
 historical data. Unlike conventional history-based methods that rely on
 statistical co-occurrence, we focus on the underlying usage context that
 motivates item combinations. We hypothesized that people select complementary
 items by imagining specific usage scenarios and identifying the needs in such
 situations. Based on this idea, we explored the use of large language models
 (LLMs) to generate item usage scenarios as a starting point for constructing
 complementary recommendation systems. First, we evaluated the plausibility of
 LLM-generated scenarios through manual annotation. The results demonstrated
 that approximately 85% of the generated scenarios were determined to be
 plausible, suggesting that LLMs can effectively generate realistic item usage
 scenarios., 09 Oct. 2025, arXiv:2510.07885
- A Universal Framework for Offline Serendipity Evaluation in Recommender Systems via Large Language Models
 Yu Tokutake; Kazushi Okamoto; Kei Harada; Atsushi Shibata; Koki Karube
 Serendipity in recommender systems (RSs) has attracted increasing attention
 as a concept that enhances user satisfaction by presenting unexpected and
 useful items. However, evaluating serendipitous performance remains challenging
 because its ground truth is generally unobservable. The existing offline
 metrics often depend on ambiguous definitions or are tailored to specific
 datasets and RSs, thereby limiting their generalizability. To address this
 issue, we propose a universally applicable evaluation framework that leverages
 large language models (LLMs) known for their extensive knowledge and reasoning
 capabilities, as evaluators. First, to improve the evaluation performance of
 the proposed framework, we assessed the serendipity prediction accuracy of LLMs
 using four different prompt strategies on a dataset containing user-annotated
 serendipitous ground truth and found that the chain-of-thought prompt achieved
 the highest accuracy. Next, we re-evaluated the serendipitous performance of
 both serendipity-oriented and general RSs using the proposed framework on three
 commonly used real-world datasets, without the ground truth. The results
 indicated that there was no serendipity-oriented RS that consistently
 outperformed across all datasets, and even a general RS sometimes achieved
 higher performance than the serendipity-oriented RS., 25 Aug. 2025, arXiv:2508.17571
- Similarity-Based Supervised User Session Segmentation Method for Behavior Logs
 Yongzhi Jin; Kazushi Okamoto; Kei Harada; Atsushi Shibata; Koki Karube
 In information recommendation, a session refers to a sequence of user actions
 within a specific time frame. Session-based recommender systems aim to capture
 short-term preferences and generate relevant recommendations. However, user
 interests may shift even within a session, making appropriate segmentation
 essential for modeling dynamic behaviors. In this study, we propose a
 supervised session segmentation method based on similarity features derived
 from action embeddings and attributes. We compute the similarity scores between
 items within a fixed-size window around each candidate segmentation point,
 using four types of features: item co-occurrence embeddings, text embeddings of
 titles and brands, and price. These features are used to train supervised
 classifiers (LightGBM, XGBoost, CatBoost, support vector machine, and logistic
 regression) to predict the session boundaries. We construct a manually
 annotated dataset from real user browsing histories and evaluate the
 segmentation performance using F1-score, area under the precision-recall curve
 (PR-AUC), and area under the receiver operating characteristic curve. The
 LightGBM model achieves the best performance, with an F1-score of 0.806 and a
 PR-AUC of 0.831. These results demonstrate the effectiveness of the proposed
 method for session segmentation and its potential to capture dynamic user
 behaviors., 22 Aug. 2025, arXiv:2508.16106
- A Completely Locale-independent Session-based Recommender System by Leveraging Trained Model
 Yu Tokutake; Chihiro Yamasaki; Yongzhi Jin; Ayuka Inoue; Kei Harada
 In this paper, we propose a solution that won the 10th prize in the KDD Cup
 2023 Challenge Task 2 (Next Product Recommendation for Underrepresented
 Languages/Locales). Our approach involves two steps: (i) Identify candidate
 item sets based on co-visitation, and (ii) Re-ranking the items using LightGBM
 with locale-independent features, including session-based features and product
 similarity. The experiment demonstrated that the locale-independent model
 performed consistently well across different test locales, and performed even
 better when incorporating data from other locales into the training., 11 Oct. 2023, CoRR, abs/2310.07281, journals/corr/abs-2310-07281, arXiv:2310.07281
- AIWolfDial 2023: Summary of Natural Language Division of 5th International AIWolf Contest.
 Yoshinobu Kano; Neo Watanabe; Kaito Kagaminuma; Claus Aranha; Jaewon Lee; Benedek Hauer; Hisaichi Shibata; Soichiro Miki; Yuta Nakamura; Takuya Okubo; Soga Shigemura; Rei Ito; Kazuki Takashima; Tomoki Fukuda; Masahiro Wakutani; Tomoya Hatanaka; Mami Uchida; Mikio Abe; Akihiro Mikami; Takashi Otsuki; Zhiyang Qi; Kei Harada; Michimasa Inaba; Daisuke Katagami; Hirotaka Osawa; Fujio Toriumi
 2023, INLG (Generation Challenges), 84-100, English, conf/inlg/KanoWKALHSMNOSITFWHUAMOQHIKOT23
- Imbedding Exotic Hida-Kubo-Takenaka Spaces into usual Hida distributions
 Kei Harada
 We show that a subspace of exotic Hida-Kubo-Takenaka space is naturally
 imbedded into the usual Hida-Kubo-Takenaka space under some conditions. We also
 study on Heat Equations associated with exotic Laplacians, such as L\'evy
 Laplacian., 13 Sep. 2010, arXiv:1009.2369
- The space of tempered distributions as a k-space
 Kei Harada; Hayato Saigo
 In this paper, we investigate the roles of compact sets in the space of
 tempered distributions $\mathscr{S}^{\prime}$. The key notion is "k-spaces",
 which constitute a fairly general class of topological spaces. In a k-space,
 the system of compact sets controls continuous functions and Borel measures.
 Focusing on the k-space structure of $\mathscr{S}^{\prime}$, we prove some
 theorems which seem to be fundamental for infinite dimensional harmonic
 analysis from a new and unified view point. For example, the invariance
 principle of Donsker for the white noise measure is shown in terms of infinite
 dimansional characteristic functions., 08 Sep. 2010, arXiv:1009.1429
Books and other publications
Lectures, oral presentations, etc.
- Heterogeneous Feature Integration for Behavioral Profiles
 Kaito Terasaki; Taketo Yoneda; Kiyotakashi Takagawa; Hayato Maruyama; Yongzhi Jin; Hibiki Ayabe; Kei Harada; Kazushi Okamoto
 Oral presentation, English, RecSys Challenge 2025 Workshop, Peer-reviewed
 22 Sep. 2025
- Visualizing and Improving Assembly Task Using Motion Capture Analysis
 Koki Karube; Masao Sugi; Kei Harada; Tetsuo Yamada
 Oral presentation, English, IISE Annual Conference and Expo 2025, Peer-reviewed
 Jun. 2025
- Comparison of Motion Study and Data Science Methods for Proficiency in Disassembly Task Movement via Motion Capture
 Taku Hayashi; Kei Harada; Koki Karube; Munenori Kakehi; Masao Sugi; Tetsuo Yamada
 Oral presentation, English, The 34rd International Conference on Flexible Automation and Intelligent Manufacturing (FAIM 2025), Peer-reviewed
 Jun. 2025
- 深層学習を用いた物件外観画像による築年代推定法の検討
 綾部 響己; 岡本 一志; 柴田 淳司; 原田 慧; 軽部 幸起
 Oral presentation, Japanese, 第39回人工知能学会全国大会
 May 2025
- 大規模言語モデルによる商品利用シナリオの生成と評価
 羽切 まどか; 岡本 一志; 原田 慧; 柴田 淳司; 軽部 幸起
 Oral presentation, Japanese, 第39回人工知能学会全国大会
 May 2025
- 大規模言語モデルを用いた料理レシピの曖昧表現補完
 上田 茜; 岡本 一志; 原田 慧; 柴田 淳司; 軽部 幸起
 Oral presentation, Japanese, 第39回人工知能学会全国大会
 May 2025
- 柑橘類を対象とした推薦システムの実現に向けた基礎的調査
 細尾 佳意; 岡本 一志; 原田 慧; 柴田 淳司; 軽部 幸起
 Oral presentation, Japanese, 第39回人工知能学会全国大会
 May 2025
- 大規模言語モデルを用いた関係性抽出に基づく小説のアスペクトベース要約手法の提案
 宮里 龍平; Hsin-Tai Wu; 原田 慧; 岡本 一志; 柴田 淳司; 軽部 幸起
 Oral presentation, Japanese, 第39回人工知能学会全国大会
 May 2025
- アスペクトに着目した読者に影響を与える映画レビューの分析
 井上 歩香; 岡本 一志; 柴田 淳司; 原田 慧; 軽部 幸起
 Oral presentation, Japanese, 第17回データ工学と情報マネジメントに関するフォーラム
 Mar. 2025
- 色彩調和に基づくファッションコーディネートの分析
 齋藤 香莉菜; 岡本 一志; 柴田 淳司; 原田 慧; 軽部 幸起
 Oral presentation, Japanese, 第17回データ工学と情報マネジメントに関するフォーラム
 Feb. 2025
- 文字起こしデータを用いたラジオ番組の基礎的調査
 西岡 興平; 岡本 一志; 柴田 淳司; 原田 慧; 軽部 幸起
 Oral presentation, Japanese, 第17回データ工学と情報マネジメントに関するフォーラム
 Feb. 2025
- 築年代推定におけるViTとCNNモデルの比較
 綾部 響己; 岡本 一志; 柴田 淳司; 原田 慧; 軽部 幸起
 Poster presentation, Japanese, IDRユーザフォーラム2024
 Dec. 2024
- 料理レシピの曖昧表現に関する調査
 上田 茜; 岡本 一志; 原田 慧; 柴田 淳司; 軽部 幸起
 Poster presentation, Japanese, IDRユーザフォーラム2024
 Dec. 2024