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

Sumin Cho

dblp:133/2326 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
2since 2021 · last 2025
0009-0008-1506-5807ORCID · corroborated

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Computer networks · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author

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.

Artificial intelligence
1 paper
Optimization for machine learning · 67% Transfer learning and domain adaptation · 33%
Network and information security
1 paper
Web and mobile security · 50% Malware analysis · 50%
Databases, data mining, and information retrieval
1 paper
Web and social media mining · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation
domain generalization
0.912025
One-Step Generalization Ratio Guided Optimization for Domain Generalization · ICML 2025
Machine learning › Optimization for machine learning › multi-task optimization
gradient alignment
0.912025
One-Step Generalization Ratio Guided Optimization for Domain Generalization · ICML 2025
Machine learning › Optimization for machine learning
gradient-based optimization
0.912025
One-Step Generalization Ratio Guided Optimization for Domain Generalization · ICML 2025
Web and social media mining
user behavior analysis
0.212023
Evolving Bots: The New Generation of Comment Bots and their Underlying Scam Campaigns in YouTube · IMC 2023

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

measurement study · 1.3bot detection · 1.3preconditioning · 0.9one-step generalization ratio · 0.9dropout · 0.9
YearPublicationVenuePosition
2025 One-Step Generalization Ratio Guided Optimization for Domain Generalization
abstract
Domain Generalization (DG) aims to train models that generalize to unseen target domains but often overfit to domain-specific features, known as undesired correlations. Gradient-based DG methods typically guide gradients in a dominant direction but often inadvertently reinforce spurious correlations. Recent work has employed dropout to regularize overconfident parameters, but has not explicitly adjusted gradient alignment or ensured balanced parameter updates. We propose GENIE (Generalization-ENhancing Iterative Equalizer), a novel optimizer that leverages the One-Step Generalization Ratio (OSGR) to quantify each parameter's contribution to loss reduction and assess gradient alignment. By dynamically equalizing OSGR via a preconditioning factor, GENIE prevents a small subset of parameters from dominating optimization, thereby promoting domain-invariant feature learning. Theoretically, GENIE balances convergence contribution and gradient alignment among parameters, achieving higher OSGR while retaining SGD's convergence rate. Empirically, it outperforms existing optimizers and enhances performance when integrated with various DG and single-DG methods.
Sumin Cho, Kwangsu Kim
ICML1
2023 Evolving Bots: The New Generation of Comment Bots and their Underlying Scam Campaigns in YouTube
abstract
This paper presents a pioneering investigation into a novel form of scam advertising method on YouTube, termed "social scam bots'' (SSBs). These bots have evolved to emulate benign user behavior by posting comments and engaging with other users, oftentimes appearing prominently among the top rated comments. We analyzed the YouTube video comments and proposed a method to identify SSBs and extract the underlying scam domains. Our study revealed 1,134 SSBs promoting 72 scam campaigns responsible for infecting 31.73% of crawled videos. Further investigation revealed that SSBs exhibit advances that surpass traditional bots. Notably, they targeted specific audience by aligning scam campaigns with related video content, effectively leveraging the YouTube recommendation algorithm. We monitored these SSBs over a period of six months, enabling us to evaluate the effectiveness of YouTube's mitigation efforts. We also uncovered various strategies they use to evade mitigation attempts, including a novel strategy called "self-engagement," aimed at boosting their comment ranking. By shedding light on the phenomenon of SSBs and their evolving tactics, our study aims to raise awareness and contribute to the prevention of these malicious actors, ultimately fostering a safer online platform.
Seung Ho Na, Sumin Cho, Seungwon Shin 0001
IMC2
2013 Incremental Online Learning of Robot Behaviors From Selected Multiple Kinesthetic Teaching Trials
abstract
This paper presents a new approach to the incremental online learning of behaviors by a robot from multiple kinesthetic teaching trials. The approach enables a robot to refine and reproduce a specific behavior every time a new teaching trial is provided and to decide autonomously whether to accept or reject each trial. The robot neglects bad teaching trials and learns a behavior based on adequate teaching trials. The framework of this approach consists of the projection of motion data to a latent space and the description of motion data in a Gaussian mixture model (GMM). To realize the incremental online learning, the latent space and the GMM are refined incrementally after each proper teaching trial. The trial data are discarded after being used. The number of Gaussian components in the GMM is not initially fixed but is autonomously selected by the robot over the trials. The proposed method is more suitable for practical human-robot interaction. The experiments with a humanoid robot show the feasibility of the approach. We demonstrate that the robot can incrementally refine and reproduce learned behaviors that accurately represent the essential characteristics of the teaching trials through our learning algorithm and that it can reject erroneous teaching trials to improve learning performance.
Sumin Cho, Sungho Jo
IEEE Trans. Syst. Man Cybern. Syst.1