High Scalability Document Clustering Algorithm Based On Top-K Weighted Closed Frequent Itemsets
Documents clustering based on frequent itemsets can be regarded a new method of documents clustering which is aimed to overcome curse of dimensionality of items produced by documents being clustered. The Maximum Capturing (MC) technique is an algorithm of documents clustering based on frequent items...
Main Authors: | Gede Aditra Pradnyana, Arif Djunaidy |
---|---|
Format: | Article |
Language: | English |
Published: |
Ikatan Ahli Informatika Indonesia
2021-04-01
|
Series: | Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) |
Subjects: | |
Online Access: | http://jurnal.iaii.or.id/index.php/RESTI/article/view/2987 |
Similar Items
-
TKFIM: Top-K frequent itemset mining technique based on equivalence classes
by: Saood Iqbal, et al.
Published: (2021-03-01) -
Right-Hand Side Expanding Algorithm for Maximal Frequent Itemset Mining
by: Yalong Zhang, et al.
Published: (2021-11-01) -
A Fast Approach for Up-Scaling Frequent Itemsets
by: Runzi Chen, et al.
Published: (2020-01-01) -
Finding Stable Periodic-Frequent Itemsets in Big Columnar Databases
by: Hong N. Dao, et al.
Published: (2023-01-01) -
New and Efficient Algorithms for Producing Frequent Itemsets with the Map-Reduce Framework
by: Yaron Gonen, et al.
Published: (2018-11-01)