Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : Jurnal Ilmu Komputer

METODE WEIGHTED MAXIMUM CAPTURING UNTUK KLASTERISASI DOKUMEN BERBASIS FREQUENT ITEMSETS Gede Aditra Pradnyana; Arif Djunaidy
Jurnal Ilmu Komputer Vol 6 No 2: September 2013
Publisher : Informatics Department, Faculty of Mathematics and Natural Sciences, Udayana University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (644.405 KB)

Abstract

Document clustering based on frequent itemsets is one of the new document clustering method that can be usedto overcome the problem of high-dimensional space of the document being clustered. Maximum capturingtechnique is one document clustering algorithm based frequent itemsets that can generate better clusteringquality compared to those produced by other similar algorithms. The maximum capturing technique still has thelack or weakness, ie: not accounting for the weight of a word (item) in the calculation of frequent itemsets whenthe document similarity and the cluster formation process does not take into account the global information ofthe cluster previously formed. In this research developed a new method for clustering documents based frequentitemset namely weighted maximum capturing method (WMC), to correct deficiencies maksimum capturingaccuracy so that the quality of document clustering results can be improved. In the weighted maximumcapturing method, document similarity is computed by combining the cosine similarity method and Jaccardcoefficient based on the same number of frequent itemsets owned so that the weight of items in itemsets can betaken into account, while in the process of constructing cluster adapted single linkage agglomerativehierarchical clustering algorithm. Experimental results show the value of F-measure and purity of WMC methodis better than the earlier method, that is equal to 0.723 for the F-measure with improvement ratio of 2.8% and apurity value of 0.73 with improvement ratio 3.3%.