Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

An efficient approach for mining maximized erasable utility patterns
Chanhee Lee, Yoonji Baek, Taewoong Ryu, et al.
Information Sciences (2022) Vol. 609, pp. 1288-1308
Closed Access | Times Cited: 12

Showing 12 citing articles:

Efficient approach for mining high-utility patterns on incremental databases with dynamic profits
Sinyoung Kim, Hanju Kim, Myungha Cho, et al.
Knowledge-Based Systems (2023) Vol. 282, pp. 111060-111060
Closed Access | Times Cited: 18
Efficient approach of high average utility pattern mining with indexed list-based structure in dynamic environments
Hyeonmo Kim, Hanju Kim, Myungha Cho, et al.
Information Sciences (2023) Vol. 657, pp. 119924-119924
Closed Access | Times Cited: 16
Advanced incremental erasable pattern mining from the time-sensitive data stream
Hanju Kim, Myungha Cho, Hyoju Nam, et al.
Knowledge-Based Systems (2024) Vol. 299, pp. 112001-112001
Closed Access | Times Cited: 7
Damped weighted erasable itemset mining with time sensitive dynamic environments
Hanju Kim, Myungha Cho, Seungwan Park, et al.
Journal Of Big Data (2025) Vol. 12, Iss. 1
Open Access
Approximate Erasable Pattern Discovery and Analytics on Stream Data
Seungwan Park, Hyunsoo Kim, Hanju Kim, et al.
Knowledge-Based Systems (2025), pp. 113161-113161
Closed Access
Efficient Fuzzy-based High Utility Pattern Computing and Analyzing Approach with Temporal Properties
Unil Yun, Hyeonmo Kim, Hanju Kim, et al.
Applied Soft Computing (2025), pp. 112902-112902
Closed Access
Efficient Method for Mining High Utility Occupancy Patterns Based on Indexed List Structure
Hyeonmo Kim, Taewoong Ryu, Chanhee Lee, et al.
IEEE Access (2023) Vol. 11, pp. 43140-43158
Open Access | Times Cited: 14
An efficient approach for incremental erasable utility pattern mining from non-binary data
Yoonji Baek, Hanju Kim, Myungha Cho, et al.
Knowledge and Information Systems (2024) Vol. 66, Iss. 10, pp. 5919-5958
Closed Access | Times Cited: 2
Regularity-driven pattern extraction and analysis approach by the pre-pruning technique without pattern loss
Heonho Kim, Hanju Kim, Myungha Cho, et al.
Future Generation Computer Systems (2024), pp. 107670-107670
Closed Access | Times Cited: 1
Parallel approaches to extract multi-level high utility itemsets from hierarchical transaction databases
Trinh D. D. Nguyen, N. T. Tung, Thiet Pham, et al.
Knowledge-Based Systems (2023) Vol. 276, pp. 110733-110733
Closed Access | Times Cited: 3
Fast privacy-preserving utility mining algorithm based on utility-list dictionary
Chunyong Yin, Ying Li
Applied Intelligence (2023) Vol. 53, Iss. 23, pp. 29363-29377
Closed Access | Times Cited: 2
Tree-Based Unified Temporal Erasable-Itemset Mining
Tzung‐Pei Hong, Jiaxiang Li, Yu‐Chuan Tsai, et al.
Lecture notes in computer science (2023), pp. 224-233
Closed Access
Page 1

Scroll to top