default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChanhee Lee 0005
Person information
- affiliation: Sejong University, Department of Computer Engineering, Seoul, Korea
Other persons with the same name
- Chanhee Lee (aka: Chan-Hee Lee) — disambiguation page
- Chanhee Lee 0001
![[0009-0008-0215-8799]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0009-0008-0215-8799")
— Korea Advanced Institute of Science and Technology (KAIST), School of Computing, Daejeon, Korea - Chanhee Lee 0002 — Arizona State University, Tempe, AZ, USA (and 2 more)
- Chanhee Lee 0003 (aka: Chan-Hee Lee 0003) — City University of Hong Kong, Department of Computer Science, Hong Kong
- Chanhee Lee 0004 — NAVER Corporation, Korea (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j17]Hanju Kim, Myungha Cho, Seungwan Park, Doyoon Kim, Doyoung Kim, Taewoong Ryu, Chanhee Lee, Unil Yun:
Temporal fuzzy utility-based data analysis on data streams. Expert Syst. Appl. 284: 127836 (2025)- [j16]Heonho Kim, Hanju Kim, Myungha Cho, Taewoong Ryu, Chanhee Lee, Unil Yun:
Regularity-driven pattern extraction and analysis approach by the pre-pruning technique without pattern loss. Future Gener. Comput. Syst. 166: 107670 (2025) - [j15]Doyoung Kim, Seungwan Park, Heonho Kim, Chanhee Lee, Hanju Kim, Myungha Cho, Seongbin Park, Unil Yun:
Pre-Eminent Utility Driven Data Analytics Based on Prelarge Patterns for Dynamic Transaction Deletion in IoT Environments. IEEE Internet Things J. 12(13): 24470-24489 (2025) - [j14]Doyoung Kim, Heonho Kim, Seungwan Park, Hanju Kim, Myungha Cho, Seongbin Park, Taewoong Ryu, Chanhee Lee, Hyeonmo Kim, Unil Yun:
Efficient mining of incremental high utility patterns with negative unit profits over all the accumulated stream data. Knowl. Based Syst. 325: 113956 (2025) - [j13]Unil Yun, Hanju Kim, Myungha Cho, Taewoong Ryu, Seungwan Park, Doyoon Kim, Doyoung Kim, Chanhee Lee, Witold Pedrycz:
Utility-Driven Data Analytics Algorithm for Transaction Modifications Using Pre-Large Concept With Single Database Scan. IEEE Trans. Big Data 11(5): 2792-2808 (2025) - [j12]Myungha Cho, Hanju Kim, Yoonji Baek, Seungwan Park, Doyoon Kim, Doyoung Kim, Chanhee Lee, Bay Vo, Witold Pedrycz, Unil Yun:
Uncertainty-Driven Pattern Mining on Incremental Data for Stream Analyzing Service. IEEE Trans. Serv. Comput. 18(2): 1081-1096 (2025) - [j11]Hanju Kim, Myungha Cho, Hyeonmo Kim, Yoonji Baek, Chanhee Lee, Taewoong Ryu, Heonho Kim, Seungwan Park, Doyoon Kim, Doyoung Kim, Sinyoung Kim, Bay Vo, Jerry Chun-Wei Lin, Witold Pedrycz, Unil Yun:
Uncertainty Oriented-Incremental Erasable Pattern Mining Over Data Streams. IEEE Trans. Syst. Man Cybern. Syst. 55(2): 1451-1465 (2025) - 2024
- [j10]Chanhee Lee, Hanju Kim, Myungha Cho, Hyeonmo Kim, Bay Vo, Jerry Chun-Wei Lin, Philippe Fournier-Viger, Unil Yun:
Incremental Top-k High Utility Pattern Mining and Analyzing Over the Entire Accumulated Dynamic Database. IEEE Access 12: 77605-77620 (2024) - [j9]Yoonji Baek, Hanju Kim, Myungha Cho, Hyeonmo Kim, Chanhee Lee, Taewoong Ryu, Heonho Kim, Bay Vo, Vincent W. Gan, Philippe Fournier-Viger, Jerry Chun-Wei Lin, Witold Pedrycz, Unil Yun:
An efficient approach for incremental erasable utility pattern mining from non-binary data. Knowl. Inf. Syst. 66(10): 5919-5958 (2024) - 2023
- [j8]Hyeonmo Kim, Taewoong Ryu, Chanhee Lee, Sinyoung Kim, Bay Vo, Jerry Chun-Wei Lin, Unil Yun:
Efficient Method for Mining High Utility Occupancy Patterns Based on Indexed List Structure. IEEE Access 11: 43140-43158 (2023) - [j7]Hyeonmo Kim, Chanhee Lee, Taewoong Ryu, Heonho Kim, Sinyoung Kim, Bay Vo, Jerry Chun-Wei Lin, Unil Yun:
Pre-large based high utility pattern mining for transaction insertions in incremental database. Knowl. Based Syst. 268: 110478 (2023) - [j6]Taewoong Ryu, Hyeonho Kim, Chanhee Lee, Heonmo Kim, Bay Vo, Jerry Chun-Wei Lin, Witold Pedrycz, Unil Yun:
Scalable and Efficient Approach for High Temporal Fuzzy Utility Pattern Mining. IEEE Trans. Cybern. 53(12): 7672-7685 (2023) - 2022
- [j5]Heonho Kim, Taewoong Ryu, Chanhee Lee, Hyeonmo Kim, Eunchul Yoon, Bay Vo, Jerry Chun-Wei Lin, Unil Yun:
EHMIN: Efficient approach of list based high-utility pattern mining with negative unit profits. Expert Syst. Appl. 209: 118214 (2022) - [j4]Taewoong Ryu, Unil Yun, Chanhee Lee, Jerry Chun-Wei Lin, Witold Pedrycz:
Occupancy-based utility pattern mining in dynamic environments of intelligent systems. Int. J. Intell. Syst. 37(9): 5477-5507 (2022) - [j3]Chanhee Lee, Yoonji Baek, Taewoong Ryu, Hyeonmo Kim, Heonho Kim, Jerry Chun-Wei Lin, Bay Vo, Unil Yun:
An efficient approach for mining maximized erasable utility patterns. Inf. Sci. 609: 1288-1308 (2022) - [j2]Chanhee Lee, Yoonji Baek, Jerry Chun-Wei Lin, Tin C. Truong, Unil Yun:
Advanced uncertainty based approach for discovering erasable product patterns. Knowl. Based Syst. 241: 108134 (2022) - [j1]Chanhee Lee, Taewoong Ryu, Hyeonmo Kim, Heonho Kim, Bay Vo, Jerry Chun-Wei Lin, Unil Yun:
Efficient approach of sliding window-based high average-utility pattern mining with list structures. Knowl. Based Syst. 256: 109702 (2022)
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 2025-10-31 22:14 CET 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:
