IMPLEMENTING K-MEANS METHOD FOR VISITOR CLUSTERING LIBRARY ITN MALANG
نویسندگان
چکیده
Library of National Istitute Of Technology Malang is one the facilities and infrastructure that provides various services for providing academic information, while there are collections such as research results, papers, articles, theses postgraduate theses, loan transaction data so far not used further. to also explore patterns information might be valuable use in evaluating book other documentation. Researchers have initiated produce an application can group visitors borrowers using K-Means method, helping librarians evaluate on visits borrowing ITN library.
 This a Research Development based website-based applications, method thesis product develope needed include system only computers , accessed by library staff.
 The results this study form website application, has feature, namely provide analysis borrowers, functional testing whole successful running well, user testing, it known percentage respondents 50% Very Good, 48% Good 2% Not concluded all features run well Mozilla Firefox 83.0 Google Chrome 87.0.4280.88 browsers, majority users rated very usage.
منابع مشابه
Hartigan's Method: k-means Clustering without Voronoi
Hartigan’s method for k-means clustering is the following greedy heuristic: select a point, and optimally reassign it. This paper develops two other formulations of the heuristic, one leading to a number of consistency properties, the other showing that the data partition is always quite separated from the induced Voronoi partition. A characterization of the volume of this separation is provide...
متن کاملPersistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملA novel method for K-Means clustering algorithm
This paper investigated K-means algorithm, a well-known clustering algorithm. K-means clustering algorithms have some shortfalls and defects, and one defect is reviewed in this study. One of the disadvantages of K-means clustering algorithms is that they can produce clusters that do not always include all the correct components. It is due to the presence of the error rate during the clustering ...
متن کاملA New Soft Computing Method for K-Harmonic Means Clustering
The K-harmonic means clustering algorithm (KHM) is a new clustering method used to group data such that the sum of the harmonic averages of the distances between each entity and all cluster centroids is minimized. Because it is less sensitive to initialization than K-means (KM), many researchers have recently been attracted to studying KHM. In this study, the proposed iSSO-KHM is based on an im...
متن کاملBalanced K-Means for Clustering
We present a k-means-based clustering algorithm, which optimizes mean square error, for given cluster sizes. A straightforward application is balanced clustering, where the sizes of each cluster are equal. In k-means assignment phase, the algorithm solves the assignment problem by Hungarian algorithm. This is a novel approach, and makes the assignment phase time complexity O(n), which is faster...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JATI (Jurnal Mahasiswa Teknik Informatika)
سال: 2021
ISSN: ['2598-828X']
DOI: https://doi.org/10.36040/jati.v5i1.3222