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 Han

dblp:264/6394 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
4since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 4 · 2 first-author · 3 since 2021Databases, data management, data science and information retrieval · 3 · 2 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.

Computer networks
1 paper
Physical-layer communications · 94% Cellular and mobile networks · 6%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
MIMO
0.912025
Enhanced Multiuser Space-Time Line Code for Downlink Multiple Antenna Transmission · IEEE Trans. Commun. 2025
Physical-layer communications › beamforming › linear beamforming
MMSE precoding
0.912025
Enhanced Multiuser Space-Time Line Code for Downlink Multiple Antenna Transmission · IEEE Trans. Commun. 2025
Physical-layer communications › multiuser systems
multiuser communication
0.912025
Enhanced Multiuser Space-Time Line Code for Downlink Multiple Antenna Transmission · IEEE Trans. Commun. 2025
Physical-layer communications › MIMO
precoding
0.912025
Enhanced Multiuser Space-Time Line Code for Downlink Multiple Antenna Transmission · IEEE Trans. Commun. 2025
Cellular and mobile networks
downlink transmission
0.312025
Enhanced Multiuser Space-Time Line Code for Downlink Multiple Antenna Transmission · IEEE Trans. Commun. 2025
Physical-layer communications › MIMO
multiuser MIMO
0.312025
Enhanced Multiuser Space-Time Line Code for Downlink Multiple Antenna Transmission · IEEE Trans. Commun. 2025

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

rate balancing · 0.9precoder design · 0.9minimum mean-square error · 0.9
YearPublicationVenuePosition
2025 Enhanced Multiuser Space-Time Line Code for Downlink Multiple Antenna Transmission
abstract
In this paper, a conventional multiuser space-time line code (MSTLC) transmission scheme is enhanced to a new enhanced MSTLC (EMSTLC). By introducing the balancing factors at receivers’ antennas to adjust the achievable rates among users, the EMSTLC precoder and balancing factors are designed in a unified minimum mean square error framework to maximize either sum rate or rate balancing. Numerical results verify that the proposed EMSTLC systems achieve a higher sum rate and better minimum user rate than baseline multiuser transmission methods, including the conventional MSTLC scheme. Furthermore, the designed low-complexity algorithms can significantly reduce the computational complexity of the EMSTLC system.
Yundong Kim, Sumin Han, Jingon Joung, Juyeop Kim, Jian Zhao 0013, Jihoon Choi
IEEE Trans. Commun.2
2024 A systematic approach for learning imbalanced data: enhancing zero-inflated models through boosting
abstract
Abstract In this paper, we propose systematic approaches for learning imbalanced data based on a two-regime process: regime 0, which generates excess zeros (majority class), and regime 1, which contributes to generating an outcome of one (minority class). The proposed model contains two latent equations: a split probit (logit) equation in the first stage and an ordinary probit (logit) equation in the second stage. Because boosting improves the accuracy of prediction versus using a single classifier, we combined a boosting strategy with the two-regime process. Thus, we developed the zero-inflated probit boost (ZIPBoost) and zero-inflated logit boost (ZILBoost) methods. We show that the weight functions of ZIPBoost have the desired properties for good predictive performance. Like AdaBoost, the weight functions upweight misclassified examples and downweight correctly classified examples. We show that the weight functions of ZILBoost have similar properties to those of LogitBoost. The algorithm will focus more on examples that are hard to classify in the next iteration, resulting in improved prediction accuracy. We provide the relative performance of ZIPBoost and ZILBoost, which rely on the excess kurtosis of the data distribution. Furthermore, we show the convergence and time complexity of our proposed methods. We demonstrate the performance of our proposed methods using a Monte Carlo simulation, mergers and acquisitions (M&A) data application, and imbalanced datasets from the Keel repository. The results of the experiments show that our proposed methods yield better prediction accuracy compared to other learning algorithms.
Yeasung Jeong, Young Woong Park, Sumin Han
Mach. Learn.4
2024 Observation weights matching approach for causal inference
Sumin Han, Hyeoncheol Baik, Yeasung Jeong, Young Woong Park
Pattern Recognit.2
2023 Enhancing Spatio-temporal Traffic Prediction through Urban Human Activity Analysis
abstract
Traffic prediction is one of the key elements to ensure the safety and convenience of citizens. Existing traffic prediction models primarily focus on deep learning architectures to capture spatial and temporal correlation. They often overlook the underlying nature of traffic. Specifically, the sensor networks in most traffic datasets do not accurately represent the actual road network exploited by vehicles, failing to provide insights into the traffic patterns in urban activities. To overcome these limitations, we propose an improved traffic prediction method based on graph convolution deep learning algorithms. We leverage human activity frequency data from National Household Travel Survey to enhance the inference capability of a causal relationship between activity and traffic patterns. Despite making minimal modifications to the conventional graph convolutional recurrent networks and graph convolutional transformer architectures, our approach achieves state-of-the-art performance without introducing excessive computational overhead.
Sumin Han, Youngjun Park, Jisun An, Dongman Lee
CIKM1
2020 Exploring Commercial Gentrification using Instagram Data
abstract
Commercial gentrification refers to the replacement of low-value businesses like small local stores into high-value businesses like boutiques and chain stores. A handful of research efforts have been made to identify gentrification and their change by leveraging social media. However, their approaches lack in inferring how much commercial gentrification is developed in a target area and how long it has taken for the area to get to that phase. In this paper, we propose a novel scheme to estimate the commercial gentrification status of a target area and its development in terms of time and geographic dispersion using Instagram data. For this, we define our commercial gentrification phase criteria based on the conceptual model from the urban study. Then, we extract social features from both images and texts of Instagram posts, and leverage regression models to infer the commercial gentrification phase of a target area at the monthly timestamp. We also measure how geographical dispersion of geo-tagged Instagram posts matches the boutiques, which is the physical variable that has the strongest correlation with the commercial gentrification. Evaluation results show that our method yields a good quality of estimation compared to the ground truth. This assures that our method could be a meaningful tool for urban planners and policymakers to investigate and manage commercial gentrification.
Sumin Han, Dasom Hong, Dongman Lee
ASONAM1
2020 Human Activity Recognition Using Semi-supervised Multi-modal DEC for Instagram Data
Sumin Han, Heesuk Son, Dongman Lee
PAKDD (1)2