Efficient tree structures for high utility pattern mining in incremental databases

CF Ahmed, SK Tanbeer, BS Jeong… - IEEE Transactions on …, 2009 - ieeexplore.ieee.org
Recently, high utility pattern (HUP) mining is one of the most important research issues in
data mining due to its ability to consider the nonbinary frequency values of items in …

Developing recommender systems with the consideration of product profitability for sellers

LS Chen, FH Hsu, MC Chen, YC Hsu - Information sciences, 2008 - Elsevier
In electronic commerce web sites, recommender systems are popularly being employed to
help customers in selecting suitable products to meet their personal needs. These systems …

Sliding window-based frequent pattern mining over data streams

SK Tanbeer, CF Ahmed, BS Jeong, YK Lee - Information sciences, 2009 - Elsevier
Finding frequent patterns in a continuous stream of transactions is critical for many
applications such as retail market data analysis, network monitoring, web usage mining, and …

Efficient single-pass frequent pattern mining using a prefix-tree

SK Tanbeer, CF Ahmed, BS Jeong, YK Lee - Information Sciences, 2009 - Elsevier
The FP-growth algorithm using the FP-tree has been widely studied for frequent pattern
mining because it can dramatically improve performance compared to the candidate …

Frequent itemset mining algorithms: a literature survey

O Jamsheela, G Raju - 2015 IEEE international advance …, 2015 - ieeexplore.ieee.org
Data mining is used for mining useful data from huge datasets and finding out meaningful
patterns from the data. Many organizations are now using data mining techniques. Frequent …

Interactive mining of high utility patterns over data streams

CF Ahmed, SK Tanbeer, BS Jeong, HJ Choi - Expert Systems with …, 2012 - Elsevier
High utility pattern (HUP) mining over data streams has become a challenging research
issue in data mining. When a data stream flows through, the old information may not be …

Evaluation metrics on text summarization: comprehensive survey

E Davoodijam, M Alambardar Meybodi - Knowledge and Information …, 2024 - Springer
Automatic text summarization is the process of shortening a large document into a summary
text that preserves the main concepts and key points of the original document. Due to the …

Single-pass incremental and interactive mining for weighted frequent patterns

CF Ahmed, SK Tanbeer, BS Jeong, YK Lee… - Expert Systems with …, 2012 - Elsevier
Weighted frequent pattern (WFP) mining is more practical than frequent pattern mining
because it can consider different semantic significance (weight) of the items. For this reason …

FIUT: A new method for mining frequent itemsets

YJ Tsay, TJ Hsu, JR Yu - Information Sciences, 2009 - Elsevier
This paper proposes an efficient method, the frequent items ultrametric trees (FIUT), for
mining frequent itemsets in a database. FIUT uses a special frequent items ultrametric tree …

An improved apriori algorithm

R Chang, Z Liu - Proceedings of 2011 International …, 2011 - ieeexplore.ieee.org
In this study, it proposes a new optimization algorithm called APRIORI-IMPROVE based on
the insufficient of Apriori. APRIORI-IMPROVE algorithm presents optimizations on 2-items …