<br />
<b>Warning</b>:  Creating default object from empty value in <b>/home/user/web/elibrary/lib/lang/php-gettext/gettext.inc</b> on line <b>148</b><br />
<br />
<b>Notice</b>:  Only variables should be passed by reference in <b>/home/user/web/elibrary/lib/lang/php-gettext/gettext.php</b> on line <b>66</b><br />
<?xml version="1.0" encoding="UTF-8" ?>
<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xmlns:slims="http://senayan.diknas.go.id" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods ID="1075" version="3.3">
<titleInfo>
<title>Implementasi Algoritma Charm-L Dalam Menggali Frequent Closed Itemset</title>
</titleInfo>
<name type="Personal Name" authority="">
<namePart>Kurniawati, Yenny</namePart>
<role><roleTerm type="text">Primary Author</roleTerm></role>
</name>
<name type="Personal Name" authority="">
<namePart>Rully Soelaiman, S.Kom. M.Kom (Pembimbing 1)</namePart>
<role><roleTerm type="text">Additional Author</roleTerm></role>
</name>
<typeOfResource manuscript="yes" collection="yes">mixed material</typeOfResource>
<genre authority="marcgt">bibliography</genre>
<originInfo>
<place><placeTerm type="text">Surabaya</placeTerm></place>
<publisher>Jurusan Sistem Informasi - ITS</publisher>
<dateIssued>2006</dateIssued>
<issuance>monographic</issuance>
<edition></edition>
</originInfo>
<language>
<languageTerm type="code">id</languageTerm>
<languageTerm type="text">Indonesia</languageTerm>
</language>
<physicalDescription>
<form authority="gmd">Tugas Akhir</form>
<extent></extent>
</physicalDescription>
<note>Dalam penelitian ini dibuat aplikasi implementasi algoritma CHARM-L yang dapat menghasilkan frequent closed itemset. Algoritma ini melakukan enumerasi closed itemset dalam ruang pencarian IT-Search Tree yang dapat dipecah menjadi beberapa bagian subtree yang independent, berdasarkan sifat equivalence classes. Pencarian itemset dilakukan pada setiap subtree secara terpisah dengan metode Hybrid Search yang didasarkan pada sifat pasangan itemset-tidset guna mempercepat proses pencarian. Format diffset digunakan sebagai representasi data vertikal sehingga lebih menghemat memori. Pemangkasan non-closed itemset dilakukan dengan operasi irisan himpunan yang sederhana.</note>
<classification>018/2006</classification><identifier type="isbn"></identifier><location>
<physicalLocation>Ruang Baca Jurusan Sistem Informasi Institut Teknologi Sepuluh Nopember</physicalLocation>
<shelfLocator>018/2006</shelfLocator>
<holdingSimple>
<copyInformation>
<numerationAndChronology type="1">TA 018/2006</numerationAndChronology>
<sublocation>My Library (Rak Tugas Akhir)</sublocation>
<shelfLocator>018/2006</shelfLocator>
</copyInformation>
</holdingSimple>
</location>
<recordInfo>
<recordIdentifier>1075</recordIdentifier>
<recordCreationDate encoding="w3cdtf">2012-04-26 13:47:10</recordCreationDate>
<recordChangeDate encoding="w3cdtf">2012-04-26 13:48:51</recordChangeDate>
<recordOrigin>machine generated</recordOrigin>
</recordInfo></mods></modsCollection>