Results 61 to 70 of about 739 (208)
Efficient Incremental Mining of Top-K Frequent Closed Itemsets
In this work we study the mining of top-$K$ frequent closed itemsets, a recently proposed variant of the classical problem of mining frequent closed itemsets where the support threshold is chosen as the maximum value sufficient to guarantee that the ...
PIETRACAPRINA, ANDREA ALBERTO +1 more
core +1 more source
This paper proposed an Automated Quality Assessment of SRS (AQA‐SRS) framework by integrating four popular methods which are; NLP, K‐means, MAS, and CBR to assess the quality of SRS documents. The NLP utilize for feature extraction, K‐means for features clustering, MAS for interactive assessment and feature selection decision, and CBR for managing the ...
Mohammed Ahmed Jubair +6 more
wiley +1 more source
DisClose: Discovering colossal closed itemsets via a memory efficient compact row-tree
A recent focus in itemset mining has been the discovery of frequent itemsets from high-dimensional datasets. With exponentially increasing running time as average row length increases, mining such datasets renders most conventional algorithms impractical.
Keane, John A +5 more
core +1 more source
The coal industry has always been a typically high‐risk industry with frequent accidents and extremely adverse impacts. Cases of accidents in coal mine ventilation systems serve as a concentrated demonstration of accident hazards and hold significant value for identifying key risk factors that may induce disasters in coal mine ventilation systems. This
Mingjia Jing +4 more
wiley +1 more source
Perbaikan Algoritma Charm Untuk Penggalian Frequent Closed Itemsets [PDF]
Penggalian frequent closed itemsets merupakan salah satu bagian penting dari penggalian kaidah asosiasi (association rule) karena dapat secara unik menentukan himpunan semua frequent itemsets dan supportnya.
Mardiyanto, Mardiyanto
core
Claim: An Efficient Method for Relaxed Frequent Closed Itemsets Mining over Stream Data
Recently, frequent itemsets mining over data streams attracted much attention. However, mining closed itemsets from data stream has not been well addressed.
SONG, Guojie +12 more
core +1 more source
An Algorithm of Mining Closed Frequent Itemsets [PDF]
Closed frequent itemset is a perfect representation of frequent itemset. This paper tries to find an efficient solution to mine the closed frequent itemsets over databases by sampling technique. We employ the SCFI tree to record the data synopsis of the frequent itemsets, and propose an efficient algorithm SCFI to maintain the SCFI.
openaire +1 more source
Unveiling Success Drivers in Gaming: A Machine Learning Study Across Steam, Twitch, and Metacritic
This study employs machine learning to assess the relative impact of major platforms—Steam, Twitch, and Metacritic—on video game revenue. Through an integrated analysis of three comprehensive datasets comprising commercially successful titles on Steam, key predictors of financial performance were identified.
Jiesi Ma, Michael J. Katchabaw
wiley +1 more source
User and artificial intelligence generated contents, coupled with the multimodal nature of information, have made the identification of false news an arduous task. While models can assist users in improving their cognitive abilities, commonly used black‐box models lack transparency, posing a significant challenge for interpretability.
Peng Wu +4 more
wiley +1 more source
AN EFFICIENT ALGORITHM FOR MINING HIGH UTILITY ITEMSETS
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

