IMPLEMENTATION OF K-MEANS ALGORITHM FOR CLUSTERING LIBRARY BOOKS

Da Silva, Yosef Natanael Montanaro (2012) IMPLEMENTATION OF K-MEANS ALGORITHM FOR CLUSTERING LIBRARY BOOKS. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.

Preview	Text (COVER) 07.02.0014 Yosef Natanael Montanaro Da Silva COVER.pdf Download (1MB) | Preview
	Text (BAB I) 07.02.0014 Yosef Natanael Montanaro Da Silva BAB I.pdf Restricted to Registered users only Download (108kB)
	Text (BAB II available document only in library of Soegijapranata Catholic University) 07.02.0014 Yosef Natanael Montanaro Da Silva BAB II.pdf Restricted to Repository staff only Download (618kB)
	Text (BAB III available document only in library of Soegijapranata Catholic University) 07.02.0014 Yosef Natanael Montanaro Da Silva BAB III.pdf Restricted to Repository staff only Download (128kB)
	Text (BAB IV available document only in library of Soegijapranata Catholic University) 07.02.0014 Yosef Natanael Montanaro Da Silva BAB IV.pdf Restricted to Repository staff only Download (281kB)
	Text (BAB V available document only in library of Soegijapranata Catholic University) 07.02.0014 Yosef Natanael Montanaro Da Silva BAB V.pdf Restricted to Repository staff only Download (686kB)
	Text (BAB VI) 07.02.0014 Yosef Natanael Montanaro Da Silva BAB VI.pdf Restricted to Registered users only Download (75kB)
Preview	Text (DAFTAR PUSTAKA) 07.02.0014 Yosef Natanael Montanaro Da Silva DAFTAR PUSTAKA.pdf Download (91kB) | Preview

Abstract

with many books owned by a library, it takes more time if people want to find a book that they need. Therefore rather than see the collection of books owned one by one, a more effective and efficient method in finding the book owned by the library is need. This application will use k-means clustering method to divide the book into clusters. where the books which are grouped in one cluster are considered related. And because of the clustering process, searching method will not have to go through all the data one by one. Which will make the searching method will be more efficient. The output of this application will be books that come from same cluster as the keywords that the user entered. So it will display recommended books supposed to be related to the keywords that the user entered

Item Type:	Thesis (Other)
Subjects:	000 Computer Science, Information and General Works > 020 Library and Information Science > Library operations
Depositing User:	Mr Ign. Setya Dwiana
Date Deposited:	16 Mar 2016 08:49
Last Modified:	16 Mar 2016 08:49
URI:	http://repository.unika.ac.id/id/eprint/8005

Actions (login required)

View Item