Hyuk-Gyu Park

Prof. Hyuk-Gyu Park


Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 January 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
HPHyuk-Gyu Park
Hyuk-Gyu Park
DKDong-Ki Kang
Dong-Ki Kang
Recently, renewable energy has emerged as an attractive means to reduce energy consumption costs for deep learning (DL) job processing in modern GPU-based clusters. In this paper, we propose a novel Renewable-Aware Frequency Scaling (RA-FS) approach for energy-efficient DL clusters. We have developed a real-time GPU core and memory frequency scaling method that finely tunes the training performance of DL jobs while maximizing renewable energy utilization. We introduce quantitative metrics: Deep Learning Job Requirement (DJR) and Deep Learning Job Completion per Slot (DJCS) to accurately evaluate the service quality of DL job processing. Additionally, we present a log-transformation technique to convert our non-convex optimization problem into a solvable one, ensuring the rigorous optimality of the derived solution. Through experiments involving deep neural network (DNN) model training jobs such as SqueezeNet, PreActResNet, and SEResNet on NVIDIA GPU devices like RTX3060, RTX3090, and RTX4090, we validate the superiority of our RA-FS approach. The experimental results show that our approach significantly improves performance requirement satisfaction by about 71% and renewable energy utilization by about 31% on average, compared to recent competitors.

20 March 2025 in Electronics
Verified
Journal Article
Open access
PDF file
HPHyuk-Gyu Park
Hyuk-Gyu Park
KSKwang Seong Shin
Kwang Seong Shin
Jong-Chan KimJong-Chan Kim
Jong-Chan Kim
Graphimages, which represent data structures through nodes and edges, present significant challenges for clustering due to their intricate topological properties. Traditional clustering algorithms, such as K-means and Density-Based Spatial Clustering of Applications with Noise (DBSCAN), often struggle to effectively capture both spatial and structural relationships within graph images. To overcome these limitations, we propose a novel two-stage clustering approach that integrates conventional clustering techniques with graph-based methodologies to enhance both accuracy and efficiency. In the first stage, a distance- or density-based clustering algorithm (e.g., K-means or DBSCAN) is applied to generate initial cluster formations. In the second stage, these clusters are refined using spectral clustering or community detection techniques to better preserve and exploit topological features. We evaluate our approach using a dataset of 8118 graph images derived from depth measurements taken at various angles. The experimental results demonstrate that our method surpasses single-method clustering approaches in terms of the silhouette score, Calinski-Harabasz index (CHI), and modularity. The silhouette score measures how similar an object is to its own cluster compared to other clusters, while the CHI, also known as the Variance Ratio Criterion, evaluates cluster quality based on the ratio of between-cluster dispersion to within-cluster dispersion. Modularity, a metric commonly used in graph-based clustering, assesses the strength of division of a network into communities. Furthermore, qualitative analysis through visualization confirms that the proposed two-stage clustering approach more effectively differentiates structural similarities within graph images. These findings underscore the potential of hybrid clustering techniques for various applications, including three-dimensional (3D) measurement analysis, medical imaging, and social network analysis.

4 August 2026 in Electronics
Verified
Journal Article
Open access
PDF file
DWDong-Hyun Won
Dong-Hyun Won
HPHyuk-Gyu Park
Hyuk-Gyu Park
KSKwang Seong Shin
Kwang Seong Shin
Labeling images is expensive, but unlabeled data is abundant. Semi-supervised learning (SSL) addresses this gap, though the dominant pseudo-labeling methods can suffer from confirmation bias—reinforcing their own confident-but-wrong predictions—most severely when labels are scarcest. Under a controlled, reproducible compute-constrained protocol on CIFAR-10, SVHN, and CIFAR-100, we examine which ingredients of consistency-based SSL actually help when as few as four labels per class are available. We propose CCM (Confidence-Calibrated Consistency Matching)—a per-class curriculum threshold, a dual strong-view consistency loss, and a smooth confidence weighting that softly admits borderline pseudo-labels—together with a unified view in which FixMatch, FlexMatch, SoftMatch, and CCM instantiate a single generalized weighting function. On CIFAR-10 with 40 labels, CCM reaches 35.14%, a significant improvement over the FlexMatch design it directly extends (+3.30 percentage points (pp), paired t-test p = 0.001). SoftMatch, re-trained under the identical budget, performs better still at the two smallest budgets (37.04% at 40 labels, p = 0.049), while CCM leads numerically at 4000 labels: the two smooth-weighting designs top the extreme-scarcity board—convergent evidence that the smoothness of the weighting function, more than the placement of its threshold, is the decisive design axis. We also report a negative result: cross-view agreement helps neither as an admission gate nor as reliability reweighting, reducing accuracy by up to 4.37 pp; agreement is a positive correctness signal, but its absolute level (approximately 44% correct among agreeing pseudo-labels) is too low to filter on safely. Curriculum thresholding, by contrast, hurts on the easier SVHN dataset and fails outright on CIFAR-100 when its per-class statistics become too thin. CCM adds no inference-time cost. We do not claim universality; we characterize when each ingredient helps within a single, identical-budget protocol.

27 October 2026 in Electronics
Verified
Journal Article
Open access
PDF file
HPHyuk-Gyu Park
Hyuk-Gyu Park
KSKwang Seong Shin
Kwang Seong Shin
DWDong-Hyun Won
Dong-Hyun Won
Attribute noise, the measurement error in feature values, is a data-related challenge distinct from label noise, and the noise present at training time rarely equals the noise present at deployment. This article studies this train–test noise mismatch in tabular classification. Its main contribution is noise-matched training (NMT), which estimates a feature-wise noise level from the variance excess of unlabeled deployment inputs over the training inputs, with a threshold calibrated on the training split, and injects noise of that level in one additional fit. Its identifiability assumption, that the clean deployment variance equals the training variance, is stated and tested. In a one-dimensional Gaussian model, the excess risk of a rule tuned at the wrong noise level vanishes only at the matched level. Five learners on ten public OpenML/UCI datasets were evaluated under eight test-time noise conditions and twelve training conditions, with the dataset as the unit of inference. The matched level was, on average, the best fixed training level, except for nearest-neighbor classification. NMT had the highest average accuracy and helped most when only some features were noisy, but none of its dataset-level comparisons remained significant after multiplicity adjustment. It gave no benefit under impulsive noise, for nearest neighbors, or under covariate shift without noise.