Gangin Lee

According to our database1, Gangin Lee authored at least 29 papers between 2012 and 2018.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.



In proceedings 
PhD thesis 




Performance and characteristic analysis of maximal frequent pattern mining methods using additional factors.
Soft Comput., 2018

Single-pass based efficient erasable pattern mining using list data structure on dynamic incremental databases.
Future Generation Comp. Syst., 2018

Efficient incremental high utility pattern mining based on pre-large concept.
Eng. Appl. of AI, 2018

Efficient High Utility Pattern Mining for Establishing Manufacturing Plans With Sliding Window Control.
IEEE Trans. Industrial Electronics, 2017

An efficient algorithm for mining high utility patterns from incremental databases with one database scan.
Knowl.-Based Syst., 2017

Mining Frequent Weighted Itemsets without Storing Transaction IDs and Generating Candidates.
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2017

A new efficient approach for mining uncertain frequent patterns using minimum data structure without false positives.
Future Generation Comp. Syst., 2017

Analysis of tree-based uncertain frequent pattern mining techniques without pattern losses.
The Journal of Supercomputing, 2016

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

Mining recent high average utility patterns based on sliding window from stream data.
Journal of Intelligent and Fuzzy Systems, 2016

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

Sliding window based weighted erasable stream pattern mining for stream data applications.
Future Generation Comp. Syst., 2016

Incremental mining of weighted maximal frequent itemsets from dynamic databases.
Expert Syst. Appl., 2016

Efficient representative pattern mining based on weight and maximality conditions.
Expert Systems, 2016

Erasable itemset mining over incremental databases with weight conditions.
Eng. Appl. of AI, 2016

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

Ranking algorithm for book reviews with user tendency and collective intelligence.
Multimedia Tools Appl., 2015

An uncertainty-based approach: Frequent itemset mining from uncertain data with different item importance.
Knowl.-Based Syst., 2015

Mining weighted erasable patterns by using underestimated constraint-based pruning technique.
Journal of Intelligent and Fuzzy Systems, 2015

A blog ranking algorithm using analysis of both blog influence and characteristics of blog posts.
Cluster Computing, 2015

Mining maximal frequent patterns by considering weight conditions over data streams.
Knowl.-Based Syst., 2014

Sliding window based weighted maximal frequent pattern mining over data streams.
Expert Syst. Appl., 2014

Frequent Graph Mining Based on Multiple Minimum Support Constraints.
Proceedings of the Mobile, Ubiquitous, and Intelligent Computing, 2013

Frequent Graph Pattern Mining with Length-Decreasing Support Constraints.
Proceedings of the Multimedia and Ubiquitous Engineering, 2013

Mining Weighted Frequent Sub-graphs with Weight and Support Affinities.
Proceedings of the Multi-disciplinary Trends in Artificial Intelligence, 2012

Analyzing Efficient Algorithms of Frequent Pattern Mining.
Proceedings of the International Conference on IT Convergence and Security, 2012

Efficient Isomorphic Decision for Mining Sub Graphs with a Cyclic Form.
Proceedings of the International Conference on IT Convergence and Security, 2012

Efficient Opinion Article Retrieval System.
Proceedings of the Convergence and Hybrid Information Technology, 2012

An Efficient Approach for Mining Frequent Sub-graphs with Support Affinities.
Proceedings of the Convergence and Hybrid Information Technology, 2012