Hasil Pencarian  ::  Simpan CSV :: Kembali

"ABSTRAKHigh Utility Itemset Mining HUIM mendapat banyak perhatian dalam penelitian ndash; penelitian tentang Knowledge Discovery in Databases. Sebagai perluasan dari Frequent Itemset Mining FIM dan Association Rule Mining ARM , HUIM mempertimbangkan faktor jumlah dan tingkat kepentingan barang dalam data transaksi untuk menemukan kelompok barang berutilitas tinggi High Utility Itemsets, HUIs . Walaupun HUIM umumnya diterapkan pada aktivitas penjualan, HUIM telah dikembangkan untuk berbagai penelitian dan aplikasi seperti investasi saham, biomedis, sistem rekomendasi, dan lainnya. Dalam implementasi HUIM, satu tantangan yang ditekankan di banyak penelitian adalah sifat eksponensial ruang pencarian HUIs yang menyebabkan tingginya waktu eksekusi dan penggunaan memori. Berbagai metode telah diusulkan untuk mengatasi tantangan tersebut termasuk penggunaan metode metaheuristik dalam implementasi HUIM. Dalam penelitian ini, algoritma HUIM-DBHS diusulkan sebagai pendekatan metaheuristik untuk menemukan HUIs dalam data transaksi. Algoritma dimulai dengan proses identifikasi 1-HTWUIs untuk mengeliminasi barang berutilitas rendah dan memangkas ruang pencarian HUIs. Algoritma kemudian mengaplikasikan proses pencarian HUIs berdasarkan mekanisme-mekanisme Discrete Binary Harmony Search DBHS yang termasuk harmony memory consideration, pitch adjustment, dan random adjustment. Hasil studi eksperimen menunjukan bahwa HUIM-DBHS berkinerja lebih baik dibandingkan metode metaheuristik terdahulu dalam HUIM.

---

ABSTRACTAs an extension of Association Rule Mining ARM , High Utility Itemsets Mining HUIM considers items quantity and importance factors in transactional database to find High Utility Itemsets HUIs . In HUIM implementation, one of the challenges emphasized in many studies is the exponential nature of the HUIs search space that lead to high execution time and memory usage. Various methods have been proposed to address these challenges including metaheuristic methods usage in HUIM implementation. In this research, HUIM DBHS algorithm is proposed as a metaheuristic method to mine HUIs in transactional database. The algorithm is initiated with 1 HTWUIs identification process to eliminate low utility items and prune HUIs searching space. The algorithm then applies HUIs searching process based on Discrete Binary Harmony Search DBHS mechanisms which include harmony memory consideration, pitch adjustment, and random adjustment. The experimental study results show that HUIM DBHS performs better compared to earlier metaheuristic method in HUIM."

"0-1 Knapsack Problem adalah permasalahan optimasi dalam menentukan objek dari sekumpulan objek tertentu dimana masing-masing objeknya hanya mempunyai satu unit. Masing-masing objek tersebut mempunyai bobot (weight) dan nilai (profit) yang dimasukkan ke dalam suatu media penyimpanan yang mempunyai kapasitas tertentu sehingga banyaknya bobot dari objek-objek tersebut tidak melebihi kapasitas dan nilai yang didapatkan maksimum. Dalam tugas akhir ini, algoritma Novel Global Harmony Search (NGHS) akan digunakan untuk menyelesaikan 0-1 Knapsack Problem (0-1 KP). Kemudian akan dibandingkan hasil penyelesaian 0-1 KP yang menggunakan algoritma NGHS dengan algoritma Harmony Search (HS).

---

0-1 Knapsack Problem (0-1 KP) is an optimization problem to determine object from several object in which each object has exactly one unit. Each object have weights and values to place into storage which has a specific capacity so that the total weight of every object are not exceed the capacity and obtain a maximum value. In this undergraduate thesis, Novel Global Harmony Search (NGHS) algorithm will be used to solve 0-1 KP. The result will be compare with Harmony Search (HS) algorithm."

"Algoritma Harmony Search merupakan algoritma metaheuristik yang diperkenalkan oleh Zong Woo Geem pada tahun 2001 dan terinspirasi dari proses improvisasi musik, dimana para musisi berusaha untuk memperbaiki nada sehingga menghasilkan kumpulan nada membentuk harmoni terbaik. Dalam skripsi ini algoritma Harmony Search digunakan dalam penyelesaian permainan Sudoku.Permainan Sudoku merupakan suatu permainan penempatan angkaangka 1 hingga 9 pada matriks berukuran 9 × 9 dengan syarat di tiap baris, tiap kolom dan di tiap sembilan submatriks ukuran 3 × 3 berisi semua angka 1 hingga 9 tepat satu kali.

---

