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:

TKN: An efficient approach for discovering top-k high utility itemsets with positive or negative profits
Mohamed Ashraf, Tamer Abdelkader, Sherine Rady, et al.
Information Sciences (2021) Vol. 587, pp. 654-678
Closed Access | Times Cited: 25

Showing 25 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
Incremental Top-k High Utility Pattern Mining and Analyzing Over the Entire Accumulated Dynamic Database
Chanhee Lee, Hanju Kim, Myungha Cho, et al.
IEEE Access (2024) Vol. 12, pp. 77605-77620
Open Access | Times Cited: 5
Efficient sampling policy to accelerate high utility pattern mining at given accuracy level
Zhongjie Zhang, Jian Huang
Applied Soft Computing (2025), pp. 112606-112606
Closed Access
An efficient utility-list based high-utility itemset mining algorithm
Zaihe Cheng, Wei Fang, Wei Shen, et al.
Applied Intelligence (2022) Vol. 53, Iss. 6, pp. 6992-7006
Closed Access | Times Cited: 24
FTKHUIM: A Fast and Efficient Method for Mining Top-K High-Utility Itemsets
Vinh V. Vu, Mi T. H. Lam, Thuy T. M. Duong, et al.
IEEE Access (2023) Vol. 11, pp. 104789-104805
Open Access | Times Cited: 13
An efficient method for mining High-Utility itemsets from unstable negative profit databases
N. T. Tung, Trinh D. D. Nguyen, Loan T. T. Nguyen, et al.
Expert Systems with Applications (2023) Vol. 237, pp. 121489-121489
Closed Access | Times Cited: 12
Efficient mining of closed high-utility itemsets in dynamic and incremental databases
Mahnaz Naderi Vlashejerdi, Negin Daneshpour
Engineering Applications of Artificial Intelligence (2025) Vol. 144, pp. 110081-110081
Closed Access
Efficient mining top-k high utility itemsets in incremental databases based on threshold raising strategies and pre-large concept
N. T. Tung, Loan T. T. Nguyen, Trinh D. D. Nguyen, et al.
Knowledge-Based Systems (2025), pp. 113273-113273
Closed Access
Skyline recency–frequency–monetary pattern mining based on different constraint degrees
Xiaojie Zhang, Guoting Chen, Linqi Song, et al.
Engineering Applications of Artificial Intelligence (2025) Vol. 149, pp. 110529-110529
Closed Access
An efficient method for mining top-k multi-level high utility itemsets
Loan T. T. Nguyen, Loan T. T. Nguyen, Bay Vo
Knowledge-Based Systems (2025), pp. 113359-113359
Closed Access
Mining high-utility sequences with positive and negative values
Xiaojie Zhang, Fuyin Lai, Guoting Chen, et al.
Information Sciences (2023) Vol. 637, pp. 118945-118945
Closed Access | Times Cited: 8
Efficient privacy preserving algorithms for hiding sensitive high utility itemsets
Mohamed Ashraf, Sherine Rady, Tamer Abdelkader, et al.
Computers & Security (2023) Vol. 132, pp. 103360-103360
Closed Access | Times Cited: 7
Mining Top-K constrained cross-level high-utility itemsets over data streams
Meng Han, Shujuan Liu, Zhihui Gao, et al.
Knowledge and Information Systems (2024)
Closed Access | Times Cited: 2
An efficient strategy for mining high-efficiency itemsets in quantitative databases
Bao Huynh, N. T. Tung, Trinh D. D. Nguyen, et al.
Knowledge-Based Systems (2024) Vol. 299, pp. 112035-112035
Closed Access | Times Cited: 2
TKU-PSO: An Efficient Particle Swarm Optimization Model for Top-K High-Utility Itemset Mining
Simen Carstensen, Jerry Chun‐Wei Lin
International Journal of Interactive Multimedia and Artificial Intelligence (2024) Vol. In press, Iss. In press, pp. 1-1
Open Access | Times Cited: 1
Top-k high utility itemset mining: current status and future directions
Rajiv Kumar, Kuldeep Singh
The Knowledge Engineering Review (2024) Vol. 39
Closed Access | Times Cited: 1
Advanced approach for mining utility occupancy patterns in incremental environment
Myungha Cho, Hanju Kim, Seungwan Park, et al.
Knowledge-Based Systems (2024) Vol. 306, pp. 112713-112713
Closed Access | Times Cited: 1
AN EFFICIENT HIDING METHOD FOR PRIVACY PRESERVING UTILITY MINING
Mohamed Ali, Sherine Rady, Tamer Abdelkader, et al.
International journal of intelligent computing and information sciences/International Journal of Intelligent Computing and Information Sciences (2023) Vol. 23, Iss. 1, pp. 69-83
Open Access | Times Cited: 2
IME: Efficient list-based method for incremental mining of maximal erasable patterns
Razieh Davashi
Pattern Recognition (2023) Vol. 148, pp. 110166-110166
Closed Access | Times Cited: 2
A Nature-Inspired Method to Mine Top-k Multi-Level High-Utility Itemsets
N. T. Tung, Trinh D. D. Nguyen, Loan T. T. Nguyen, et al.
Cybernetics & Systems (2023), pp. 1-22
Closed Access | Times Cited: 2
TKU-BChOA: an accurate meta-heuristic method to mine Top-k high utility itemsets
Amir Hossein Mofid, Negin Daneshpour, Zeinab Torabi, et al.
The Journal of Supercomputing (2024) Vol. 80, Iss. 14, pp. 21284-21305
Closed Access
Correlated time-window constrained high-utility itemsets mining with certain and uncertain real-life datasets
Sandipkumar Chandrakant Sagare, D. V. Kodavade
Multimedia Tools and Applications (2024)
Closed Access
Enabling knowledge discovery through low utility itemset mining
Xiaojie Zhang, Guoting Chen, Linqi Song, et al.
Expert Systems with Applications (2024), pp. 125955-125955
Closed Access
A Robust Privacy Preserving Approach for Sanitizing Transaction Databases from Sensitive High Utility Patterns
Mohamed Ashraf, Sherine Rady, Tamer Abdelkader, et al.
Lecture notes on data engineering and communications technologies (2022), pp. 381-394
Closed Access | Times Cited: 1
Mining top-k high average-utility itemsets based on breadth-first search
Xuan Liu, Genlang Chen, Fangyu Wu, et al.
Applied Intelligence (2023) Vol. 53, Iss. 23, pp. 29319-29337
Closed Access
Page 1

Scroll to top