June Seok Hong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
June Seok Hong has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Wooju Kim
Affiliation Department of Industrial Engineering, Yonsei University, Seoul, Republic of Korea
3 shared publications - Haemin Jung
Department of Industrial & Management Engineering, Korea National University of Transportation, Chungju, 27469, Republic of Korea
1 shared publication Ki-Jun Lee
1 shared publication- Kwangyon Lee
Soongsil Univ, Sch Elect Engn, Seoul 06978, South Korea
1 shared publication Kyung-Min Kim
1 shared publication- MinJun Kim
Department of Industrial Engineering, Yonsei University, 50 Yonsei-ro, Seodaemun-gu, Seoul 03722, Korea
1 shared publication
Latest Publications
- Open Access
- 20 January 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (3) , 932
Learning Knowledge Using Frequent Subgraph Mining from Ontology Graph Data
In many areas, vast amounts of information are rapidly accumulating in the form of ontology-based knowledge graphs, and the use of information in these forms of knowledge graphs is becoming increasingly important. This study proposes a novel method for efficiently learning frequent subgraphs (i.e., knowledge) from ontology-based graph data. An ontology-based large-scale graph is decomposed into small unit subgraphs, which are used as the unit to calculate the frequency of the subgraph. The frequent subgraphs are extracted through candidate generation and chunking processes. To verify the usefulness of the extracted frequent subgraphs, the methodology was applied to movie rating prediction. Using the frequent subgraphs as user profiles, the graph similarity between the rating graph and new item graph was calculated to predict the rating. The MovieLens dataset was used for the experiment, and a comparison showed that the proposed method outperformed other widely used recommendation methods. This study is meaningful in that it proposed an efficient method for extracting frequent subgraphs while maintaining semantic information and considering scalability in large-scale graphs. Furthermore, the proposed method can provide results that include semantic information to serve as a logical basis for rating prediction or recommendation, which existing methods are unable to provide.
- 20 January 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (3) , 932
Open AccessLearning Knowledge Using Frequent Subgraph Mining from Ontology Graph Data
In many areas, vast amounts of information are rapidly accumulating in the form of ontology-based knowledge graphs, and the use of information in these forms of knowledge graphs is becoming increasingly important. This study proposes a novel method for efficiently learning frequent subgraphs (i.e., knowledge) from ontology-based graph data. An ontology-based large-scale graph is decomposed into small unit subgraphs, which are used as the unit to calculate the frequency of the subgraph. The frequent subgraphs are extracted through candidate generation and chunking processes. To verify the usefulness of the extracted frequent subgraphs, the methodology was applied to movie rating prediction. Using the frequent subgraphs as user profiles, the graph similarity between the rating graph and new item graph was calculated to predict the rating. The MovieLens dataset was used for the experiment, and a comparison showed that the proposed method outperformed other widely used recommendation methods. This study is meaningful in that it proposed an efficient method for extracting frequent subgraphs while maintaining semantic information and considering scalability in large-scale graphs. Furthermore, the proposed method can provide results that include semantic information to serve as a logical basis for rating prediction or recommendation, which existing methods are unable to provide.
- Open Access
- 30 October 2019
- Published by MDPI AG in Sustainability
- Vol. 11 (21) , 6030
An Efficient Representation Using Harmony Search for Solving the Virtual Machine Consolidation
A data center with a large number of servers, large storage, and many network devices requires power for cooling to reduce heat generation, air conditioning, and emergency power generation facilities, in addition to power for operation internally consumed by infrastructure equipment. The power consumed by data centers worldwide makes up a large proportion. Although the size of data centers is expected to increase, we are already faced with power problems because stability is prioritized over efficiency when operating data centers in order to meet the Service Level Agreement (SLA) conditions. Most data centers are in a virtualization environment, and virtual machine consolidation using physical machine (PM) transitions to the idle mode through virtual machine (VM) migration has been suggested as one of the most effective ways to reduce the amount of power usage in a data center. This study takes into account the characteristics of virtualization environments and presents an algorithm that effectively solves VM consolidation (VMC) through operator design using a grouping representation method and a meta-heuristic method known as harmony search.
- 30 October 2019
- Published by MDPI AG in Sustainability
- Vol. 11 (21) , 6030
Open AccessAn Efficient Representation Using Harmony Search for Solving the Virtual Machine Consolidation
A data center with a large number of servers, large storage, and many network devices requires power for cooling to reduce heat generation, air conditioning, and emergency power generation facilities, in addition to power for operation internally consumed by infrastructure equipment. The power consumed by data centers worldwide makes up a large proportion. Although the size of data centers is expected to increase, we are already faced with power problems because stability is prioritized over efficiency when operating data centers in order to meet the Service Level Agreement (SLA) conditions. Most data centers are in a virtualization environment, and virtual machine consolidation using physical machine (PM) transitions to the idle mode through virtual machine (VM) migration has been suggested as one of the most effective ways to reduce the amount of power usage in a data center. This study takes into account the characteristics of virtualization environments and presents an algorithm that effectively solves VM consolidation (VMC) through operator design using a grouping representation method and a meta-heuristic method known as harmony search.
- 30 November 2011
- Published by Society for e-Business Studies in The Journal of Society for e-Business Studies
- Vol. 16 (4) , 301-319
Post Clustering Method using Tag Hierarchy for Blog Search
- 30 November 2011
- Published by Society for e-Business Studies in The Journal of Society for e-Business Studies
- Vol. 16 (4) , 301-319
Post Clustering Method using Tag Hierarchy for Blog Search