Harmony search algorithm is a Methaheuristic algorithm. It was introduced by Zong Woo Geem in 2001, which get the inspiration from the process of music improvisation, where musicians improvise their instruments? pitches searching for a perfect state of harmony. In this small thesis, harmony search algorithm used for solving of Sudoku game.Sudoku game is a game that put numbers start from 1 until 9 into a 9 × 9 matrix according to the rules that each row, each column, and each of the nine 3 × 3 sub matrix that compose the matrix contains all of the number from 1 to 9 at once."

"This book includes how to understand harmony and harmonious society, the enlightenment of traditional Chinese culture to the construction of a socialist harmonious society, harmony is a value concept based on Chinese cultural traditions, and harmony is a value concept that reflects the characteristics of socialism And other content."

"The winner of UCL's annual HEP thesis prize, this work describes an analysis of the data from the second flight of the Antarctica Impulsive Transient Antenna (ANITA). ANITA is a balloon-borne experiment that searches for radio signals originating from ultra-high energy neutrinos and cosmic rays interacting with the Antarctic ice or air. The search for ultrahigh energy neutrinos of astrophysical origin is one of the outstanding experimental challenges of the 21st century. The ANITA experiment was designed to be the most sensitive instrument to ultra-high energy neutrinos that originate from the interactions of cosmic rays with the cosmic microwave background. The methodology and results of the neutrino and cosmic ray searches are presented in the thesis."

"The advent of increasingly large consumer collections of audio (e.g., iTunes), imagery (e.g., Flickr), and video (e.g., YouTube) is driving a need not only for multimedia retrieval but also information extraction from and across media. Furthermore, industrial and government collections fuel requirements for stock media access, media preservation, broadcast news retrieval, identity management, and video surveillance. While significant advances have been made in language processing for information extraction from unstructured multilingual text and extraction of objects from imagery and video, these advances have been explored in largely independent research communities who have addressed extracting information from single media (e.g., text, imagery, audio). And yet users need to search for concepts across individual media, author multimedia artifacts, and perform multimedia analysis in many domains.This collection is intended to serve several purposes, including reporting the current state of the art, stimulating novel research, and encouraging cross-fertilization of distinct research disciplines. The collection and integration of a common base of intellectual material will provide an invaluable service from which to teach a future generation of cross disciplinary media scientists and engineers."

"Laporan magang ini membahas prosedur audit Search for Unrecorded Liabilities (SURL) atas akun utang usaha pada Y Group (perusahaan pertambangan) untuk periode akhir tahun 2018 oleh KAP JKL. Perusahaan yang menjadi fokus dalam laporan magang adalah PT Y Tbk dengan karakteristik perusahaan publik dan PT DTA serta PT NDA dengan karakteristik perusahaan privat. Karakteristik tersebut akan mempengaruhi penentuan materialitas yang juga dipengaruhi oleh benchmark untuk pelaksanaan prosedur audit. Prosedur yang dijalankan oleh auditor mengacu pada pedoman audit KAP JKL yang telah sesuai dengan ISA. Berdasarkan hasil audit, tujuan audit prosedur SURL berupa completeness, accuracy, cut-off, rights & obligation, dan valuation telah tercapai melalui pengujian pada prosedur targeted testing. Dengan begitu, tidak terdapat unrecorded liabilities untuk ketiga perusahaan. Dalam proses pelaksanaan prosedur SURL tersebut, terdapat sedikit perbedaan antara ketiga perusahaan, yaitu PT Y Tbk tidak melaksanakan targeted testing, jumlah bank statement yang diperoleh PT DTA pada bulan Januari dan Februari berbeda, serta item PT DTA untuk diuji hanya terpilih dari bulan Februari meskipun total populasinya melebihi PM.

---

This report discusses the audit procedure Search for Unrecorded Liabilities (SURL) for accounts payable of the Y Group (mining company) for the year end of 2018 by KAP JKL. This report focuses on some companies i.e. PT Y Tbk which has the characteristic as public interest entity and PT DTA and PT NDA which have the characteristic of nonpublic interest entity. Those characteristics will affect the materiality calculation which is also influenced by a benchmark which later will affect the implementation of audit procedures. The audit procedures carried out by the auditor refer to the KAP JKL audit guide that is in accordance with ISA. Based on the results of the audit, the purposes of the audit procedure SURL i.e. completeness, accuracy, cut-off, rights & obligation, and valuation have been achieved through the targeted testing procedure. Therefore, there are no unrecorded liabilities for those three companies. In the process of implementing SURL procedure, there were some slight differences between the three companies as follows: PT Y Tbk didn't conduct targeted testing, the number of bank statements obtained by PT DTA in January and February was different, and the items selected for testing from PT DTA were only selected from February despite the total the population exceeds PM."

""