Unil Yun
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Unil Yun has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Gangin Lee
Sejong University
5 shared publications - Donggyu Kim
Department of Computer Engineering, Sejong University, 143-747, Seoul, Republic of Korea
2 shared publications - Heungmo Ryang
Department of Computer Engineering, Sejong University, Seoul, Republic of Korea
2 shared publications Gwang-Bum Pyun
1 shared publication- Jerry Chun-Wei Lin
Silesian University of Technology
1 shared publication - Keun Ho Ryu
Faculty of Information Technology, Ton Duc Thang University, Ho Chi Minh City 700000, Vietnam
1 shared publication
Latest Publications
- 3 February 2021
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (6) , 6917-6938
TSPIN: mining top-k stable periodic patterns
- 3 February 2021
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (6) , 6917-6938
TSPIN: mining top-k stable periodic patterns
- 1 September 2016
- Published by American Scientific Publishers in Advanced Science Letters
- Vol. 22 (9) , 2300-2304
A Generation Method of Vehicle Data Based on Incremental State Changes
With the advent of vehicle technology, it has been possible to monitor almost every component equipped in a vehicle using electrical sensors in recent years. Vehicle-related engineers develop techniques on the basis of vehicle data measured by the sensors for enhancing vehicle functions and test the performance of the devised techniques, where they need to consider various characteristics of the data for more exact tests. Although the engineers can obtain such vehicle data directly from the real world, it is actually hard to collect data reflecting various characteristics because of time and cost constraints. For this reason, we propose a generation method of vehicle data considering various characteristics, which can create such data based on incremental state changes of vehicle attribute values. Our approach can reflect their increase or decrease changes in a linear form. Moreover, we conduct analysis of vehicle data generated by the proposed method with respect to vehicle faults. Numerous types of generated vehicle data with the consideration of the state changes and faults can be utilized in a variety of data mining fields for developing and improving vehicle techniques such as clustering, monitoring, diagnosis, classification, and prognosis methods.
- 1 September 2016
- Published by American Scientific Publishers in Advanced Science Letters
- Vol. 22 (9) , 2300-2304
A Generation Method of Vehicle Data Based on Incremental State Changes
With the advent of vehicle technology, it has been possible to monitor almost every component equipped in a vehicle using electrical sensors in recent years. Vehicle-related engineers develop techniques on the basis of vehicle data measured by the sensors for enhancing vehicle functions and test the performance of the devised techniques, where they need to consider various characteristics of the data for more exact tests. Although the engineers can obtain such vehicle data directly from the real world, it is actually hard to collect data reflecting various characteristics because of time and cost constraints. For this reason, we propose a generation method of vehicle data considering various characteristics, which can create such data based on incremental state changes of vehicle attribute values. Our approach can reflect their increase or decrease changes in a linear form. Moreover, we conduct analysis of vehicle data generated by the proposed method with respect to vehicle faults. Numerous types of generated vehicle data with the consideration of the state changes and faults can be utilized in a variety of data mining fields for developing and improving vehicle techniques such as clustering, monitoring, diagnosis, classification, and prognosis methods.
- 1 September 2016
- Published by American Scientific Publishers in Advanced Science Letters
- Vol. 22 (9) , 2480-2484
A Weight-Based Approach: Frequent Graph Pattern Mining with Length-Decreasing Support Constraints Using Weighted Smallest Valid Extension
As one of the recent interesting areas in data mining, frequent graph pattern (or sub-graphs) mining was proposed to deal with more complicated data such as graphs. Moreover, in order to extract more meaningful graph patterns, the concept of weighted frequent graph pattern mining was suggested. Meanwhile, graph patterns extracted from given graph databases can have various features, which can be different for each length of the patterns. However, traditional graph mining approaches cannot deal with such useful characteristics in their mining operations because they employ a single minimum support threshold. Hence, even if a mined graph pattern turns out to be weighted infrequent, it may become a useful result according to its length feature. In this paper, we propose a new method for mining weighted frequent graph patterns based on length-decreasing support constraints and weighted smallest valid extension. Experimental results of this paper show that the proposed algorithm outperforms a state-of-the-art approach in various aspects.
- 1 September 2016
- Published by American Scientific Publishers in Advanced Science Letters
- Vol. 22 (9) , 2480-2484
A Weight-Based Approach: Frequent Graph Pattern Mining with Length-Decreasing Support Constraints Using Weighted Smallest Valid Extension
As one of the recent interesting areas in data mining, frequent graph pattern (or sub-graphs) mining was proposed to deal with more complicated data such as graphs. Moreover, in order to extract more meaningful graph patterns, the concept of weighted frequent graph pattern mining was suggested. Meanwhile, graph patterns extracted from given graph databases can have various features, which can be different for each length of the patterns. However, traditional graph mining approaches cannot deal with such useful characteristics in their mining operations because they employ a single minimum support threshold. Hence, even if a mined graph pattern turns out to be weighted infrequent, it may become a useful result according to its length feature. In this paper, we propose a new method for mining weighted frequent graph patterns based on length-decreasing support constraints and weighted smallest valid extension. Experimental results of this paper show that the proposed algorithm outperforms a state-of-the-art approach in various aspects.
- 30 April 2015
- Published by Korean Society for Internet Information in Journal of Internet Computing and Services
- Vol. 16 (2) , 77-83
Analysis and Performance Evaluation of Pattern Condensing Techniques used in Representative Pattern Mining
- 30 April 2015
- Published by Korean Society for Internet Information in Journal of Internet Computing and Services
- Vol. 16 (2) , 77-83
Analysis and Performance Evaluation of Pattern Condensing Techniques used in Representative Pattern Mining
- 31 December 2014
- Published by Korean Society for Internet Information in Journal of Internet Computing and Services
- Vol. 15 (6) , 125-132
A Weighted Frequent Graph Pattern Mining Approach considering Length-Decreasing Support Constraints
- 31 December 2014
- Published by Korean Society for Internet Information in Journal of Internet Computing and Services
- Vol. 15 (6) , 125-132
A Weighted Frequent Graph Pattern Mining Approach considering Length-Decreasing Support Constraints
- 31 December 2011
- Published by Korean Society of Computer Information in Journal of the Korea Society of Computer and Information
- Vol. 16 (12) , 33-41
An efficient approach of avoiding extensions of duplicated graph patterns in cyclic graph mining
- 31 December 2011
- Published by Korean Society of Computer Information in Journal of the Korea Society of Computer and Information
- Vol. 16 (12) , 33-41
An efficient approach of avoiding extensions of duplicated graph patterns in cyclic graph mining