Gangin Lee

According to our database, Gangin Lee authored at least 34 papers between 2012 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2020

Erasable pattern mining based on tree structures with damped window over data streams.

Yoonji Baek, Unil Yun, Heonho Kim, Hyoju Nam, Gangin Lee, Eunchul Yoon, Bay Vo, Jerry Chun-Wei Lin

Eng. Appl. Artif. Intell., 2020

2019

Advanced approach of sliding window based erasable pattern mining with list structure of industrial fields.

Unil Yun, Gangin Lee, Eunchul Yoon

Inf. Sci., 2019

Efficient approach for incremental high utility pattern mining with indexed list structure.

Unil Yun, Hyoju Nam, Gangin Lee, Eunchul Yoon

Future Gener. Comput. Syst., 2019

2018

Performance and characteristic analysis of maximal frequent pattern mining methods using additional factors.

Gangin Lee, Unil Yun

Soft Comput., 2018

Single-pass based efficient erasable pattern mining using list data structure on dynamic incremental databases.

Gangin Lee, Unil Yun

Future Gener. Comput. Syst., 2018

Efficient incremental high utility pattern mining based on pre-large concept.

Judae Lee, Unil Yun, Gangin Lee, Eunchul Yoon

Eng. Appl. Artif. Intell., 2018

2017

Efficient High Utility Pattern Mining for Establishing Manufacturing Plans With Sliding Window Control.

Unil Yun, Gangin Lee, Eunchul Yoon

IEEE Trans. Ind. Electron., 2017

An efficient algorithm for mining high utility patterns from incremental databases with one database scan.

Unil Yun, Heungmo Ryang, Gangin Lee, Hamido Fujita

Knowl. Based Syst., 2017

Mining Frequent Weighted Itemsets without Storing Transaction IDs and Generating Candidates.

Gangin Lee, Unil Yun, Keun Ho Ryu

Int. J. Uncertain. Fuzziness Knowl. Based Syst., 2017

Analyzing of incremental high utility pattern mining based on tree structures.

Judae Lee, Unil Yun, Gangin Lee

Hum. centric Comput. Inf. Sci., 2017

A new efficient approach for mining uncertain frequent patterns using minimum data structure without false positives.

Gangin Lee, Unil Yun

Future Gener. Comput. Syst., 2017

2016

Analysis of tree-based uncertain frequent pattern mining techniques without pattern losses.

Gangin Lee, Unil Yun, Kyung-Min Lee

J. Supercomput., 2016

The Smallest Valid Extension-Based Efficient, Rare Graph Pattern Mining, Considering Length-Decreasing Support Constraints and Symmetry Characteristics of Graphs.

Unil Yun, Gangin Lee, Chulhong Kim

Symmetry, 2016

Mining recent high average utility patterns based on sliding window from stream data.

Unil Yun, Donggyu Kim, Heungmo Ryang, Gangin Lee, Kyung-Min Lee

J. Intell. Fuzzy Syst., 2016

Approximate Maximal Frequent Pattern Mining with Weight Conditions and Error Tolerance.

Gangin Lee, Unil Yun, Heungmo Ryang, Donggyu Kim

Int. J. Pattern Recognit. Artif. Intell., 2016

Sliding window based weighted erasable stream pattern mining for stream data applications.

Unil Yun, Gangin Lee

Future Gener. Comput. Syst., 2016

Incremental mining of weighted maximal frequent itemsets from dynamic databases.

Unil Yun, Gangin Lee

Expert Syst. Appl., 2016

Efficient representative pattern mining based on weight and maximality conditions.

Unil Yun, Gangin Lee, Kyung-Min Lee

Expert Syst. J. Knowl. Eng., 2016

Erasable itemset mining over incremental databases with weight conditions.

Gangin Lee, Unil Yun, Heungmo Ryang, Donggyu Kim

Eng. Appl. Artif. Intell., 2016

Analysis of Recent Maximal Frequent Pattern Mining Approaches.

Gangin Lee, Unil Yun

Proceedings of the Advances in Computer Science and Ubiquitous Computing, 2016

2015

Multiple Minimum Support-Based Rare Graph Pattern Mining Considering Symmetry Feature-Based Growth Technique and the Differing Importance of Graph Elements.

Gangin Lee, Unil Yun, Heungmo Ryang, Donggyu Kim

Symmetry, 2015

Ranking algorithm for book reviews with user tendency and collective intelligence.

Heungmo Ryang, Unil Yun, Gwangbum Pyun, Gangin Lee, Jiwon Kim

Multim. Tools Appl., 2015

An uncertainty-based approach: Frequent itemset mining from uncertain data with different item importance.

Gangin Lee, Unil Yun, Heungmo Ryang

Knowl. Based Syst., 2015

Mining weighted erasable patterns by using underestimated constraint-based pruning technique.

Gangin Lee, Unil Yun, Heungmo Ryang

J. Intell. Fuzzy Syst., 2015

A blog ranking algorithm using analysis of both blog influence and characteristics of blog posts.

Jiwon Kim, Unil Yun, Gwangbum Pyun, Heungmo Ryang, Gangin Lee, Eunchul Yoon, Keun Ho Ryu

Clust. Comput., 2015

2014

Mining maximal frequent patterns by considering weight conditions over data streams.

Unil Yun, Gangin Lee, Keun Ho Ryu

Knowl. Based Syst., 2014

Sliding window based weighted maximal frequent pattern mining over data streams.

Gangin Lee, Unil Yun, Keun Ho Ryu

Expert Syst. Appl., 2014

2013

Frequent Graph Mining Based on Multiple Minimum Support Constraints.

Gangin Lee, Unil Yun

Proceedings of the Mobile, Ubiquitous, and Intelligent Computing, 2013

Frequent Graph Pattern Mining with Length-Decreasing Support Constraints.

Gangin Lee, Unil Yun

Proceedings of the Multimedia and Ubiquitous Engineering, 2013

2012

Mining Weighted Frequent Sub-graphs with Weight and Support Affinities.

Gangin Lee, Unil Yun

Proceedings of the Multi-disciplinary Trends in Artificial Intelligence, 2012

Analyzing Efficient Algorithms of Frequent Pattern Mining.

Unil Yun, Gangin Lee, Sung-Jin Kim

Proceedings of the International Conference on IT Convergence and Security, 2012

Efficient Isomorphic Decision for Mining Sub Graphs with a Cyclic Form.

Gangin Lee, Unil Yun

Proceedings of the International Conference on IT Convergence and Security, 2012

Efficient Opinion Article Retrieval System.

Unil Yun, Heungmo Ryang, Gwangbum Pyun, Gangin Lee

Proceedings of the Convergence and Hybrid Information Technology, 2012

An Efficient Approach for Mining Frequent Sub-graphs with Support Affinities.

Gangin Lee, Unil Yun

Proceedings of the Convergence and Hybrid Information Technology, 2012