REPOSITORI INSTITUSI
UNIVERSITAS BHAYANGKARA SURABAYA
 
PENELUSURAN INFORMASI

Masukkan kata pencarian pada kotak diatas
 

UBHARASURYA » Proceeding » Fakultas Teknik - TEKNIK INFORMATIKA
di-posting oleh eko@ubhara.ac.id pada 2015-11-02 00:01:50  •  605 klik          Permohonan Koleksi

Clustering dan Pembobotan untuk meningkatkan metode Cumulative Voting

disusun oleh Eko Prasetyo

SubyekPerbaikan Cumulative Voting
Kata Kunci metode prioritisasi
cumulative voting
K-means clustering
bobot
KontributorUtomo Pujianto
Tanggal tercipta2011-11-11
Jenis(Tipe)Proceeding
BahasaIndonesia
Pengenal(Identifier)UBHARASURYA-Proceeding-2
No Koleksi2



[ ANOTASI / ABSTRAK ]

The easy and fast method for requirement prioritization is Cumulative Voting (CV), customers just simply distribute 100 points to a number of selection requirements. This way is easier and faster, but the result is less reliable. The problems in this method is not looking at the background of customers who contribute to the system to be developed. The greater influence of customers in the system should also have a major influence on the rating is done, and vice versa. In this paper proposed an improvement on CV method with respect to the weight that is owned by the customer that gives points. The weight is a multiplier for the points given by customer. Great weight to the group of users following the scale used in Analitic Hierarchy Process (AHP). The weights given to each customer group based on the results of a background-based customer grouping of customers that contribute distribute points, customer clustering is done by K-means clustering method which is unsupervised clustering method. With this new method of ranking the results of further requirements can be justified because it was looking at the background that gives customers points in the rating process.



[ DESKRIPSI LAIN ]

 Download File Penyerta (khusus anggota terdaftar)

  1. UBHARASURYA-Proceeding-44-KNSI2011031ECV.pdf
    736 KB - "application/pdf"

 Download File Bebas Download

  1. UBHARASURYA-Proceeding-44-KNSI2011031ECV.pdf
    736 KB - application/octetstream