High Quality, Efficient Hierarchical Document Clustering Using Closed Interesting Itemsets [PDF]
, 2006 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,
Malik, Hassan H. +3 more
core +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 +3 more
core
ItemListFCI：An Algorithm for Mining Closed Frequent Itemsets Based on Bit Table
, 2010 Mining closed frequent itemsets in data streams is an important task in stream data mining. Most of the traditional algorithms for mining closed frequent itemsets are Apriori-based which find the frequent itemsets from large amount of candidates, and ...
Ling Chen, Cai Yan Dai, Ke Ming Tang
core +1 more source
Distributed mining of frequent closed itemsets: some preliminary results
, 2005 In this paper we address the problem of mining frequent closed itemsets in a distributed setting. We gure out an environment where a transactional dataset is horizontally partitioned and stored in di erent sites.
Lucchese C, Perego R, Orlando S
core
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
Mining Frequent Closed Itemsets without Duplicates Generation
, 2004 Closed itemsets are semantically equivalent to frequent itemsets but are orders of magnitude fewer, thus allowing the knowledge extracted from a transactional database to be represented very concisely.
Lucchese C, Perego R, Orlando S
core
Size of random Galois lattices and number of frequent itemsets [PDF]
, 2005 19 pagesWe compute the mean and the variance of the size of the Galois lattice built from a random matrix with i.i.d. Bernoulli(p) entries. Then, obseving that closed frequent itemsets are in bijection with winning coalitions, we compute the mean and the
Emilion, Richard, Levy, Gerard
core +2 more sources
Penggalian Top-K Frequent Closed Constrained Gradient Itemsets Tanpa Batasan Minimum Support Pada Basis Data Retail [PDF]
, 2009 Penggalian top-k frequent closed itemsets dengan algoritma TFP tanpa menggunakan minimum support merupakan salah satu penelitian yang menarik untuk diaplikasikan dalam analisis asosiasi.
djunaidy, Arif, Absari, Dhiani Tresna
core +2 more sources
Missing Value Imputation Method for Multiclass Matrix Data Based on Closed Itemset. [PDF]
Entropy (Basel), 2022 Tada M, Suzuki N, Okada Y.
europepmc +1 more source
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