Digilib Perpustakaan Universitas Riau

Tugas Akhir, Skripsi, Tesis dan Disertasi Mahasiswa Universitas Riau

  • Beranda
  • Informasi
  • Berita
  • Bantuan
  • Pustakawan
  • Pilih Bahasa :
    Bahasa Arab Bahasa Bengal Bahasa Brazil Portugis Bahasa Inggris Bahasa Spanyol Bahasa Jerman Bahasa Indonesia Bahasa Jepang Bahasa Melayu Bahasa Persia Bahasa Rusia Bahasa Thailand Bahasa Turki Bahasa Urdu

Pencarian berdasarkan :

SEMUA Pengarang Subjek ISBN/ISSN Pencarian Spesifik

Pencarian terakhir:

{{tmpObj[k].text}}
Image of Pengklasteran Area Pembangunan Bak Sampah Daun Pada Universitas Riau Menggunakan Metode K-Means
Penanda Bagikan

CD Skripsi

Pengklasteran Area Pembangunan Bak Sampah Daun Pada Universitas Riau Menggunakan Metode K-Means

HERMAN SURYADI/ 1603115229 - Nama Orang;

The area around Riau University has a lot of leaf litter due to its very large area,
but currently the leaf waste scattered is only done burning. This is because there is
no leaf garbage tub available in riau university environment and also there has not
been an analysis of the grouping of areas that have the potential for the construction
of the leaf garbage tub. From the existing problems, it can be seen that Riau
University needs analysis of the grouping of areas to determine the grouping of
areas in building garbage cans. Therefore, this research aims to implement the kmeans
clustering algorithm in conducting cluster analysis to determine the group
of areas in building garbage bins that exist in the area of Riau University. This
study reviewed data in the form of 71 data point location of leaf garbage stacks
with data attributes clustered are latitude points and longitude of data objects. The
research phase that emphasizes the analysis of k-means clustering goes through 2
stages, namely the process of clustering with k-means, and the testing of clustering
results with silhouette coeffisien. The clustering process is carried out by
experimenting the number of different clusters, namely k=3, k=4, k=5, k=6, and
k=7. The best cluster results testing is done using the silhouette coeffisien method.
Based on the results of the experiment, the number of k=3 is the best cluster with
test results of 0.5906023241609282. This means that as many as 3 garbage can be
built in the area around the centroid point of each cluster.
Keywords : Clustering, Data Mining, K-Means, Python, Leaf Litter.


Ketersediaan
#
Perpustakaan Universitas Riau 03 05.120 (0043)
03 05.120 (0043)
Tersedia
Informasi Detail
Judul Seri
-
No. Panggil
03 05.120 (0043)
Penerbit
Pekanbaru : Universitas Riau - FMIPA - Sistem Informasi., 2020
Deskripsi Fisik
xiv, 53 hlm.: ill.: 29 cm
Bahasa
Indonesia
ISBN/ISSN
-
Klasifikasi
03 05.120 (0043)
Tipe Isi
-
Tipe Media
-
Tipe Pembawa
-
Edisi
-
Subjek
SISTEM INFORMASI
Info Detail Spesifik
-
Pernyataan Tanggungjawab
ELFITRA
Versi lain/terkait

Tidak tersedia versi lain

Lampiran Berkas
  • JUDUL
  • DAFTAR ISI
  • ABSTRAK
  • BAB I PENDAHULUAN
  • BAB II TINJAUAN PUSTAKA
  • BAB III METODE PENELITIAN
  • BAB IV HASIL DAN PEMBAHASAN
  • BAB V PENUTUP
  • DAFTAR PUSTAKA
  • LAMPIRAN
Komentar

Anda harus masuk sebelum memberikan komentar

Digilib Perpustakaan Universitas Riau
  • Informasi
  • Layanan
  • Pustakawan
  • Area Anggota

Tentang Kami

As a complete Library Management System, SLiMS (Senayan Library Management System) has many features that will help libraries and librarians to do their job easily and quickly. Follow this link to show some features provided by SLiMS.

Cari

masukkan satu atau lebih kata kunci dari judul, pengarang, atau subjek

Donasi untuk SLiMS Kontribusi untuk SLiMS?

© 2025 — Senayan Developer Community

Ditenagai oleh SLiMS
Pilih subjek yang menarik bagi Anda
  • Karya Umum
  • Filsafat
  • Agama
  • Ilmu-ilmu Sosial
  • Bahasa
  • Ilmu-ilmu Murni
  • Ilmu-ilmu Terapan
  • Kesenian, Hiburan, dan Olahraga
  • Kesusastraan
  • Geografi dan Sejarah
Icons made by Freepik from www.flaticon.com
Pencarian Spesifik
Kemana ingin Anda bagikan?