Using data mining to improve digital library services
Samo za registrovane korisnike
2010
Članak u časopisu (Objavljena verzija)

Metapodaci
Prikaz svih podataka o dokumentuApstrakt
Purpose This paper aims to propose a solution for recommending digital library services based on data mining techniques (clustering and predictive classification). Design/methodology/approach - Data mining techniques are used to recommend digital library services based on the user's profile and search history. First, similar users were clustered together, based on their profiles and search behavior. Then predictive classification for recommending appropriate services to them was used. It has been shown that users in the same cluster have a high probability of accepting similar services or their patterns. Findings - The results indicate that k-means clustering and Naive Bayes classification may be used to improve the accuracy of service recommendation. The overall accuracy is satisfying, while average accuracy depends on the specific service. The results were better for frequently occurring services. Research limitations/implications - Datasets were used from the KOBSON digital library.... Only clustering and predictive classification was applied. If the correlation between the service and the institution were higher, it would have better accuracy. Originality/value - The paper applied different and efficient data mining techniques for clustering digital library users based on their profiles and their search behavior, i.e. users' interaction with library services, and obtain user patterns with respect to the library services they use. A digital library may apply this approach to offer appropriate services to new users more easily. The recommendations will be based on library items that similar users have already found useful.
Ključne reči:
Digital libraries / Databases / Serbia / Data handling / Service deliveryIzvor:
Electronic Library, 2010, 28, 6, 829-843Izdavač:
- Emerald Group Publishing Limited, Bingley
DOI: 10.1108/02640471011093525
ISSN: 0264-0473