Skip to content
naulon
Not checkedNot checked for notices yet.

Classifiying English Books By Using Association Rules

Asist.instructor. Enas Jasim Hadi

الأستاذ · 2018

doi:10.36473/ujhss.v225i3.215 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

In general, libraries have taken a special interest from various educational institutions due to the key role that libraries play in terms of enriching the scientific aspects with different knowledge resources. The role of libraries is significantly can be seen in the fast information delivery for the recipients. Hence, the indexing and classifying of library resources is very important task because it contributes in enhancing the libraries performance. The classification of books (putting the book in the right class) is not an easy task, especially when the books are written in English. This research presents a model for books classification by using Association Rules techniques. The first stage of the research involved distributing a questionnaire for people who are working in libraries. The purpose of the questionnaire was to identify the difficulties that come with English books classification. The results of the questionnaire proved that there were number of obstacles in terms of English books classification process. After that we have collected an English books dataset to be employed in our model. Then the model has been implemented successfully and tested by given the title of the book. The results of the research proved that the model can put the book into the right class with ratio of (76%) and the error rate was (24%). That means it is possible to develop computer-based systems to classify the library resources. The results of the research open the way toward developing more sophisticated techniques and methods which can improve the performance of classifying the books electronically in an efficient manner that serves the librarians and users as well.

Abstract licence: CC BY

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.