High Scalability Document Clustering Algorithm Based On Top-K Weighted Closed Frequent Itemsets

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...

Full description

Bibliographic Details
Main Authors: Gede Aditra Pradnyana, Arif Djunaidy
Format: Article
Language:Indonesian
Published: Ikatan Ahli Indormatika Indonesia 2021-04-01
Series:Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi)
Subjects:
documents clustering
frequent itemsets
weighted maximum capturing
top-k closed frequent itemsets
Online Access:http://jurnal.iaii.or.id/index.php/RESTI/article/view/2987

Internet

http://jurnal.iaii.or.id/index.php/RESTI/article/view/2987

Similar Items