Younghoon Kim

Dr. Younghoon Kim

Division of Computer Science, Hanyang University at Ansan, Ansan 15588, Korea
orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
26 November 2018 in IEEE Access
Verified
Journal Article
Open access
WLWoonghee Lee
Woonghee Lee
KKKeonwoo Kim
Keonwoo Kim
JPJunsep Park
Junsep Park
JKJinhee Kim
Jinhee Kim
Younghoon KimYounghoon Kim
Younghoon Kim
As solar photovoltaic (PV) generation becomes cost-effective, solar power comes into its own as the alternative energy with the potential to make up a larger share of growing energy needs. Consequently, operations and maintenance cost now have a large impact on the profit of managing power modules, and the energy market participants need to estimate the solar power in short or long terms of future. In this paper, we propose a solar power forecasting technique by utilizing convolutional neural networks (CNNs) and long-short term memory (LSTM) networks recently developed for analyzing time series data in the deep learning communities. Considering that weather information may not be always available for the location where PV modules are installed and sensors are often damaged, we empirically confirm that the proposed method predicts the solar power well with roughly estimated weather data obtained from national weather centers as well as it works robustly without sophisticatedly preprocessed input to remove outliers.

1 April 2012
Verified
Conference Paper
Closed access
Younghoon KimYounghoon Kim
Younghoon Kim
KSKyuseok Shim
Kyuseok Shim
There is a wide range of applications that require finding the top-k most similar pairs of records in a given database. However, computing such top-k similarity joins is a challenging problem today, as there is an increasing trend of applications that expect to deal with vast amounts of data. For such data-intensive applications, parallel executions of programs on a large cluster of commodity machines using the MapReduce paradigm have recently received a lot of attention. In this paper, we investigate how the top-k similarity join algorithms can get benefits from the popular MapReduce framework. We first develop the divide-and-conquer and branch-and-bound algorithms. We next propose the all pair partitioning and essential pair partitioning methods to minimize the amount of data transfers between map and reduce functions. We finally perform the experiments with not only synthetic but also real-life data sets. Our performance study confirms the effectiveness and scalability of our MapReduce algorithms.

1 December 2011
Verified
Conference Paper
Closed access
Younghoon KimYounghoon Kim
Younghoon Kim
KSKyuseok Shim
Kyuseok Shim
Twitter provides search services to help people find new users to follow by recommending popular users or their friends' friends. However, these services do not offer the most relevant users to follow for a user. Furthermore, Twitter does not provide yet the search services to find the most interesting tweet messages for a user either. In this paper, we propose TWITOBI, a recommendation system for Twitter using probabilistic modeling for collaborative filtering which can recommend top-K users to follow and top-K tweets to read for a user. Our novel probabilistic model utilizes not only tweet messages but also the relationships between users. We develop an estimation algorithm for learning our model parameters and present its parallelized algorithm using MapReduce to handle large data. Our performance study with real-life data sets confirms the effectiveness and scalability of our algorithms.

8 November 2021 in IEEE Access
Verified
Journal Article
Open access
Woonghee LeeWoonghee Lee
Woonghee Lee
JLJaeyoung Lee
Jaeyoung Lee
Younghoon KimYounghoon Kim
Younghoon Kim
Missing values are very prevalent in real world; they are caused by various reasons such as user mistakes or device failures. They often cause critical problems especially in medical and healthcare application since they can lead to incorrect diagnosis or even cause system failure. Many of recent imputation techniques have adopted machine learning-based generative methods such as generative adversarial networks (GANs) to deal with missing values in medical data. They are, however, incapable of reproducing realistic time-series signals preserving important latent features such as sleep stages that are important context in many medical applications using electroencephalogram (EEG). In this study, we propose a novel GAN-based technique generating realistic EEG signal sequences which are not only shown natural but also correctly classified with sleep stages by implanting the latent features in the synthetic sequence. By experiments, we confirm that our model generates not only more realistic EEG signals than a recent GAN-based model but also preserve auxiliary information such as sleep stages. Furthermore, we demonstrate that existing machine learning methods based on EEG data still work well without sacrificing performance using the imputed data by using our method.

22 June 2013
Verified
Conference Paper
Open access
PDF file
Younghoon KimYounghoon Kim
Younghoon Kim
KSKyuseok Shim
Kyuseok Shim

24 February 2020 in IEEE Access
Verified
Journal Article
Open access
Younghoon KimYounghoon Kim
Younghoon Kim
JSJiwon Seo
Jiwon Seo
Social network services (SNSs) such as Twitter and Facebook have emerged as a new medium for communication. They offer a unique mechanism of sharing information by allowing users to receive all messages posted by those whom they “follow”. As information in today’s SNSs often spreads in the form of hashtags, detecting rapidly spreading hashtags in SNSs has recently attracted much attention. In this paper, we propose realistic epidemic models to describe the probabilistic process of hashtag propagation. Our models take into account the way how users communicate in SNSs; moreover the models consider the influence of external media and separate it from internal diffusion within networks. Based on the proposed models, we develop efficient inference algorithms that measure the propagation rates of hashtags in social networks. With real-life social network data including hashtags and synthetic data obtained by simulating information diffusion, we show that the proposed algorithms find fast-spreading hashtags more accurately than existing algorithms. Moreover, our in-depth case study demonstrates that our algorithms correctly find internal diffusion rates of hashtags as well as external media influences.