default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGangin Lee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j26]Yoonji Baek, Unil Yun, Heonho Kim, Hyoju Nam, Gangin Lee, Eunchul Yoon, Bay Vo, Jerry Chun-Wei Lin
:
Erasable pattern mining based on tree structures with damped window over data streams. Eng. Appl. Artif. Intell. 94: 103735 (2020)
2010 – 2019
- 2019
- [j25]Unil Yun, Hyoju Nam, Gangin Lee, Eunchul Yoon:
Efficient approach for incremental high utility pattern mining with indexed list structure. Future Gener. Comput. Syst. 95: 221-239 (2019) - [j24]Unil Yun, Gangin Lee, Eunchul Yoon:
Advanced approach of sliding window based erasable pattern mining with list structure of industrial fields. Inf. Sci. 494: 37-59 (2019) - 2018
- [j23]Judae Lee, Unil Yun, Gangin Lee, Eunchul Yoon:
Efficient incremental high utility pattern mining based on pre-large concept. Eng. Appl. Artif. Intell. 72: 111-123 (2018) - [j22]Gangin Lee, Unil Yun:
Single-pass based efficient erasable pattern mining using list data structure on dynamic incremental databases. Future Gener. Comput. Syst. 80: 12-28 (2018) - [j21]Gangin Lee, Unil Yun:
Performance and characteristic analysis of maximal frequent pattern mining methods using additional factors. Soft Comput. 22(13): 4267-4273 (2018) - 2017
- [j20]Gangin Lee, Unil Yun:
A new efficient approach for mining uncertain frequent patterns using minimum data structure without false positives. Future Gener. Comput. Syst. 68: 89-110 (2017) - [j19]Judae Lee, Unil Yun, Gangin Lee:
Analyzing of incremental high utility pattern mining based on tree structures. Hum. centric Comput. Inf. Sci. 7: 31 (2017) - [j18]Gangin Lee, Unil Yun, Keun Ho Ryu:
Mining Frequent Weighted Itemsets without Storing Transaction IDs and Generating Candidates. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 25(1): 111-144 (2017) - [j17]Unil Yun, Heungmo Ryang, Gangin Lee, Hamido Fujita:
An efficient algorithm for mining high utility patterns from incremental databases with one database scan. Knowl. Based Syst. 124: 188-206 (2017) - [j16]Unil Yun, Gangin Lee, Eunchul Yoon:
Efficient High Utility Pattern Mining for Establishing Manufacturing Plans With Sliding Window Control. IEEE Trans. Ind. Electron. 64(9): 7239-7249 (2017) - 2016
- [j15]Gangin Lee, Unil Yun, Heungmo Ryang, Donggyu Kim:
Erasable itemset mining over incremental databases with weight conditions. Eng. Appl. Artif. Intell. 52: 213-234 (2016) - [j14]Unil Yun, Gangin Lee, Kyung-Min Lee:
Efficient representative pattern mining based on weight and maximality conditions. Expert Syst. J. Knowl. Eng. 33(5): 439-462 (2016) - [j13]Unil Yun, Gangin Lee:
Incremental mining of weighted maximal frequent itemsets from dynamic databases. Expert Syst. Appl. 54: 304-327 (2016) - [j12]Unil Yun, Gangin Lee:
Sliding window based weighted erasable stream pattern mining for stream data applications. Future Gener. Comput. Syst. 59: 1-20 (2016) - [j11]Gangin Lee, Unil Yun, Heungmo Ryang, Donggyu Kim:
Approximate Maximal Frequent Pattern Mining with Weight Conditions and Error Tolerance. Int. J. Pattern Recognit. Artif. Intell. 30(6): 1650012:1-1650012:42 (2016) - [j10]Unil Yun, Donggyu Kim, Heungmo Ryang, Gangin Lee, Kyung-Min Lee:
Mining recent high average utility patterns based on sliding window from stream data. J. Intell. Fuzzy Syst. 30(6): 3605-3617 (2016) - [j9]Unil Yun, Gangin Lee, Chulhong Kim:
The Smallest Valid Extension-Based Efficient, Rare Graph Pattern Mining, Considering Length-Decreasing Support Constraints and Symmetry Characteristics of Graphs. Symmetry 8(5): 32 (2016) - [j8]Gangin Lee, Unil Yun, Kyung-Min Lee:
Analysis of tree-based uncertain frequent pattern mining techniques without pattern losses. J. Supercomput. 72(11): 4296-4318 (2016) - [c8]Gangin Lee, Unil Yun:
Analysis of Recent Maximal Frequent Pattern Mining Approaches. CSA/CUTE 2016: 873-877 - 2015
- [j7]Jiwon Kim, Unil Yun, Gwangbum Pyun, Heungmo Ryang, Gangin Lee, Eunchul Yoon, Keun Ho Ryu:
A blog ranking algorithm using analysis of both blog influence and characteristics of blog posts. Clust. Comput. 18(1): 157-164 (2015) - [j6]Gangin Lee, Unil Yun, Heungmo Ryang:
Mining weighted erasable patterns by using underestimated constraint-based pruning technique. J. Intell. Fuzzy Syst. 28(3): 1145-1157 (2015) - [j5]Gangin Lee, Unil Yun, Heungmo Ryang:
An uncertainty-based approach: Frequent itemset mining from uncertain data with different item importance. Knowl. Based Syst. 90: 239-256 (2015) - [j4]Heungmo Ryang, Unil Yun, Gwangbum Pyun, Gangin Lee, Jiwon Kim:
Ranking algorithm for book reviews with user tendency and collective intelligence. Multim. Tools Appl. 74(16): 6209-6227 (2015) - [j3]Gangin Lee, Unil Yun, Heungmo Ryang, Donggyu Kim:
Multiple Minimum Support-Based Rare Graph Pattern Mining Considering Symmetry Feature-Based Growth Technique and the Differing Importance of Graph Elements. Symmetry 7(3): 1151-1163 (2015) - 2014
- [j2]Gangin Lee, Unil Yun, Keun Ho Ryu:
Sliding window based weighted maximal frequent pattern mining over data streams. Expert Syst. Appl. 41(2): 694-708 (2014) - [j1]Unil Yun, Gangin Lee, Keun Ho Ryu:
Mining maximal frequent patterns by considering weight conditions over data streams. Knowl. Based Syst. 55: 49-65 (2014) - 2013
- [c7]Gangin Lee, Unil Yun:
Frequent Graph Pattern Mining with Length-Decreasing Support Constraints. MUE 2013: 185-192 - [c6]Gangin Lee, Unil Yun:
Frequent Graph Mining Based on Multiple Minimum Support Constraints. MUSIC 2013: 19-23 - 2012
- [c5]Gangin Lee, Unil Yun:
An Efficient Approach for Mining Frequent Sub-graphs with Support Affinities. ICHIT (1) 2012: 525-532 - [c4]Unil Yun, Heungmo Ryang, Gwangbum Pyun, Gangin Lee:
Efficient Opinion Article Retrieval System. ICHIT (1) 2012: 566-573 - [c3]Unil Yun, Gangin Lee, Sung-Jin Kim:
Analyzing Efficient Algorithms of Frequent Pattern Mining. ICITCS 2012: 937-945 - [c2]Gangin Lee, Unil Yun:
Efficient Isomorphic Decision for Mining Sub Graphs with a Cyclic Form. ICITCS 2012: 947-956 - [c1]Gangin Lee, Unil Yun:
Mining Weighted Frequent Sub-graphs with Weight and Support Affinities. MIWAI 2012: 224-235
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
