Buru Chang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Buru Chang has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Beomsu Kim
Hyperconnect, South Korea
3 shared publications Enkhbayar Erdenee
2 shared publications- Seokjun Seo
Department of Computer Science and Engineering, Seoul National University, Seoul, Republic of Korea
2 shared publications - Seungju Han
Machine Learning TU, Samsung Advanced Institute of Technology, Suwon, Republic of Korea
2 shared publications - Beomjun Shin
Match Group, Dallas, TX, USA
1 shared publication - Byounggyu Lew
Hyperconnect, Seoul, Republic of Korea
1 shared publication
Latest Publications
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 320-328
Improving Rare Medication Recommendation with Counterfactual Data Augmentation and Large Language Models
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 320-328
Open AccessImproving Rare Medication Recommendation with Counterfactual Data Augmentation and Large Language Models
- Open Access
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1697-1706
Review-driven Personalized Preference Reasoning with Large Language Models for Recommendation
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1697-1706
Open AccessReview-driven Personalized Preference Reasoning with Large Language Models for Recommendation
- Open Access
- 1 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1701-1721
Exploring Intervention Techniques to Alleviate Negative Emotions during Video Content Moderation Tasks as a Worker-centered Task Design
Videos are dynamic and multi-modal compared to other types of content, making automatic filtering difficult, which is why content moderators play a crucial role. However, video content moderators are exposed to more profound emotional labor because videos contain rich visual information, sometimes including even harmful content, such as violent or terrifying scenes. In this work, we explore the effect of six intervention techniques on alleviating negative emotions during video content moderation tasks. We conducted one online crowdsourcing experiment and two controlled user studies to find out that (i) interleaving with positive videos or (ii) cartoonization could significantly reduce negative emotions in the moderators. Participants reported that the advantages of these approaches are in helping reduce negative emotions at the time of moderation while existing approaches focus on post-task activities (e.g., relaxation, talking with others, or getting a hobby). We discuss the applicability of our findings to broader tasks, including improvement in intervention techniques.
- 1 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1701-1721
Open AccessExploring Intervention Techniques to Alleviate Negative Emotions during Video Content Moderation Tasks as a Worker-centered Task Design
Videos are dynamic and multi-modal compared to other types of content, making automatic filtering difficult, which is why content moderators play a crucial role. However, video content moderators are exposed to more profound emotional labor because videos contain rich visual information, sometimes including even harmful content, such as violent or terrifying scenes. In this work, we explore the effect of six intervention techniques on alleviating negative emotions during video content moderation tasks. We conducted one online crowdsourcing experiment and two controlled user studies to find out that (i) interleaving with positive videos or (ii) cartoonization could significantly reduce negative emotions in the moderators. Participants reported that the advantages of these approaches are in helping reduce negative emotions at the time of moderation while existing approaches focus on post-task activities (e.g., relaxation, talking with others, or getting a hobby). We discuss the applicability of our findings to broader tasks, including improvement in intervention techniques.
- Open Access
- 27 February 2023
- Published by Association for Computing Machinery (ACM)
- p. 285-293
Reliable Decision from Multiple Subtasks through Threshold Optimization: Content Moderation in the Wild
Social media platforms struggle to protect users from harmful content through content moderation. These platforms have recently leveraged machine learning models to cope with the vast amount of user-generated content daily. Since moderation policies vary depending on countries and types of products, it is common to train and deploy the models per policy. However, this approach is highly inefficient, especially when the policies change, requiring dataset re-labeling and model re-training on the shifted data distribution. To alleviate this cost inefficiency, social media platforms often employ third-party content moderation services that provide prediction scores of multiple subtasks, such as predicting the existence of underage personnel, rude gestures, or weapons, instead of directly providing final moderation decisions. However, making a reliable automated moderation decision from the prediction scores of the multiple subtasks for a specific target policy has not been widely explored yet. In this study, we formulate real-world scenarios of content moderation and introduce a simple yet effective threshold optimization method that searches the optimal thresholds of the multiple subtasks to make a reliable moderation decision in a cost-effective way. Extensive experiments demonstrate that our approach shows better performance in content moderation compared to existing threshold optimization methods and heuristics.
- 27 February 2023
- Published by Association for Computing Machinery (ACM)
- p. 285-293
Open AccessReliable Decision from Multiple Subtasks through Threshold Optimization: Content Moderation in the Wild
Social media platforms struggle to protect users from harmful content through content moderation. These platforms have recently leveraged machine learning models to cope with the vast amount of user-generated content daily. Since moderation policies vary depending on countries and types of products, it is common to train and deploy the models per policy. However, this approach is highly inefficient, especially when the policies change, requiring dataset re-labeling and model re-training on the shifted data distribution. To alleviate this cost inefficiency, social media platforms often employ third-party content moderation services that provide prediction scores of multiple subtasks, such as predicting the existence of underage personnel, rude gestures, or weapons, instead of directly providing final moderation decisions. However, making a reliable automated moderation decision from the prediction scores of the multiple subtasks for a specific target policy has not been widely explored yet. In this study, we formulate real-world scenarios of content moderation and introduce a simple yet effective threshold optimization method that searches the optimal thresholds of the multiple subtasks to make a reliable moderation decision in a cost-effective way. Extensive experiments demonstrate that our approach shows better performance in content moderation compared to existing threshold optimization methods and heuristics.
- Open Access
- 1 January 2022
- Published by Association for Computational Linguistics (ACL)
- p. 5114-5132
Meet Your Favorite Character: Open-domain Chatbot Mimicking Fictional Characters with only a Few Utterances
Seungju Han, Beomsu Kim, Jin Yong Yoo, Seokjun Seo, Sangbum Kim, Enkhbayar Erdenee, Buru Chang. Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. 2022.
- 1 January 2022
- Published by Association for Computational Linguistics (ACL)
- p. 5114-5132
Open AccessMeet Your Favorite Character: Open-domain Chatbot Mimicking Fictional Characters with only a Few Utterances
Seungju Han, Beomsu Kim, Jin Yong Yoo, Seokjun Seo, Sangbum Kim, Enkhbayar Erdenee, Buru Chang. Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. 2022.
- Open Access
- 1 January 2022
- Published by Association for Computational Linguistics (ACL)
- p. 218-230
Understanding and Improving the Exemplar-based Generation for Open-domain Conversation
Seungju Han, Beomsu Kim, Seokjun Seo, Enkhbayar Erdenee, Buru Chang. Proceedings of the 4th Workshop on NLP for Conversational AI. 2022.
- 1 January 2022
- Published by Association for Computational Linguistics (ACL)
- p. 218-230
Open AccessUnderstanding and Improving the Exemplar-based Generation for Open-domain Conversation
Seungju Han, Beomsu Kim, Seokjun Seo, Enkhbayar Erdenee, Buru Chang. Proceedings of the 4th Workshop on NLP for Conversational AI. 2022.
- 1 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 75-84
Embedding Normalization: Significance Preserving Feature Normalization for Click-Through Rate Prediction
Normalization techniques are known to provide faster model convergence and good generalization performance, having achieved great success in computer vision and natural language processing. Recently, several deep neural network-based click-through rate (CTR) prediction models have applied such normalization techniques to their deep network components to make model training stable. However, we observe that applying existing normalization techniques (e.g. Batch Normalization and Layer Normalization) to feature embedding of the models leads to the degradation of model performance. In this study, we conjecture that existing normalization techniques can easily ignore the significance of each feature embedding, leading to sub-optimal performance. To support our claim, we theoretically show that existing normalization techniques tend to equalize the norm of individual feature embedding. To overcome this limitation, we propose a theory-inspired normalization technique, called Embedding Normalization, which not only makes model training stable but also improves the performance of CTR prediction models by preserving the significance of each feature embedding. Through extensive experiments on various real-world CTR prediction datasets, we show that our proposed normalization technique leads to faster model convergence and achieves better or comparable performance than other normalization techniques. Especially, our Embedding Normalization is effective in not only deep neural network-based CTR prediction models but also shallow CTR prediction models that do not utilize deep neural network components.
- 1 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 75-84
Embedding Normalization: Significance Preserving Feature Normalization for Click-Through Rate Prediction
Normalization techniques are known to provide faster model convergence and good generalization performance, having achieved great success in computer vision and natural language processing. Recently, several deep neural network-based click-through rate (CTR) prediction models have applied such normalization techniques to their deep network components to make model training stable. However, we observe that applying existing normalization techniques (e.g. Batch Normalization and Layer Normalization) to feature embedding of the models leads to the degradation of model performance. In this study, we conjecture that existing normalization techniques can easily ignore the significance of each feature embedding, leading to sub-optimal performance. To support our claim, we theoretically show that existing normalization techniques tend to equalize the norm of individual feature embedding. To overcome this limitation, we propose a theory-inspired normalization technique, called Embedding Normalization, which not only makes model training stable but also improves the performance of CTR prediction models by preserving the significance of each feature embedding. Through extensive experiments on various real-world CTR prediction datasets, we show that our proposed normalization technique leads to faster model convergence and achieves better or comparable performance than other normalization techniques. Especially, our Embedding Normalization is effective in not only deep neural network-based CTR prediction models but also shallow CTR prediction models that do not utilize deep neural network components.