UMM Institutional Repository

PERBANDINGAN ALGORITMA CLUSTERING K-MEANS DAN K-MEDOID UNTUK PERINGKASAN TEKS OTOMATIS ARTIKEL BERITA

Linarko, Rizqy (2019) PERBANDINGAN ALGORITMA CLUSTERING K-MEANS DAN K-MEDOID UNTUK PERINGKASAN TEKS OTOMATIS ARTIKEL BERITA. Bachelors Degree (S1) thesis, University of Muhammadiyah Malang.

[img]
Preview
Text
PENDAHULUAN.pdf

Download (1MB) | Preview
[img]
Preview
Text
BAB I.pdf

Download (220kB) | Preview
[img]
Preview
Text
BAB II.pdf

Download (428kB) | Preview
[img]
Preview
Text
BAB III.pdf

Download (759kB) | Preview
[img] Text
BAB IV.pdf
Restricted to Registered users only

Download (1MB) | Request a copy
[img] Text
BAB V.pdf
Restricted to Registered users only

Download (196kB) | Request a copy
[img] Text
Lampiran.pdf
Restricted to Registered users only

Download (814kB) | Request a copy
[img]
Preview
Text
Poster Skripsi.pdf

Download (282kB) | Preview

Abstract

Technological progress is now increasingly rapid, this is marked by increasingly easy access to get information from different regions quickly. One that marks this convenience is news information or news articles in online content. The ease of accessing news articles is not balanced with the ease of getting the information contained in the news presentation because of the limited time. So we need an automatic summarizing machine that is able to help lay people read the news briefly but directly to the main topic in the article. The automatic text summarizing machine utilizes clustering techniques in grouping sentences that the system considers to have the same meaning based on the weights calculated by the TFIDF algorithm. In an effort to determine an accurate summary, automatic text summation uses the K-Means and K-Medoid algorithms to compare. Testing is done by placing a compression rate of 10%, 20%, 30% on each algorithm. In the results of tests conducted using the BLEU (Billingual Evaluation Understanding) algorithm, K-Means obtained a high precision value at a compression rate of 30% with an average precision value of 45.3%. Whereas K-Medoid gets the highest precision value at 30% compression rate with an average precision value of 44%.

Item Type: Thesis (Bachelors Degree (S1))
Student ID: 201510370311217
Thesis Advisors: Setio Basuki (0714028403), Nur Hayatin (0726038402)
Keywords: Text Summarization, K-Means, K-Medoid, BLEU
Subjects: Z Bibliography. Library Science. Information Resources > ZA Information resources > ZA4050 Electronic information resources
Divisions: Faculty of Engineering > Department of Informatics (55201)
Depositing User: 201510370311217
Date Deposited: 06 Nov 2019 08:18
Last Modified: 06 Nov 2019 08:18
URI : http://eprints.umm.ac.id/id/eprint/54798

Actions (login required)

View Item View Item
UMM Official

© 2008 UMM Library. All Rights Reserved.
Jl. Raya Tlogomas No 246 Malang East Java Indonesia - Phone +62341464318 ext. 150, 151 - Fax +62341464101
E-Mail : infopus[at]umm.ac.id - Website : http://lib.umm.ac.id - Online Catalog : http://laser.umm.ac.id - Repository : http://eprints.umm.ac.id

Web Analytics

UMM Institutional Repository is powered by :
EPrints Logo