EMAIL: PASSWORD:
Front Office
UPT. PERPUSTAKAAN
Institut Teknologi Sepuluh Nopember Surabaya


Kampus ITS Sukolilo - Surabaya 60111

Phone : 031-5921733 , 5923623
Fax : 031-5937774
E-mail : libits@its.ac.id
Website : http://library.its.ac.id

Support (Customer Service) :
timit_perpus@its.ac.id




Welcome..guys!

Have a problem with your access?
Please, contact our technical support below:
LIVE SUPPORT


Moh. Fandika Aqsa


Davi Wahyuni


Tondo Indra Nyata


Anis Wulandari


Ansi Aflacha




ITS » Undergraduate Theses » Teknik Informatika Ekstensi - S1
Posted by aguss at 14/01/2009 19:35:15  •  5557 Views


KLASIFIKASI SECARA EFISIEN PADA DATABASE MULTI RELASI DENGAN ALGORITMA CROSSMINE

EFFICIENT CLASSIFICATION IN MULTIPLE DATABASE RELATIONS BY CROSSMINE ALGORITM

Author :
SULISTYOWATI, INDRI 




ABSTRAK

Klasifikasi multi-relasi dapat digunakan secara luas dalam banyak disiplin seperti pembuatan keputusan keuangan penelitian medis dan aplikasi geografi dan informasi yang disimpan dalam multirelasi diperlukan dalam pembuatan keputusan. CrossMine suatu pendekatan yang efisien dan dapat diskala untuk klasifikasi multi-relasi. Algoritma crossmine memiliki tiga langkah pertama dimulai dari pencarian sekumpulan rule rule didapatkan dari proses pencarian sebuah rule yang kemudian diambil tuple positif yang memenuhi rule sampai tersisa lebih dari sepuluh persen. Langkah kedua adalah pencarian sebuah rule pada langkah ini memiliki input dari hasil proses pencarian predikat terbaik yaitu predikat komplek dengan nilai foilgain nilai foil gain dibandingkan dengan min gain jika hasilnya lebih besar min gain maka predikat tersebut ditambahkan dengan rule dan maksimal kedalaman relasi adalah kurang dari enam. Langkah ketiga adalah pencarian predikat terbaik pada langkah ini dilakukan pencarian predikat terbaik dengan ketentuan jika nilai foilgain lebih besar dari nilai max gain maka predikat akan disimpan dan nilai gain yang lebih besar akan menggantikan nilai gain sebelumnya untuk proses perbandingan selanjutnya. Sedangkan untuk accuracy dihitung dari masing masing rule yang dihasilkan pada proses pencarian sekumpulan rule. Dalam tugas akhir ini dibuat sebuah aplikasi penerapan algoritma crossmine menggunakan PHP dan SQLServer. Uji coba aplikasi ini menggunakan jumlah tuple 200 500 1000 5000 untuk mengukur tingkat akurasi dari rule yang dihasilkan algoritma crossmine.


ABSTRACT

Multi-relation classifications can be widely used in many disciplines such as financial decision making medical research and geographical applications and information stored in multiple relations needs to be used in decision making. Crossmine an efficient and scalable approach for multi-relation classification. Crossmine algoritm has three step first is find-rules the rule has been gotten from find a rule process than remove all positif tuples satisfying rule while there are more than ten percent positif tuple left. The second is find a rule this step has input from the result of find best predicate process that is the complex predicate with most foilgain. If foilgain value is more than mingain the predicate is added with rule and max rule length less than six. Third is find best predicate in this step we find the best predicate with definition if the foilgain value more than the max gain value the predicate will be saved and the bigger gain value will replace the last gain value for next comperative process. In other side the accuracy is computed from each rule that produce in find rules process. The final project make an application for crossmine algoritm by PHP and SQL Server. The test for this application use the sum tuple of 200 500 1000 5000 for measuring the level of accuracy from rule which is produced by crossmine algoritm.



Keywordscrossmine, tuple pusitif, tuple negative, rule, predikat, accuracy
 
Subject:  Pangkalan data
Contributor
  1. SARWOSRI, S.KOM.,M.T.
    DARLIS HERUMURTI, S.KOM
Date Create: 14/01/2009
Type: Text
Format: pdf
Language: Indonesian
Identifier: ITS-Undergraduate-3100008030927
Collection ID: 3100008030927
Call Number: RSIf 005.74 Sul k


Source
Undergraduate Theses, Informatics Engineering, RSIf 005.74 Sul k, 2007

Coverage
ITS Community

Rights
Copyright @2007 by ITS Library. This publication is protected by copyright and permission should be obtained from the ITS Library prior to any prohibited reproduction, storage in a retrievel system, or transmission in any form or by any means, electronic, mechanical, photocopying, recording, or likewise. For information regarding permission(s), write to ITS Library




[ Download - Summary ]

ITS-Undergraduate-3100008030927-3405.pdf




 Similar Document...




! ATTENTION !

To facilitate the activation process, please fill out the member application form correctly and completely

Registration activation of our members will process up to max 24 hours (confirm by email). Please wait patiently

POLLING

Bagaimana pendapat Anda tentang layanan repository kami ?

Bagus Sekali
Baik
Biasa
Jelek
Mengecewakan





You are connected from 18.207.238.169
using CCBot/2.0 (https://commoncrawl.org/faq/)



Copyright © ITS Library 2006 - 2019 - All rights reserved.
Dublin Core Metadata Initiative and OpenArchives Compatible
Developed by Hassan