Results 81 to 90 of about 739 (208)

Mining Frequent Closed Itemsets with the Frequent Pattern List

, 2008
The 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 frequent closed itemsets (FCIs), which results in a much smaller number of itemsets.
Ching-chi Hsu, Henry Chen, Fan-chen Tseng   +2 more
core  

Optimized Closed Frequent High Utility Itemset Mining Using OSR, OWL, and MSU Pruning on Retail Transaction Data

JUTI: Jurnal Ilmiah Teknologi Informasi
This research proposes the optimization of the Frequent Closed High-Utility Itemset Mining (FCHUIM) algorithm for retail transaction datasets using heuristic-based pruning techniques, Observed Support Ratio (OSR), Observed Weighted Lift (OWL), and ...
Kinana Syah Sulanjari, Chastine Fatichah
doaj   +1 more source

Moment: Maintaining closed frequent itemsets over a stream sliding window

, 2004
This paper considers the problem of mining closed frequent itemsets over a sliding window using limited memory space. We design a synopsis data structure to monitor transactions in the sliding window so that we can output the current closed frequent ...
Philip S. Yu, Yun Chi, Richard R. Muntz, Haixun Wang   +3 more
core  

High Quality, Efficient Hierarchical Document Clustering using Closed Interesting Itemsets

, 2008
High dimensionality remains a significant challenge for document clustering. Recent approaches used frequent itemsets and closed frequent itemsets to reduce dimensionality, and to improve the efficiency of hierarchical document clustering. In this paper,

core  

Closed Itemset Mining: A graph theory perspective

Informatica
Data Mining is the field which targets the extraction and the analysis ofusable data from a large database. In this paper, we focus on the most studiedproblems in the field. That is finding closed frequent itemsets. Up to now,various graph theory techniques have been proposed to solve the frequentitemsets problem.
Fatima Zohra Lebbah, Moussa Larbani, Abdellatif Rahmoun   +2 more
openaire   +1 more source

Using Attribute Value Lattice to Find Closed Frequent Itemsets

, 2008
Finding all closed frequent itemsets is a key step of association rule mining since the non-redundant association rule can be inferred from all the closed frequent itemsets. In this paper we present a new method for finding closed frequent itemsets based
Eric Louie, T. Y. Lin Xiaohua, Tony Hu
core  

Size of random Galois lattices and number of closed frequent itemsets

, 2009
Given a sample of binary random vectors with i.i.d. Bernoulli(p) components, that is equal to 1 (resp. 0) with probability p (resp. 1−p), we first establish a formula for the mean of the size of the random Galois lattice built from this sample, and a ...
Lévy, Gérard, Emilion, Richard
core   +1 more source

Mining frequent itemsets a perspective from operations research

Many papers on frequent itemsets have been published. Besides somecontests in this field were held. In the majority of the papers the focus ison speed. Ad hoc algorithms and datastructures were introduced.
Kosters, W.A., Pijls, W.H.L.M.
core  

A Comparative Study of Frequent Pattern Mining with Trajectory Data. [PDF]

Sensors (Basel), 2022
Ding S, Li Z, Zhang K, Mao F.
europepmc   +1 more source

Deriving Frequent Itemsets from Lossless Condensed Representation

, 2020
In data mining, major research topic is frequent itemset mining (FIM). Frequent Itemsets (FIs) usually generating a large amount of Itemsets from database it causing from high memory and long execution time usage.
A. Subashini, M. Karthikeyan
core   +1 more source