Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Byounggyu Lew

dblp:326/8294 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0002-2597-7614ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 77% Web and social media mining · 23%
Artificial intelligence
1 paper
Trustworthy machine learning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
content moderation
0.712023
Reliable Decision from Multiple Subtasks through Threshold Optimization: Content Moderation in the Wild · WSDM 2023
Information retrieval › retrieval evaluation
threshold optimization
0.712023
Reliable Decision from Multiple Subtasks through Threshold Optimization: Content Moderation in the Wild · WSDM 2023
Web and social media mining › content moderation
harmful content detection
0.212023
Reliable Decision from Multiple Subtasks through Threshold Optimization: Content Moderation in the Wild · WSDM 2023

Methods — techniques the papers use, named apart from their topics

threshold optimization · 1.3
YearPublicationVenuePosition
2023 Reliable Decision from Multiple Subtasks through Threshold Optimization: Content Moderation in the Wild
abstract
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.
Donghyun Son, Byounggyu Lew, Kwanghee Choi, Yongsu Baek, Beomjun Shin, Sungjoo Ha, Buru Chang
WSDM2