Gangin Lee
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Gangin Lee has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Unil Yun
Sejong University
6 shared publications - Heungmo Ryang
Department of Computer Engineering, Sejong University, Seoul, Republic of Korea
5 shared publications - Unil Yun
Department of Computer Engineering, Sejong University, Seoul, Republic of Korea
5 shared publications - Donggyu Kim
Department of Computer Engineering, Sejong University, 143-747, Seoul, Republic of Korea
3 shared publications - Gwangbum Pyun
Sejong University
3 shared publications - Jiwon Kim
Sejong University
2 shared publications
Latest Publications
- 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.
- Open Access
The Smallest Valid Extension-Based Efficient, Rare Graph Pattern Mining, Considering Length-Decreasing Support Constraints and Symmetry Characteristics of Graphs
Frequent graph mining has been proposed to find interesting patterns (i.e., frequent sub-graphs) from databases composed of graph transaction data, which can effectively express complex and large data in the real world. In addition, various applications for graph mining have been suggested. Traditional graph pattern mining methods use a single minimum support threshold factor in order to check whether or not mined patterns are interesting. However, it is not a sufficient factor that can consider valuable characteristics of graphs such as graph sizes and features of graph elements. That is, previous methods cannot consider such important characteristics in their mining operations since they only use a fixed minimum support threshold in the mining process. For this reason, in this paper, we propose a novel graph mining algorithm that can consider various multiple, minimum support constraints according to the types of graph elements and changeable minimum support conditions, depending on lengths of graph patterns. In addition, the proposed algorithm performs in mining operations more efficiently because it can minimize duplicated operations and computational overheads by considering symmetry features of graphs. Experimental results provided in this paper demonstrate that the proposed algorithm outperforms previous mining approaches in terms of pattern generation, runtime and memory usage.
Open AccessThe Smallest Valid Extension-Based Efficient, Rare Graph Pattern Mining, Considering Length-Decreasing Support Constraints and Symmetry Characteristics of Graphs
Frequent graph mining has been proposed to find interesting patterns (i.e., frequent sub-graphs) from databases composed of graph transaction data, which can effectively express complex and large data in the real world. In addition, various applications for graph mining have been suggested. Traditional graph pattern mining methods use a single minimum support threshold factor in order to check whether or not mined patterns are interesting. However, it is not a sufficient factor that can consider valuable characteristics of graphs such as graph sizes and features of graph elements. That is, previous methods cannot consider such important characteristics in their mining operations since they only use a fixed minimum support threshold in the mining process. For this reason, in this paper, we propose a novel graph mining algorithm that can consider various multiple, minimum support constraints according to the types of graph elements and changeable minimum support conditions, depending on lengths of graph patterns. In addition, the proposed algorithm performs in mining operations more efficiently because it can minimize duplicated operations and computational overheads by considering symmetry features of graphs. Experimental results provided in this paper demonstrate that the proposed algorithm outperforms previous mining approaches in terms of pattern generation, runtime and memory usage.
- Open Access
Multiple Minimum Support-Based Rare Graph Pattern Mining Considering Symmetry Feature-Based Growth Technique and the Differing Importance of Graph Elements
Frequent graph pattern mining is one of the most interesting areas in data mining, and many researchers have developed a variety of approaches by suggesting efficient, useful mining techniques by integration of fundamental graph mining with other advanced mining works. However, previous graph mining approaches have faced fatal problems that cannot consider important characteristics in the real world because they cannot process both (1) different element importance and (2) multiple minimum support thresholds suitable for each graph element. In other words, graph elements in the real world have not only frequency factors but also their own importance; in addition, various elements composing graphs may require different thresholds according to their characteristics. However, traditional ones do not consider such features. To overcome these issues, we propose a new frequent graph pattern mining method, which can deal with both different element importance and multiple minimum support thresholds. Through the devised algorithm, we can obtain more meaningful graph pattern results with higher importance. We also demonstrate that the proposed algorithm has more outstanding performance compared to previous state-of-the-art approaches in terms of graph pattern generation, runtime, and memory usage.
Open AccessMultiple Minimum Support-Based Rare Graph Pattern Mining Considering Symmetry Feature-Based Growth Technique and the Differing Importance of Graph Elements
Frequent graph pattern mining is one of the most interesting areas in data mining, and many researchers have developed a variety of approaches by suggesting efficient, useful mining techniques by integration of fundamental graph mining with other advanced mining works. However, previous graph mining approaches have faced fatal problems that cannot consider important characteristics in the real world because they cannot process both (1) different element importance and (2) multiple minimum support thresholds suitable for each graph element. In other words, graph elements in the real world have not only frequency factors but also their own importance; in addition, various elements composing graphs may require different thresholds according to their characteristics. However, traditional ones do not consider such features. To overcome these issues, we propose a new frequent graph pattern mining method, which can deal with both different element importance and multiple minimum support thresholds. Through the devised algorithm, we can obtain more meaningful graph pattern results with higher importance. We also demonstrate that the proposed algorithm has more outstanding performance compared to previous state-of-the-art approaches in terms of graph pattern generation, runtime, and memory usage.
- 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
- 1 January 2015
- Published by Springer Nature
- p. 191-196
Correlated Blog-Page Retrieval with Structural Characteristics
- 1 January 2015
- Published by Springer Nature
- p. 191-196
Correlated Blog-Page Retrieval with Structural Characteristics
- 1 January 2015
- Published by Springer Nature
- p. 179-184
Mining Frequent Graph Patterns Considering Both Different Importance and Rarity of Graph Elements
- 1 January 2015
- Published by Springer Nature
- p. 179-184
Mining Frequent Graph Patterns Considering Both Different Importance and Rarity of Graph Elements
- 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
- 25 May 2014
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 74 (16) , 6209-6227
Ranking algorithm for book reviews with user tendency and collective intelligence
- 25 May 2014
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 74 (16) , 6209-6227
Ranking algorithm for book reviews with user tendency and collective intelligence
- 24 December 2013
- Published by Springer Nature in Cluster Computing
- Vol. 18 (1) , 157-164
A blog ranking algorithm using analysis of both blog influence and characteristics of blog posts
- 24 December 2013
- Published by Springer Nature in Cluster Computing
- Vol. 18 (1) , 157-164
A blog ranking algorithm using analysis of both blog influence and characteristics of blog posts