Otomatisasi Peringkasan Dokumen Sebagai Pendukung Sistem Manajemen Surat
DOI:
https://doi.org/10.26594/register.v1i1.400Abstract
Peringkasan dokumen adalah proses penyajian kembali dokumen dalam bentuk yang lebih singkat tanpa membuang informasi penting yang terdapat dalam dokumen tersebut. Dalam penelitian ini, peneliti menggunakan metode Naive Bayes untuk menghasilkan ringkasan sebuah dokumen. Objek dalam penelitian ini berupa dokumen yang berbentuk surat. Dalam proses peringkasan dokumen, penghitungan probabilitas didasarkan pada fitur teks yang ada dalam surat, diantaranya adalah frekuensi kata, kata kunci, frase kunci, dan kata yang termasuk dalam kelas entitas atau numerik. Hasil uji coba menunjukkan bahwa tingkat kompresi adalah 53.67% dengan informasi penting yang tersedia dalam ringkasan mencapai 96.67% dari dokumen asli.
References
Aristoteles, Widiarti, & Wibowo, E. D. (2014). Text Feature Weighting for Summarization of Documents. International Journal of Computer Science and Telecommunications, 5(7), 29-33.
Berker, M. (2011). Using Genetic Algorithms With Lexical Chains For Automatic Text Summarization. Istanbul: Bogazici University.
Binwahlan, M. S. (2011). Fuzzy Swarm Diversity Based Text Summarization. Johor Bahru: Universiti Teknologi Malaysia.
Budhi, G. S., Intan, R., R, S., & R, S. R. (2007). Indonesian Automated Text Summarization. Proceeding ICSIIT.
Dehkordi, P. K., Kumarci, F., & Khosravi, H. (2009). Text Summarization Based on Genetic Programming. International Journal of Computing and ICT Research, 3(1), 57-64.
Erkan, G., & Radev, D. R. (2004). LexRank: Graph-based Lexical Centrality as Salience in. Journal of Artificial Intelligence Research (JAIR), 22(1), 457-479.
Goldberg, D. E. (1989). Genetic Algorithms In Search, Optimization, And Machine Learning.
Mihalcea, R. (2004). Graph-based Ranking Algorithms for Sentence Extraction, Applied to Text Summarization. Proceedings of the ACL 2004 on Interactive poster and demonstration sessions. Stroudsburg (PA).
Mirchev, U., & Last, M. (2014). Multi-document Summarization by Extended Graph Text Representation and Importance Refinement. ulti-document Summarization by Extended Graph Text Representation. Hershey (PA): IGI Global.
Nandhini, K., & S, R. B. (2013). Improving readability through extractive summarization for learners with reading difficulties. Egyptian Informatics Journal, 14(3), 195
Nandhini, K., & S, R. B. (2013). Use of G enetic Algorithm f or Cohesive Summary Extraction to. Applied Computational Intelligence and Soft Computing, 2013(8), 1-11.
Prasetyo, B., Uliniansyah, T., & Riandi, O. (2009). Indonesian Automated Text Summarization. International Conference on Rural Information and Communication Technology , 26-27.
Qazvinian, V., Hassanabadi, L. S., & Halavati, R. (2008). Summarising Text With A Genetic Algorithm-Based Sentence Extraction. Int. J. Knowledge Management Studies, 2(4), 426-444.
Downloads
Published
How to Cite
Issue
Section
License
Please find the rights and licenses in Register: Jurnal Ilmiah Teknologi Sistem Informasi. By submitting the article/manuscript of the article, the author(s) agree with this policy. No specific document sign-off is required.
1. License
The non-commercial use of the article will be governed by the Creative Commons Attribution license as currently displayed on Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
2. Author(s)' Warranties
The author warrants that the article is original, written by stated author(s), has not been published before, contains no unlawful statements, does not infringe the rights of others, is subject to copyright that is vested exclusively in the author and free of any third party rights, and that any necessary written permissions to quote from other sources have been obtained by the author(s).
3. User/Public Rights
Register's spirit is to disseminate articles published are as free as possible. Under the Creative Commons license, Register permits users to copy, distribute, display, and perform the work for non-commercial purposes only. Users will also need to attribute authors and Register on distributing works in the journal and other media of publications. Unless otherwise stated, the authors are public entities as soon as their articles got published.
4. Rights of Authors
Authors retain all their rights to the published works, such as (but not limited to) the following rights;
Copyright and other proprietary rights relating to the article, such as patent rights,
The right to use the substance of the article in own future works, including lectures and books,
The right to reproduce the article for own purposes,
The right to self-archive the article (please read out deposit policy),
The right to enter into separate, additional contractual arrangements for the non-exclusive distribution of the article's published version (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal (Register: Jurnal Ilmiah Teknologi Sistem Informasi).
5. Co-Authorship
If the article was jointly prepared by more than one author, any authors submitting the manuscript warrants that he/she has been authorized by all co-authors to be agreed on this copyright and license notice (agreement) on their behalf, and agrees to inform his/her co-authors of the terms of this policy. Register will not be held liable for anything that may arise due to the author(s) internal dispute. Register will only communicate with the corresponding author.
6. Royalties
Being an open accessed journal and disseminating articles for free under the Creative Commons license term mentioned, author(s) aware that Register entitles the author(s) to no royalties or other fees.
7. Miscellaneous
Register will publish the article (or have it published) in the journal if the article’s editorial process is successfully completed. Register's editors may modify the article to a style of punctuation, spelling, capitalization, referencing and usage that deems appropriate. The author acknowledges that the article may be published so that it will be publicly accessible and such access will be free of charge for the readers as mentioned in point 3.