Association rule algorithm with FP growth for book search

3rd Annual Applied Science and Engineering Conference

工业技术;自然科学

Andi, T.^1 ; Utami, E.^1

Magister of Informatics Engineering Universitas Amikom Yogyakarta, Yogyakarta, Indonesia^1

关键词: Association rule algorithm;    Book search;    Confidence values;    Existing problems;    FP growths;    Support and confidence;    Transaction data;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/434/1/012035/pdf
DOI  :  10.1088/1757-899X/434/1/012035

来源: IOP

【 摘 要 】

Collection of books in the library is sometimes confusing visitors who want to borrow library books. Data mining techniques have been widely used to resolve existing problems by applying the algorithm of association rule Algorithm using FP Growth to find the rules of the Association that is formed from the dataset loaning books. By utilizing the visit transaction data, the library will be seeking information about what books are often borrowed by the student and the linkages between each of the parties so that the lending library itself can do the preparation books in accordance with the level of support and confidence values. One of the rules of the Association that is formed is if someone borrows the book Psikologi Perkembangan then he will borrow the book Psikometri with a value of 0.2 and support 100% confidence rating which is the highest confidence value rules. Then create an application that can show the location of the book more specifically so it can facilitate the students in searching.