Results 51 to 60 of about 846,106 (226)
CLOLINK: An Adapted Algorithm for Mining Closed Frequent Itemsets [PDF]
, 2012 Mining of the complete set of frequent itemsets will lead to a huge number of itemsets. Fortunately, this problem can be reduced to the mining of closed frequent itemsets, which results in a much smaller number of itemsets.
Onashoga, Adebukola, Adebukola Onashoga
core +1 more source
Reading Research Quarterly, Volume 61, Issue 2, April/May/June 2026.This study introduces and validates the Self‐Efficacy for Online Reading Questionnaire (SEORQ), a process‐grounded instrument designed to measure secondary students' efficacy in executing the core demands of online reading. The model conceptualizes online reading self‐efficacy as a multidimensional construct encompassing five interrelated processes ...
SeongYeup Kim +2 more
wiley +1 more source
Frequent itemsets (min. support ≥ 0.40).
, 2018 Frequent itemsets (min. support ≥ 0.40).
Justin Zhan (5545352) +2 more
core +1 more source
Proposed Algorithm for Extracting Association Rule Depend on Closed Frequent Itemset (EACFI) [PDF]
Engineering and Technology Journal, 2011 Association rules are important one of data mining activities. All algorithms of association rule mining consist of finding frequency of itemsets, which satisfy a minimum support threshold, and then compute confidence percentage for each k-itemsets to ...
Emad k. Jbbar, Yaser Munther
doaj +1 more source
Personalized and Explainable Aspect‐Based Recommendation Using Latent Opinion Groups
Computational Intelligence, Volume 42, Issue 2, April 2026.ABSTRACT The problem of explainable recommendation—supporting the recommendation of a product or service with an explanation of why the item is a good choice for the user—is attracting substantial research attention recently. Recommendations associated with an explanation of how the aspects of the chosen item may meet the needs and preferences of the ...
Maryam Mirzaei +2 more
wiley +1 more source
Mining all non-derivable frequent itemsets
, 2002 Recent studies on frequent itemset mining algorithms resulted in significant performance improvements. However, if the minimal support threshold is set too low, or the data is highly correlated, the number of frequent itemsets itself can be prohibitively
Toivonen, H. +4 more
core +1 more source
Efficient Associate Rules Mining Based on Topology for Items of Transactional Data
Mathematics, 2023 A challenge in association rules’ mining is effectively reducing the time and space complexity in association rules mining with predefined minimum support and confidence thresholds from huge transaction databases.
Bo Li, Zheng Pei, Chao Zhang, Fei Hao
doaj +1 more source
Critical Review for One‐Class Classification: Recent Advances and Reality Behind Them
WIREs Data Mining and Knowledge Discovery, Volume 16, Issue 1, March 2026.This review presents a new taxonomy to summarize one‐class classification (OCC) algorithms and their applications. The main argument is that OCC should not learn multiple classes. The paper highlights common violations of OCC involving multiple classes.
Toshitaka Hayashi +3 more
wiley +1 more source
Hiding co-occurring frequent itemsets [PDF]
Proceedings of the 2009 EDBT/ICDT Workshops, 2009 Knowledge hiding, hiding rules/patterns that are inferable from published data and attributed sensitive, is extensively studied in the literature in the context of frequent itemsets and association rules mining from transactional data. The research in this thread is focused mainly on developing sophisticated methods that achieve less distortion in data
openaire +3 more sources
A Fast Approach for Up-Scaling Frequent Itemsets
IEEE Access, 2020 With the rapid growth of data scale and diversification of demand, people have an urgent desire to extract useful frequent itemset from datasets of different scales. It is no doubt that the traditional method can solve the problem.
Runzi Chen, Shuliang Zhao, Mengmeng Liu
doaj +1 more source