Vioni H, Inez (2011) Book Searching with Recommendation Using FP – Growth, Apriori and Clustering K – Means Algorithm. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.
|
Text (COVER)
07.02.0016 Inez Vioni COVER.pdf Download (697kB) | Preview |
|
![[img]](https://repository.unika.ac.id/style/images/fileicons/text.png) |
Text (BAB I)
07.02.0016 Inez Vioni BAB I.pdf Restricted to Registered users only Download (122kB) |
|
|
Text (BAB II available document only in library of Soegijapranata Catholic University)
07.02.0016 Inez Vioni BAB II.pdf Restricted to Repository staff only Download (262kB) |
|
|
Text (BAB III available document only in library of Soegijapranata Catholic University)
07.02.0016 Inez Vioni BAB III.pdf Restricted to Repository staff only Download (291kB) |
|
|
Text (BAB IV available document only in library of Soegijapranata Catholic University)
07.02.0016 Inez Vioni BAB IV.pdf Restricted to Repository staff only Download (228kB) |
|
|
Text (BAB V available document only in library of Soegijapranata Catholic University)
07.02.0016 Inez Vioni BAB V.pdf Restricted to Repository staff only Download (786kB) |
|
|
Text (BAB VI)
07.02.0016 Inez Vioni BAB VI.pdf Restricted to Registered users only Download (116kB) |
|
|
Text (DAFTAR PUSTAKA)
07.02.0016 Inez Vioni DAFTAR PUSTAKA.pdf Download (116kB) | Preview |
|
|
Text (LAMPIRAN)
07.02.0016 Inez Vioni LAMPIRAN.pdf Download (614kB) | Preview |
Abstract
Book Searching with Recommendation is a application to find recommendation book on same categories as user input or find the recommendation on another book that another user mostly lend together. This diagram make user could find the title and number of location of book in library easily after get the recommendation. Book Searching use list of book data and transaction data library in txt database . This information used to find recommendation book. After read data information from txt file, the information is stored on Tree and Link List as data structure in Apriori and FP-Growth algorithm and Link List if using K-Means Algorithm. Information at data structure could be read to find the recommendation of user’s input. The output are recommended book and the number of place at library
| Item Type: | Thesis (Other) |
|---|---|
| Subjects: | 000 Computer Science, Information and General Works > 004 Data processing & computer science |
| Divisions: | Faculty of Computer Science |
| 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/8006 |
Actions (login required)
 |
View Item |