Leveraging LightGBM Ranker for Efficient Large-Scale News Recommendation Systems

This study addresses the news recommendation task presented by Ekstra Bladet in the ACM RecSys Challenge 2024. The task aims to predict which articles users are likely to click on from a list of candidate articles, by leveraging users’ browsing history, personal information, article details, and session information. Our approach is centered around a LightGBM Ranker model. Various features were used, including user, article, and session information, as well as their interactions. Additionally, embeddings were created from users’ browsing history and news article texts, and their cosine similarities were used as additional features. Appropriate validating methods using time series were explored, and effective data sampling and ensemble methods were also proposed to fit the data within limited memory. Finally, the final model was created by performing a weighted ensemble using multiple periods and random seeds. This method achieved high performance with AUC of 0.8169. As a result, an 8th place finish was achieved among around 200 participating teams. The code is available at https://github.com/tetsuro731/RecSys-Challenge-2024-tetsuro731.

Authors

Institutions

Publication Details

Published
2024-10-11
DOI
https://doi.org/10.1145/3687151.3687156
Citations
3
Primary Topic
Text and Document Classification Technologies
Type
article
Field-Weighted Citation Impact
1.04
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Leveraging LightGBM Ranker for Efficient Large-Scale News Recommendation Systems

Yosuke Yamagishi, Tetsuro Sugiura, Yodai Kishimoto
3 citations
Text and Document Classification Technologies
1.04
article

Leveraging LightGBM Ranker for Efficient Large-Scale News Recommendation Systems

Yosuke Yamagishi, Tetsuro Sugiura, Yodai Kishimoto
article en
3 citations

Abstract

This study addresses the news recommendation task presented by Ekstra Bladet in the ACM RecSys Challenge 2024. The task aims to predict which articles users are likely to click on from a list of candidate articles, by leveraging users’ browsing history, personal information, article details, and session information. Our approach is centered around a LightGBM Ranker model. Various features were used, including user, article, and session information, as well as their interactions. Additionally, embeddings were created from users’ browsing history and news article texts, and their cosine similarities were used as additional features. Appropriate validating methods using time series were explored, and effective data sampling and ensemble methods were also proposed to fit the data within limited memory. Finally, the final model was created by performing a weighted ensemble using multiple periods and random seeds. This method achieved high performance with AUC of 0.8169. As a result, an 8th place finish was achieved among around 200 participating teams. The code is available at https://github.com/tetsuro731/RecSys-Challenge-2024-tetsuro731.

Hiroshima Cosmopolitan University (JP), The University of Tokyo (JP)
Openalex Percentile: Top 19%
Text and Document Classification Technologies
1.04
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.