default search action
Hyeonmo Kim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Chanhee Lee, Hanju Kim, Myungha Cho
, Hyeonmo Kim, Bay Vo
Incremental Top-k High Utility Pattern Mining and Analyzing Over the Entire Accumulated Dynamic Database. IEEE Access 12: 77605-77620 (2024) - [j9]Hyeonmo Kim, Hanju Kim, Myungha Cho
Efficient approach of high average utility pattern mining with indexed list-based structure in dynamic environments. Inf. Sci. 657: 119924 (2024) - [j8]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
An efficient approach for incremental erasable utility pattern mining from non-binary data. Knowl. Inf. Syst. 66(10): 5919-5958 (2024) - 2023
- [j7]Hyeonmo Kim, Taewoong Ryu, Chanhee Lee, Sinyoung Kim, Bay Vo
Efficient Method for Mining High Utility Occupancy Patterns Based on Indexed List Structure. IEEE Access 11: 43140-43158 (2023) - [j6]Hyeonmo Kim, Heonho Kim, Sinyoung Kim, Hanju Kim, Myungha Cho
An advanced approach for incremental flexible periodic pattern mining on time-series data. Expert Syst. Appl. 230: 120697 (2023) - [j5]Hyeonmo Kim, Chanhee Lee, Taewoong Ryu, Heonho Kim, Sinyoung Kim, Bay Vo
Pre-large based high utility pattern mining for transaction insertions in incremental database. Knowl. Based Syst. 268: 110478 (2023) - [j4]Sinyoung Kim, Hanju Kim, Myungha Cho
Efficient approach for mining high-utility patterns on incremental databases with dynamic profits. Knowl. Based Syst. 282: 111060 (2023) - 2022
- [j3]Heonho Kim, Taewoong Ryu, Chanhee Lee, Hyeonmo Kim, Eunchul Yoon, Bay Vo, Jerry Chun-Wei Lin
EHMIN: Efficient approach of list based high-utility pattern mining with negative unit profits. Expert Syst. Appl. 209: 118214 (2022) - [j2]Chanhee Lee, Yoonji Baek, Taewoong Ryu, Hyeonmo Kim, Heonho Kim, Jerry Chun-Wei Lin
An efficient approach for mining maximized erasable utility patterns. Inf. Sci. 609: 1288-1308 (2022) - [j1]Chanhee Lee, Taewoong Ryu, Hyeonmo Kim, Heonho Kim, Bay Vo
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 2024-10-16 20:32 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: