Results 61 to 70 of about 8,356 (188)

Frequent Closed High-Utility Itemset Mining Algorithm Based on Leiden Community Detection and Compact Genetic Algorithm

open access: yesIEEE Access
Traditional pattern mining algorithms are based on tree and linked list structures. However, they often only consider a single factor of frequency or utility and have to deal with exponential search spaces as well as generate numerous candidates.
Xiumei Zhao, Xincheng Zhong, Bing Han
doaj   +1 more source

Mining frequent itemsets from streaming transaction data using genetic algorithms

open access: yesJournal of Big Data, 2020
This paper presents a study of mining frequent itemsets from streaming data in the presence of concept drift. Streaming data, being volatile in nature, is particularly challenging to mine.
Sikha Bagui, Patrick Stanley
doaj   +1 more source

A Deduplication and Extraction Algorithm for Frequent Itemsets of Overlapping Data Between Power Categories Based on Variable Time Windows

open access: yesInternational Journal of Computational Intelligence Systems
In the process of data extraction, the rigid partitioning mechanism of fixed time windows leads to spatiotemporal heterogeneity mismatches in data distribution, resulting in semantic confusion and redundancy accumulation in mining results. To address the
Jie Zhang   +3 more
doaj   +1 more source

Negative and Positive Association Rules Mining from Text Using Frequent and Infrequent Itemsets

open access: yesThe Scientific World Journal, 2014
Association rule mining research typically focuses on positive association rules (PARs), generated from frequently occurring itemsets. However, in recent years, there has been a significant research focused on finding interesting infrequent itemsets ...
Sajid Mahmood   +2 more
doaj   +1 more source

FCHUIM: Efficient Frequent and Closed High-Utility Itemsets Mining

open access: yesIEEE Access, 2020
Mining a closed high-utility itemset is a prevalent research task in analyzing transaction databases. However, numerous target itemsets are generated in the closed high-utility itemset mining task.
Tianyou Wei   +5 more
doaj   +1 more source

Observations on Factors Affecting Performance of MapReduce based Apriori on Hadoop Cluster

open access: yes, 2017
Designing fast and scalable algorithm for mining frequent itemsets is always being a most eminent and promising problem of data mining. Apriori is one of the most broadly used and popular algorithm of frequent itemset mining.
Garg, Rakhi   +2 more
core   +1 more source

Theoretical Properties of Closed Frequent Itemsets in Frequent Pattern Mining

open access: yesMathematics
Closed frequent itemsets (CFIs) play a crucial role in frequent pattern mining by providing a compact and complete representation of all frequent itemsets (FIs).
Huina Zhang   +4 more
doaj   +1 more source

AN EFFICIENT ALGORITHM FOR MINING HIGH UTILITY ITEMSETS

open access: yesTạp chí Khoa học
High utility itemsets (HUIs) mining is the finding of itemsets that satisfy a user-defined minimum utility threshold. Many successful studies in this field have been carried out, however they are all reliant on Tidset techniques, which records the ...
Nguyen Thi Thanh Thuy*, Nguyen Van Le, Manh Thien Ly
doaj   +1 more source

A Robust Technique for Closed Frequent and High Utility Itemsets Mining: Closed-FHUIM

open access: yesIEEE Access
Frequent itemset mining (FIM) and high utility itemset mining (HUIM) are popular data mining techniques used in various real-world applications such as retail-market, bio-medicine, and click-stream analysis.
Muhammad Waheed Ashraf   +2 more
doaj   +1 more source

ENHANCED ALGORITHMS FOR MINING OPTIMIZED POSITIVE AND NEGATIVE ASSOCIATION RULE FROM CANCER DATASET

open access: yesICTACT Journal on Soft Computing, 2018
The most important research aspect nowadays is the data. Association rule mining is vital mining used in data which mines many eventual informations and associations from enormous databases.
I Berin Jeba Jingle, J Jeya ACelin
doaj   +1 more source

Home - About - Disclaimer - Privacy