Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Jurnal Generic

Analisis Market Basket Dengan Algoritma Apriori dan FP-Growth Erwin Erwin
Generic Vol 4 No 2 (2009): Vol 4, No 2 (2009)
Publisher : Fakultas Ilmu Komputer, Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Algoritma yang umum digunakan dalam proses pencarian frequent itemsets (data yang paling sering muncul) adalah Apriori. Tetapi algoritma Apriori memiliki kekurangan yaitu membutuhkan waktu yang lama dalam proses pencarian frequent itemsets. Untuk mengatasi hal tersebut maka digunakanlah algoritma FP-Growth. Dalam makalah ini akan dibahas penerapan Apriori dan FP-Growth dalam proses pencarian frequent itemsets. Penggunaan FP-Tree yang digunakan bersamaan dengan algoritma FP-growth untuk menentukan frequent itemset dari sebuah database, berbeda dengan paradigma Apriori yang memerlukan langkah candidate generation, yaitu dengan melakukan scanning database secara berulang-ulang untuk menentukan frequent itemset. Makalah ini juga menyajikan pembahasan mengenai perbandingan kompleksitas waktu antara algoritma FP-growth dengan Apriori dan hasil dari perbandingan algoritma tersebut.
The Application of Text Compression to Short Message Service Using Huffman Table Ahmad Affandi; Saparudin Saparudin; Erwin Erwin
Generic Vol 6 No 1 (2011): Vol 6, No 1 (2011)
Publisher : Fakultas Ilmu Komputer, Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Short Message Service (SMS) is a way of sending short messages in a quick and relatively cheap price. However, besides easiness provided, these SMSs limit the number of characters that can be sent by users. A message sent via SMS, has a maximum capacity of 140 bytes. This causes a person who wants to send a message long enough, consists of a number of characters will have difficulty. Although it is delivered, the message must be assembled into a number of SMS based on maximum capacity. Several ways can be performed to overcome this, one of them by doing compression. By using Huffman table an application text compression on SMS is made in order to compress and decompress when sending and receiving message. This application is made by J2ME and will run on mobile phones based on MIDP 2.0. The results of this study SMS text compression application with Huffman table overall is able to perform the compression process of an SMS text with an average compression ratio of 28.73%.