• Login
    View Item 
    •   Repository Home
    • UH Faculty, Staff, and Student Works
    • UH Faculty, Staff, and Student Works
    • View Item
    •   Repository Home
    • UH Faculty, Staff, and Student Works
    • UH Faculty, Staff, and Student Works
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    You may also like: Machine-learning algorithms for collection recommendations

    Thumbnail
    View/Open
    ALAPoster2019.pdf (1.420Mb)
    Date
    2019
    Author
    Xiao, Jingshan
    Gao, Wenli
    Metadata
    Show full item record
    Abstract
    Traditional collection development relies heavily on human input, with librarians relying on reviews and subject selection lists, and through user requests. With the development of machine learning, more and more businesses seek automated methods to deliver results relevant to users. The Recommender system, a subclass of information filtering that seeks to predict the "rating" or "preference" of a user, is among the most successful systems of machine learning in action. It has been adopted by many major e-commerce businesses such as Amazon, Netflix, and Expedia, and has been widely implemented to predict product and media recommendations, making it a key factor in increasing product average order value and the number of items per order. Drawing inspiration from the benefits of a recommender system to business and its success in heightening the reliability of recommendations, we attempted to build optimal collection recommendations with machine-learning algorithms using Python. The purpose of this project is to help librarians make collection decisions using the recommender system, and in this presentation we will illustrate several examples that will appeal to both public and academic librarians. One example involves the merging of popular titles with reader rating data. We found that while The New York Times publishes best seller titles based on the rates of sales, they do not have any connection to user ratings. By leveraging data from Goodreads, the world’s largest site for readers and book recommendations, we will build a simple recommender system that produces The New York Times best seller titles that have higher user rating using a matrix factorization based method. Librarians in turn can purchase best seller titles with good reader ratings. Moreover, the recommender system will also enable librarians to recommend books that are similar to a particular title based on pairwise similarity scores. Therefore, if a user enjoys reading a book, the recommender system will pull titles with similar features. The recommender system can be used in other settings. Drawing on bibliographic data from highly circulated items, or frequently requested interlibrary loan items, the recommender system will suggest items with similar features using similarity metrics. As a result, librarians can acquire relevant materials based on users’ previous reading patterns. The recommender system will use machine-learning algorithms not only to simplify collection development for librarians, but will also help end users discover more items relevant to their interests.
    URI
    https://hdl.handle.net/10657/4199
    Collections
    • UH Faculty, Staff, and Student Works

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    TDL
    Theme by 
    Atmire NV
     

     

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsDepartmentsTitlesSubjectsThis CollectionBy Issue DateAuthorsDepartmentsTitlesSubjects

    My Account

    Login

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    TDL
    Theme by 
    Atmire NV