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
Comparison of K-Means and K-Medoids in Product Clustering Using RFM and Frequent Closed Itemset
AIRetailers managing large stock-keeping unit (SKU) catalogues need a compact, auditable view of how individual products behave in order to plan replenishment, assortment and promotions. We present an interpretable analytics pipeline that derives SKU-level
Arif Bramantoro +3 more
doaj +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
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
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
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
A First-Out Alarm Detection Method via Association Rule Mining and Correlation Analysis. [PDF]
Entropy (Basel), 2023 Li D, Cheng X.
europepmc +1 more source
Efficient Top-K Identical Frequent Itemsets Mining without Support Threshold Parameter from Transactional Datasets Produced by IoT-Based Smart Shopping Carts. [PDF]
Sensors (Basel), 2022 Rehman SU +4 more
europepmc +1 more source
DCI Closed: a fast and memory efficient algorithm to mine frequent closed itemsets
, 2004 One of the main problems raising up in the frequent closed itemsets mining problem is the duplicate detection. In this paper we propose a general technique for promptly detecting and discarding duplicate closed itemsets, without the need of keeping in ...
Lucchese C, Perego R, Orlando S
core
LCTree-Based Approach for Mining Frequent Items in Real-Time. [PDF]
Comput Intell Neurosci, 2022 Chen J +4 more
europepmc +1 more source