Dae-Ki Kang

dblp:65/510 · DBLP profile ↗
← Back
30ranked-venue papers
6as first author
11since 2021 · last 2026
0000-0002-4147-2835ORCID · corroborated

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

Artificial intelligence and machine learning · 23 · 4 first-author · 9 since 2021Databases, data management, data science and information retrieval · 5 · 2 first-author · 1 since 2021Computer networks · 1 · 1 since 2021Security and privacy · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1
YearPublicationVenuePosition
2026 LigTomDet: Knowledge distillation in a new lightweight tomato disease detection model in planting fields
Dae-Ki Kang
Pattern Recognit.3
2026 Breaking the Fog with SIGHT: Attention-Guided State Prediction for Partially Observable Reinforcement Learning
abstract
Reinforcement Learning (RL) excels in fully observable environments but faces significant challenges in partially observable scenarios, modeled as Partially Observable Markov Decision Processes (POMDPs), where agents must infer hidden states from noisy observations. We propose Sequential Inference with Guided Hidden Trajectories (SIGHT), a novel framework that integrates attention-guided hidden state prediction into an actor–critic architecture. By dynamically prioritizing relevant historical information and anticipating future dynamics, SIGHT combines the adaptability of model-free RL with the predictive foresight of model-based methods, creating a hybrid “model-based-like model-free” approach. Validated across position-based and velocity-based tasks, SIGHT outperforms state-of-the-art methods, including the POMDP Baseline, Neural Ordinary Differential Equations, and Variational Recurrent Models, achieving higher returns, stability, and adaptability. Our analysis further demonstrates the impact of sequence length, RL algorithm suitability, and attention mechanisms on performance, highlighting SIGHT’s potential for advancing RL in real-world partially observable environments.
Leonard Christopher Limanjaya, Dae-Ki Kang
ACM Trans. Intell. Syst. Technol.2
2026 FlexMorpher: Deformable Attention-Enhanced Multi-Scale Displacement Field Refinement with Spatial Diffusion Model
abstract
Deformable image registration is essential in medical imaging, but existing approaches often struggle to jointly model fine-grained deformations and maintain topological plausibility. We propose FlexMorpher, a unified probabilistic framework that reformulates registration as a spatially guided denoising task. FlexMorpher integrates a score-based diffusion model with a multi-scale displacement-to-deformation refinement (DDR) network enhanced by deformable attention. The diffusion module estimates a structure-aware score field conditioned on anatomical priors from the fixed image, while the DDR network translates this into dense deformation fields through coarse-to-fine refinement. This combination enables FlexMorpher to capture both global structural alignment and localized non-rigid deformations. Experimental results on 2D and 3D registration benchmarks demonstrate that FlexMorpher outperforms existing methods in accuracy, deformation smoothness, and topological stability. These results highlight the effectiveness of integrating generative diffusion modeling with spatial attention mechanisms for robust and anatomically consistent medical image registration.
Yoshua Kaleb Purwanto, Dae-Ki Kang
ACM Trans. Multim. Comput. Commun. Appl.2
2025 Enhancing few-shot learning using targeted mixup
Yaw Darkwah Jnr., Dae-Ki Kang
Appl. Intell.2
2025 FTPSG: Feature mixture transformer and potential-based subgoal generation for hierarchical multi-agent reinforcement learning
Isack Thomas Nicholaus, Dae-Ki Kang
Expert Syst. Appl.2
2025 IMSDO: Deep metric learning with incremental margin and standard deviation optimization
Jeremy Winston, Dae-Ki Kang
Neurocomputing2
2024 GLNAS: Greedy Layer-wise Network Architecture Search for low cost and fast network generation
Jiacang Ho, Kyongseok Park, Dae-Ki Kang
Pattern Recognit.3
2022 Attack-less adversarial training for a robust adversarial defense
Jiacang Ho, Byung-Gook Lee, Dae-Ki Kang
Appl. Intell.3
2022 Augmented domain agreement for adaptable Meta-Learner on Few-Shot classification
Tintrim Dwi Ary Widhianingsih, Dae-Ki Kang
Appl. Intell.2
2022 Robust experience replay sampling for multi-agent reinforcement learning
Isack Thomas Nicholaus, Dae-Ki Kang
Pattern Recognit. Lett.2
2021 Trainable activation function with differentiable negative side and adaptable rectified point
Kevin Pratama, Dae-Ki Kang
Appl. Intell.2
2020 Uni-image: Universal image construction for robust neural model
Jiacang Ho, Byung-Gook Lee, Dae-Ki Kang
Neural Networks3
2019 Optimizing restricted Boltzmann machine learning by injecting Gaussian noise to likelihood gradient approximation
Prima Sanjaya, Dae-Ki Kang
Appl. Intell.2
2018 One-class naïve Bayes with duration feature ranking for accurate user authentication using keystroke dynamics
Jiacang Ho, Dae-Ki Kang
Appl. Intell.2
2018 Biased Dropout and Crossmap Dropout: Learning towards effective Dropout regularization in convolutional neural network
Alvin Poernomo, Dae-Ki Kang
Neural Networks2
2017 Attribute weighting for averaged one-dependence estimators
Zhong-Liang Xiang, Dae-Ki Kang
Appl. Intell.2
2017 Mini-batch bagging and attribute ranking for accurate user authentication in keystroke dynamics
Jiacang Ho, Dae-Ki Kang
Pattern Recognit.2
2016 Experimental analysis of naïve Bayes classifier based on an attribute weighting framework with smooth kernel density estimations
Zhong-Liang Xiang, Dae-Ki Kang
Appl. Intell.3
2015 A Novel Parallel Computation Model with Efficient Local Memory Management for Data-Intensive Applications
abstract
The provisioning of high-performance computing infrastructure through cloud environments enables data intensive processing to be a viable solution. In this paper, we introduce a novel parallel computation model similar to MapReduce framework. The proposed parallelized model incorporates a parallel execution strategy in worker nodes to decrease execution response times in cloud environments. The parallelized model adopts efficient local memory management techniques in the worker nodes to reduce memory transfer overheads. For evaluation, we compared the proposed framework with the state of art Hadoop MapReduce framework. From experiments on benchmark datasets, it turns out that the parallelized model reduces the execution times by about 45.86%. Those experimental results indicate the efficiency and the scalability of proposed framework on cloud environments.
Ahmed Abdulhakim Al-Absi, Dae-Ki Kang
CLOUD2
2015 Geometric mean based boosting algorithm with over-sampling to resolve data imbalance problem for bankruptcy prediction
Myoung-Jong Kim, Dae-Ki Kang, Hong Bae Kim
Expert Syst. Appl.2
2012 Classifiers selection in ensembles using genetic algorithms for bankruptcy prediction
Myoung-Jong Kim, Dae-Ki Kang
Expert Syst. Appl.2
2011 Propositionalized attribute taxonomies from data for data-driven construction of concise classifiers
Dae-Ki Kang, Myoung-Jong Kim
Expert Syst. Appl.1
2010 Ensemble with neural networks for bankruptcy prediction
Myoung-Jong Kim, Dae-Ki Kang
Expert Syst. Appl.2
2009 Learning decision trees with taxonomy of propositionalized attributes
Dae-Ki Kang, Kiwook Sohn
Pattern Recognit.1
2006 RNBL-MN: A Recursive Naive Bayes Learner for Sequence Classification
Dae-Ki Kang, Adrian Silvescu, Vasant G. Honavar
PAKDD1
2006 TRIPPER: Rule Learning Using Taxonomies
Flavian Vasile, Adrian Silvescu, Dae-Ki Kang, Vasant G. Honavar
PAKDD3
2006 Learning accurate and concise naïve Bayes classifiers from attribute value taxonomies and data
Jun Zhang 0002, Dae-Ki Kang, Adrian Silvescu, Vasant G. Honavar
Knowl. Inf. Syst.2
2005 Learning Classifiers for Misuse Detection Using a Bag of System Calls Representation
Dae-Ki Kang, Doug Fuller, Vasant G. Honavar
ISI1
2004 Generation of Attribute Value Taxonomies from Data for Data-Driven Construction of Accurate and Compact Classifiers
abstract
Attribute value taxonomies (AVT) have been shown to be useful in constructing compact, robust, and comprehensible classifiers. However, in many application domains, human-designed AVTs are unavailable. We introduce AVT-learner, an algorithm for automated construction of attribute value taxonomies from data. AVT-learner uses hierarchical agglomerative clustering (HAC) to cluster attribute values based on the distribution of classes that co-occur with the values. We describe experiments on UCI data sets that compare the performance of AVT-NBL (an AVT-guided naive Bayes learner) with that of the standard naive Bayes learner (NBL) applied to the original data set. Our results show that the AVTs generated by AVT-learner are competitive with human-gene rated AVTs (in cases where such AVTs are available). AVT-NBL using AVTs generated by AVT-learner achieves classification accuracies that are comparable to or higher than those obtained by NBL; and the resulting classifiers are significantly more compact than those generated by NBL.
Dae-Ki Kang, Adrian Silvescu, Jun Zhang 0002, Vasant G. Honavar
ICDM1
2003 MetaNews: An Information Agent for Gathering News Articles on the Web
Dae-Ki Kang, Joongmin Choi
ISMIS1