YULIANI, Ni Putu Anggi (2018) Sistem Temu Kembali Dokumen Pelanggaran Hukum Dengan Metode Boolean. Undergraduate thesis, Universitas Katolik Widya Mandira Kupang.
Text
ABSTRAK.pdf Download (780kB) |
|
Text
BAB I.pdf Download (334kB) |
|
Text
BAB II.pdf Restricted to Repository staff only Download (789kB) |
|
Text
BAB III.pdf Restricted to Repository staff only Download (991kB) |
|
Text
BAB IV.pdf Restricted to Repository staff only Download (893kB) |
|
Text
BAB V.pdf Restricted to Repository staff only Download (481kB) |
|
Text
BAB VI.pdf Download (265kB) |
Abstract
Police of Satarmese Sector is a police headquarter in charge of protecting and unifying the community in Satarmese Sub-district. Every month, there are 3 to 5 law violations cases which have to be investigated by the police headquarter. Every case has its documents that needs to be processed and saved. The documents that has been saved from 1997 to 2016 reached more than 500 documents. They are stored by using uncomputerized archive so it is difficult for the officers of Satarmese Sector to find the needed documents for the investigation or other needs. To make the document finding faster, a system which can identify and retrieve documents is needed in an information retrieval system. There are some methods of information retrieval system, one of which is Boolean Method. The advantage of this method compared to others is the speed on the matching process. Boolean Method is a way to express the users’ need to a query by using Boolean’s operators which are “and”, “or”, and “not”. In Boolean Method, the query is processed in-line with the operator used and the documents are ranked based on the documents’ weight by using tf-idf weighting method. Each term is given weight whether in the weighted document itself or other existing documents. This information retrieval system for the law violation documents is web-based so it can be accessed everywhere and it can help the officer to find the information from the documents which are saved fast, and the documents resulted from the finding can be sorted based on its information weight. The average search of this system is 311,08 mili second.
Item Type: | Thesis (Undergraduate) |
---|---|
Uncontrolled Keywords: | information retrieval system, boolean, tf-idf, law, sector police |
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QA Mathematics > QA76 Computer software T Technology > T Technology (General) |
Divisions: | Fakultas Teknik > Program Studi Ilmu Komputer |
Depositing User: | S.Pd Rhysto Kila |
Date Deposited: | 28 May 2022 00:42 |
Last Modified: | 28 May 2022 00:42 |
URI: | http://repository.unwira.ac.id/id/eprint/6045 |
Actions (login required)
View Item |