STUDI DAN IMPLEMENTASI ALGORITMA H MINE UNTUK MENEMUKAN FREQUENT PATTERNS

VERONIKA SAPUTRI

Informasi Dasar

113010025
629.8
Karya Ilmiah - Skripsi (S1) - Reference

ABSTRAKSI: Generally, large databases potent to hide a lot of high valuable information. The information can be obtained by paying attention to repeatly accuring patterns. Frequent Pattern is one of important recuring pattern type in data mining.
Getting frequent pattern from large databases needs big enough cost. Therefore an efficient algorithm is necessity. H-Mine is a mining frequent pattern algorithm which has good performance. H-Mine is an efficient algorithm since not require generation of candidate frequent pattern. H-Mine uses a data structure called H-Struct to generate frequent patterns. In this final project, the writer tries to study complexity of H-Mine algorithm. For performance analyse requirement of H-Mine algorithm, then would be builded a software for implementing H-Mine algorithm. But the software that has been built only could generate pattern with maximum length three. Because, the writer cann’t implement recursive function of H-Mine algorithm.Kata Kunci : frequent pattern, minimum support , H-Mine, H-Struct.ABSTRACT: Generally, large databases potent to hide a lot of high valuable information. The information can be obtained by paying attention to repeatly accuring patterns. Frequent Pattern is one of important recuring pattern type in data mining.
Getting frequent pattern from large databases needs big enough cost. Therefore an efficient algorithm is necessity. H-Mine is a mining frequent pattern algorithm which has good performance. H-Mine is an efficient algorithm since not require generation of candidate frequent pattern. H-Mine uses a data structure called H-Struct to generate frequent patterns. In this final project, the writer tries to study complexity of H-Mine algorithm. For performance analyse requirement of H-Mine algorithm, then would be builded a software for implementing H-Mine algorithm. But the software that has been built only could generate pattern with maximum length three. Because, the writer cann’t implement recursive function of H-Mine algorithm.Keyword: frequent pattern, minimum support , H-Mine, H-Struct.

Subjek

Otomation
 

Katalog

STUDI DAN IMPLEMENTASI ALGORITMA H MINE UNTUK MENEMUKAN FREQUENT PATTERNS
 
 
Indonesia

Sirkulasi

Rp. 0
Rp. 0
Tidak

Pengarang

VERONIKA SAPUTRI
Perorangan
Dhinta Darmantoro, Arie Ardiyanti Suryani
 

Penerbit

Universitas Telkom
Bandung
2008

Koleksi

Kompetensi

 

Download / Flippingbook

 

Ulasan

Belum ada ulasan yang diberikan
anda harus sign-in untuk memberikan ulasan ke katalog ini