PENCARIAN INFORMASI SKRIPSI  PADA PUSTAKA FAKULTAS ILMU KOMPUTER  UNIVERSITAS LANCANG KUNING

Indi Rahman

doi:10.31849/digitalzone.v7i1.529

Indi Rahman Universitas Lancang Kuning

DOI: https://doi.org/10.31849/digitalzone.v7i1.529

Keywords: Basic boolean, retrieval, inverted index, parsing, remove stopword, stemming, weighting

Abstract

ABSTRAK- Pada beberapa tahun terakhir, seiring dengan peningkatan jumlah koleksi dokumen yang berisikan informasi elektronik kian banyak, kebutuhan untuk menemukan informasi yang relevan dalam bentuk digital semakin penting. Salah satu cara yang cukup populer untuk menemukan informasi tersebut adalah dengan menggunakan operator basic boolean, yaitu AND, OR dan NOT. Penerapan operator ini membantu dalam mendefenisikan kriteria pencarian dan mengendalikan logika pencarian. Mekanisme standard untuk mendukung query basic boolean adalah dengan menggunakan file inverted indek yang dikelompokan berdasarkan nilai hexa desimalnya, digunakan langkah parsing, remove stopword, stemming dan weighting atau pembobotan. Penerapan basic boolean untuk pencarian Skripsi pada Ilmu Komputer Universitas Lancang Kuning Pekanbaru, melakukan pencarian string query yang diinputkan terhadap data term inverted. Kemudian memberikan respon kepada user berupa judul, uraian singkat dan alamat dokumen sesuai dengan logika pencarian yang diinginkannya, serta mengurutkan dokumen yang relevan tersebut berdasarkan ranking dari term itu sendiri.
Kata kunci : Basic boolean, retrieval, inverted index, parsing, remove stopword, stemming, weighting

ABSTRACT- In recent years, growth-up amount document collection which comprising electronic data information increasingly, requirement to find relevant information data digital progressively to be important. One of way popular to find the information is using boolean basic operator, that is AND, OR and NOT. Standard mechanism to support boolean basic query is using inverted index file. For the extract document and make the tables of term inverted index is grouping term value in hexa decimal, used by parsing step, remove stopword, stemming and weighting. Applying basic boolean for the seeking Skripsi in Computer Science in Lancang Kuning University, conducting seeking of query string which is input from user to term inverted data. Then give respon to user in the form of title, brief description and document address as according to wanted seeking logic, and also sort the relevant document pursuant to ranking from itself term.
Keywords : Basic boolean, retrieval, inverted index, parsing, remove stopword, stemming and weighting.

Downloads

Download data is not yet available.

References

[1] Baeza-Yates, R., Ribeiro-Neto, B., 1999, Modern Information Retrieval, Addison-Wesley, London. , 2005, Introduction To Data Structure And Algorithms Related To Information Retrieval,
[2] Belkin, N J., Interaction with Texts: Information Retrieval as Information-Seeking Behavior, Paper presented at the School of Communication, Information & Library Studies, Rutgers University, New Brunswick.
[3] Boerthes et. al, 2007., Multimedia Information Services An Architectural Approach, The work described in this paper was supported by the EURESCOM project TALMUD (Technologies and Architectures for a Leap in MUltimedia Databases) and the Dutch National BTS project SUMMER (Secure Multimedia Retrieval).
[4] Forman, G., 2003, An Extensive Empirical Study of Feature Selection Metrics for Text Classification.
[5] Frakes, W. B, 2005., Stemming Algorithms.
[6] Hasibuan, Z. A dan Andri, Yofi., 2007, Penerapan Berbagai Teknik Sistem Temu-Kembali Informasi Berbasis Hiperteks.
[7] Harman, D., 2005, Inverted Files.
[8] Hasan, M. M., 2001, Cross-language Information Retrieval, Document Alignment and Visualization – A Study with Japanese and Chinese, Ph.D. Thesis Graduate School of Information Science Nara Institute of Science and Technology.
[9] Lu, G. J., 1999, Multimedia Database Management Systems, Artech House INC, Boston
[10] McKinley, T., 1997, How To Make Information Instantly Accessible, Printed in the United States of America by GAC Shepard Poorman, Indianapolis, Indiana.
[11] Ralston, A., Reiley, E D., 1993. Encyclopedia of Computer Science, New York : Van Nostrand Reinhold
[12] Rhodes, B J., 2000., Just-In-Time Information Retrieval, Ph.D. Thesis, Massachusetts Institute of Technology, Cambridge.
[13] Sormunen, E., Halttunen, K and Keskustalo. H., 2002, Query Performance Analyser - a tool for bridging information retrieval research and instruction, Department of Information Studies, University of Tampere, Finland.
[14] Susmikanti, Mike., 2006, Komputasi Komponen Terhubung Dan Jalur Terpendek Dalam Algoritma Graf Paralel, Prosiding Semiloka Teknologi Simulasi dan Komputasi serta Aplikasi.
[15] Suzuki, M. T., Yaginuma, Y., Sugimoto., Y. Y., 2003., Implementation Techniques of Boolean Logic Operators in 3D Model Search Systems.
[16] Teevan, J B., 2001, Improving Information Retrieval with Textual Analysis: Bayesian Models and Beyond, Ph.D. Thesis, Massachusetts Institute of Technology, Cambridge.
[17] Wartik, S., 2005, Boolean Operation.