![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Heungmo Ryang
Person information
Refine list
![note](https://dblp.uni-trier.de./img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2017
- [j17]Heungmo Ryang, Unil Yun:
Indexed list-based high utility pattern mining with utility upper-bound reduction and pattern combination techniques. Knowl. Inf. Syst. 51(2): 627-659 (2017) - [j16]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) - 2016
- [j15]Unil Yun, Heungmo Ryang, Oh-Cheon Kwon:
Monitoring vehicle outliers based on clustering technique. Appl. Soft Comput. 49: 845-860 (2016) - [j14]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) - [j13]Heungmo Ryang, Unil Yun:
High utility pattern mining over data streams with sliding window technique. Expert Syst. Appl. 57: 214-231 (2016) - [j12]Heungmo Ryang, Unil Yun, Keun Ho Ryu:
Fast algorithm for high utility pattern mining with the sum of item quantities. Intell. Data Anal. 20(2): 395-415 (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) - 2015
- [j9]Unil Yun, Heungmo Ryang:
Incremental high utility pattern mining with static and dynamic databases. Appl. Intell. 42(2): 323-352 (2015) - [j8]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) - [j7]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) - [j6]Heungmo Ryang, Unil Yun:
Top-k high utility pattern mining with effective threshold raising strategies. Knowl. Based Syst. 76: 109-126 (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]Unil Yun, Heungmo Ryang, Keun Ho Ryu:
High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates. Expert Syst. Appl. 41(8): 3861-3878 (2014) - [j1]Heungmo Ryang, Unil Yun, Keun Ho Ryu:
Discovering high utility itemsets with multiple minimum supports. Intell. Data Anal. 18(6): 1027-1047 (2014)
Conference and Workshop Papers
- 2016
- [c9]Unil Yun, Heungmo Ryang:
Design of Shoot'em up Game Using OpenGL. CSA/CUTE 2016: 122-126 - [c8]Heungmo Ryang, Unil Yun:
Performance Analysis of Tree-Based Algorithms for Incremental High Utility Pattern Mining. CSA/CUTE 2016: 127-131 - 2013
- [c7]Heungmo Ryang, Unil Yun:
Unsupervised Keyphrase Extraction Based Ranking Algorithm for Opinion Articles. MUE 2013: 113-119 - [c6]Unil Yun, Heungmo Ryang:
Ranking Book Reviews Based on User Influence. MUE 2013: 135-141 - [c5]Heungmo Ryang, Unil Yun:
Ranking Book Reviews Based on User Discussion. MUSIC 2013: 7-11 - 2012
- [c4]Heungmo Ryang, Unil Yun:
Book Review Retrieval Techniques for Adopting Estimated Reviewer Quality. ICHIT (1) 2012: 550-557 - [c3]Unil Yun, Heungmo Ryang, Gwangbum Pyun, Gangin Lee:
Efficient Opinion Article Retrieval System. ICHIT (1) 2012: 566-573 - [c2]Heungmo Ryang, Unil Yun:
Collective Intelligence Based Algorithm for Ranking Book Reviews. ICITCS 2012: 1075-1083 - 2011
- [c1]Heungmo Ryang, Unil Yun:
Effective Ranking Techniques for Book Review Retrieval Based on the Structural Feature. ICHIT (1) 2011: 360-367
Coauthor Index
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint