<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Embedding-based Neural Network Models for Book Recommendation in University Libraries</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Library and Information Science, Sungkyunkwan University</institution>
          ,
          <addr-line>Seoul 03063</addr-line>
          ,
          <country country="KR">South Korea</country>
        </aff>
      </contrib-group>
      <fpage>0000</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>Recommendation systems have been widely used in various commercial applications for predicting the rating a user may give to an item. To encourage students to read more books, personalized book recommendation systems are of great interest in university libraries. Because university libraries do not ask students to rate books that they borrowed, book reviews and ratings are not available. Without book ratings, implementing personalized book recommendation systems in libraries is a challenging problem. In this study, we propose a library book recommendation system that uses embedding based neural network models. The system uses book metadata and user information as input features and deep learning models were used to create embeddings of the features. A multi-class classi cation model and a multi-label classi cation model were trained and soft voting was used to integrate the nal outcomes. The performance of the models was evaluated by 72 university students and the multi-class classi cation model received 3.4 average points whereas the multi-label classi cation model scored 3.0 average points in the 5Point Likert Scale.</p>
      </abstract>
      <kwd-group>
        <kwd>recommendation system</kwd>
        <kwd>book recommendation</kwd>
        <kwd>deep neural networks</kwd>
        <kwd>university libraries</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        University libraries keep many books to serve students with various reading
interests. Although this broadened the range of book choices for students, it
became even di cult for them to choose books that they may like to read. This
also imposes burden to librarians for book recommendation and they became less
con dent about recommending books to students. Capturing the characteristics
of the students is a key of book recommendation service and this requires us to
implement personalized book recommendation systems that rely on big library
? equal contribution
?? corresponding author
data and advanced machine learning methods. To our knowledge, many libraries
still rely on the manual labor of librarians to recommend books, which may be
less e ective and e cient[
        <xref ref-type="bibr" rid="ref2 ref7 ref8">2,7,8</xref>
        ].
      </p>
      <p>Some university libraries have implemented personalized book
recommendation systems that incorporate the book rating component. As an example, Seoul
National University implemented a system called `S-Curation' that recommend
books to its users based on their borrowed records and keywords that they
previously used to search for books. The system requires students to rate the
recommended books based on their preference and the rating data are utilized
to recommend further books to them. Although asking students to rate each of
the recommended books is an e ective way of improving system's performance,
this requires signi cant amount of user involvement. This kind of system may
not be practical in most university libraries because it largely depends on users'
active involvement and may require a considerable time to collect enough user
feedbacks as to provide reliable service. Therefore, personalized book
recommendation systems without the rating component may be a more practical option
that is a ordable and easy to be adopted by many university libraries.</p>
      <p>In this paper, we propose personalized book recommendation models that
only utilize book metadata and user data. By applying embedding-based deep
learning methods to the data, we aim to implement e ective models that perform
well when rating data are not available. This paper is divided into the following
parts. In the Related Work, we discuss various recommendation systems followed
by Methods, where we propose embedding-based neural network models. In the
Results, we evaluate the proposed methods and lastly, we conclude and discuss
our future work.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Works</title>
      <p>
        Recommendation systems have been studied with various methods such as
collaborative ltering, hybrid ltering, machine learning, and deep learning.
Collaborative ltering is a method that recommends items to users by collecting
their preferences through ratings[
        <xref ref-type="bibr" rid="ref3 ref6">3,6</xref>
        ]. Hybrid ltering is a combination of
collaborative ltering and content-based ltering, which re ects both the
characteristics of the books and the users[
        <xref ref-type="bibr" rid="ref12 ref4">4,12</xref>
        ]. Similarity based machine learning
approaches[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] and embedding-based deep learning have been applied in
recommendation systems as well[
        <xref ref-type="bibr" rid="ref10 ref9">9,10</xref>
        ].
      </p>
      <p>
        Studies of recommendation systems for libraries have also used the
abovementioned methods. Fu et al. proposed a book recommendation system through
userbased collaborative ltering methods. They concentrated on the concept that
university library users have diverse interests depending on what they learn
during the semester. They utilized users' borrowed records, users' information, and
book metadata, and suggested that local recommendations, which considers the
students' department shows better performance than global recommendation[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
Liu et al. employed SVD++, model-based collaborative ltering, to develop a
university library book recommendation system. As it is challenging for libraries
to achieve ratings from users, they used the book loan duration as the rating
value[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. By utilizing hybrid ltering, Tian et al. designed a personalized book
recommendation system for university students based on the users' borrowing
records, users' information, and book metadata. They showed the hybrid ltering
method's superiority among individual collaborative ltering and content-based
ltering[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Tsuji et al. applied SVM for book recommendations. Their
models input utilized several similarity values made from borrowed records, book
titles, and categories of the books[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. Rahutomo et al. proposed an embedding
model to produce book recommendations using content ltering. They
generated embeddings from the books' original attributes namely book title, author,
publisher, and demographic information of the students of Binus University and
trained these embeddings through deep learning[
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Covington et al. suggested
an embedding model for the recommendation system of a large video corpus.
They conducted a two-stage neural network model using the user's video search
history, demographical information and the video's embeddings. This method
outperformed the previous matrix factorization approaches that were used at
Youtube[
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
      </p>
      <p>As previously mentioned, rating-based models require extensive user responses.
Although these user feedbacks play an important role in recommendation
models, most university libraries do not have them. On the other hand,
recommendation models that do not depend on ratings are a better option that is easy to
adopt and thus practical. The key to this kind of models is the e ective utilization
and representation of book and user data. Therefore, we aim to use embedding
methods for the representation of library data and propose embedding-based
recommendation models.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Data and Methods</title>
      <p>3.1</p>
      <sec id="sec-3-1">
        <title>Data</title>
        <p>We acquired the data of book borrowing history from the Sungkyunkwan
University (SKKU) library. The data are about all the undergraduate students'
book borrowing history from 2015 to 2019 that includes 34,335 students, 206,089
books, which cover the entire types of genre, and 662,402 loan records. The
following data preprocessing and feature selection were used. First, from the
downloaded book list, we removed items such as cds or dvds, the encyclopedia
and theses. Likewise, we excluded books that had been designated for speci c
purpose and being recommended to all the students since these books do not
necessarily re ect individuals' reading preferences. For the concern of
information privacy, all the students were anonymized and only their a liation at the
college level and book borrowing history data were used. Book metadata such as
publish year, pages, genre, title, and book cover image were used. The following
Table 1 describes the features we utilized for analysis.</p>
        <p>Book recommendation models were implemented in two di erent ways by
adopting di erent output values as the outcomes. The rst model is a
multiclass prediction model that predicts the last book a user borrowed and thus
recommends one book to the user while the second model is a multi-label
prediction model that predicts multiple books to the user. In the rst model, for
each user, we select 85 books (i.e., median value) and use the rst 84 books as
input and predict the last (i.e., the 85th) book. For example, if a student
borrowed 100 books, the rst 85 books would be selected and the reaming 15 books
would be disposed. The second model, on the other hand, uses a maximum of
84 books as input and predict the remaining book. For example, if a student
borrowed 100 books, the rst 84 books would be used as input, and the
remaining 16 books would be used as outcomes. We implemented two deep learning
models that share the same model architecture but have di erent output layers.
The following Fig. 1 displays the proposed model architecture.</p>
        <p>The embeddings of the borrowed books and student's information pass through
average-pooling layers and concatenated into a vector. This vector consists of the
entire information of the inputs. The embeddings of books include the publish
year, page, cover image, genre, and title of the books that were loaned and the
student's school. The concatenated vector goes through the batch normalization
layers, dropout layers, and dense layers with relu or tanh activation in sequence.
In terms of the output layer, the multi-class classi cation's output layer uses the
softmax activation while the multi-label classi cation's output layer uses the
sigmoid activation. In turn, they predict a value and multiple values, respectively.</p>
        <p>
          Embeddings lie at the heart of the proposed methods. Embeddings allow
sparse data to increase the density of the data by projecting it into a vector
space with a relatively lower dimension, making it more e cient[
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. For this
reason, we implemented embeddings to compile the diverse types of data. Three
of the embedding layers were constructed using XLM-RoBERTa(Cross-Lingual
Robustly Optimized BERT pretraining approach). This includes the title of the
book, the genre of the book, and the school of the student. Particularly because
the titles of the books included Korean, English, and Chinese, we used
XLMRoBERTa to formulate the embeddings, which is a transformer-based
multilingual masked language model that is pre-trained on a text in 100 languages that
include the abovementioned languages mentioned[
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. The fourth embedding layer
was constructed with the cover images of each book. We utilized E cientNet to
construct the image embeddings. Through feature extraction by the pretrained
E cientNet, which applies a compound scaling method that considers three
scaling methods in balance: depth scaling, width scaling, and resolution scaling,
we were able to create meaningful embedding values[
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. The last layer was a
combination of the numerical values. This layer contained three versions of the
books publish year and pages respectively, including the square, root, and
original value. Lastly, all of these embeddings were normalized by a MinMaxScaler
to coordinate the range of the data.
4
4.1
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Results</title>
      <sec id="sec-4-1">
        <title>Model Implementation</title>
        <p>As the multi-class prediction model's output layer uses the softmax
activation, each student is assigned with only one of the 206089 books. The multi-label
prediction model uses the sigmoid activation, where each student is assigned with
multiple books. These models were evaluated by accuracy. To improve models'
performance, we trained multiple models by ne-tuning hyperparameters such as
the learning rate, the momentum, and the optimizer. After ne-tuning the
models, we constructed an ensemble model with soft voting. The following Table 2
shows the accuracy for the nal models built through soft voting.</p>
        <p>As shown in Table 2, the multi-class prediction model performed better than
the multi-label prediction model. The former model's training objective
concentrated on one candidate value, whereas the latter model's training focus is
distracted to several candidate values, making it more challenging to predict
outcomes.
4.2</p>
      </sec>
      <sec id="sec-4-2">
        <title>User-Centered Evaluation</title>
        <p>We recruited 72 SKKU undergraduate students to evaluate the two models.
For equivalent comparison, each model selected ve books with high classi cation
probabilities, resulting in a total of ten books recommendation to each student.
The students were asked to evaluate the performance of the models by rate each
of the ten recommended books using a 5-point Likert scale. Each model's ve
ratings given by a user were averaged and treated as the nal score that the user
give to the model. The multi-class classi cation model got a higher satisfaction
rating than the multi-label classi cation model. The multi-class model scored
3.4 average points (sd = 1.21) out of 5 points while the latter, the multi-label
model, received 3.0 average points (sd = 1.46) out of 5 points. The distribution
of the scores is shown in Figure 2.</p>
        <p>Interviews were also conducted with the evaluation, where some students
responded that they had high reliability with the models because they received
recommendations of books they had borrowed from outside the school library. Other
students responded that the list of the recommended books exactly matched their
preference as it contained books they personally owned. Whilst most responses
are positive, limitations of the models were also pointed out. Some students
mentioned that the recommendations re ect their elds of study well but are not
good at capturing their everyday reading patterns. This feedback is plausible as
we did not use personal information of individuals for privacy reasons. By
making use of more individual-level data, recommendations may be more tailored to
each individual.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Conclusions and Future work</title>
      <p>This study employs deep neural network techniques to propose book
recommendation models using book metadata and user data while the rating data
is not available. Two types of models: the multi-class classi cation model and
the multi-label classi cation model were proposed and evaluated by university
students. The multi-class classi cation model performed better than the
multilabel classi cation model (i.e., 3.4 vs. 3.0 in the 5-Point Likert Scale). While most
recommendation systems rely on users' ratings on items, the proposed models
do not rely on users' book ratings given that ratings are generally not
available in the university libraries. Therefore, the proposed model may have higher
feasibility in the real-world setting.</p>
      <p>For the future work, we plan to improve the models using more borrowing
records from an extended period of time. In addition, we plan to add a ltering
option for students to narrow down the recommendations based on their speci c
information needs and cluster books based on their similarities. We believe these
approaches would increase user's experience and satisfaction.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Alexis</surname>
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kartikay</surname>
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Naman</surname>
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vishrav</surname>
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guillaume</surname>
            <given-names>W.</given-names>
          </string-name>
          , Francisco G.,
          <string-name>
            <surname>Edouard</surname>
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Myle</surname>
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Luke</surname>
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Veselin</surname>
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Unsupervised Cross-lingual Representation Learning at Scale</article-title>
          .
          <source>In: Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics</source>
          , pp.
          <volume>8440</volume>
          {
          <fpage>8451</fpage>
          .
          <article-title>Association for Computational Linguistics, online</article-title>
          . (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2. Carnegie Library of Pittsburgh Homepage, https://www.carnegielibrary.org/ get-book
          <string-name>
            <surname>-</surname>
          </string-name>
          recommendations
          <string-name>
            <surname>-</surname>
          </string-name>
          at-home/.
          <source>Last accessed 28</source>
          ,
          <string-name>
            <surname>Jan</surname>
            <given-names>2021</given-names>
          </string-name>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Fu</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , Zhang, Y.:
          <article-title>On the Recommender System for University Library</article-title>
          .
          <source>International Association for Development of the Information Society</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Ghadling</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Belavadi</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bhegade</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ghojage</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kamble</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>Digital library: using hybrid book recommendation engine</article-title>
          .
          <source>International Journal of Engineering and Computer Science</source>
          <volume>4</volume>
          (
          <issue>11</issue>
          ),
          <volume>01</volume>
          {
          <fpage>02</fpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5. Library of Seoul Nation University Homepage, https://library.snu.ac.kr/notice/ view/2754823. Last accessed 28,
          <string-name>
            <surname>Jan</surname>
            <given-names>2021</given-names>
          </string-name>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          :
          <article-title>Recommender System for Books in University Library with Implicit Data</article-title>
          .
          <source>In: Proceedings of the 2018 International Conference on Network, Communication</source>
          , Computer Engineering (NCCE
          <year>2018</year>
          ), pp.
          <volume>164</volume>
          {
          <fpage>168</fpage>
          . Atlantis Press (
          <year>2018</year>
          ) https://doi.org/10.2991/ncce-
          <fpage>18</fpage>
          .
          <year>2018</year>
          .28
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7. Memorial Hall Library Homepage, https://mhl.org/advice. Last accessed 28,
          <string-name>
            <surname>Jan</surname>
            <given-names>2021</given-names>
          </string-name>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8. New York Public Library Homepage, https://www.nypl.org/shelf-help.
          <source>Last accessed 28</source>
          ,
          <string-name>
            <surname>Jan</surname>
            <given-names>2021</given-names>
          </string-name>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Paul</surname>
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jay</surname>
            <given-names>A.</given-names>
          </string-name>
          , and Emre S.:
          <article-title>Deep Neural Networks for YouTube Recommendations</article-title>
          .
          <source>In: Proceedings of the 10th ACM Conference on Recommender Systems</source>
          , New York, NY (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Rahutomo</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Haryono</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Perbangsa</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pardamean</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Embedding Model Design for Producing Book Recommendation (</article-title>
          <year>2019</year>
          ). https://doi.org/10.1109/ICIMTech.
          <year>2019</year>
          .8843769
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Tan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Le</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          : E cientNet:
          <article-title>Rethinking Model Scaling for Convolutional Neural Networks</article-title>
          .
          <source>In: Proceedings of the 36th International Conference on Machine Learning</source>
          , pp.
          <volume>6105</volume>
          {
          <fpage>6114</fpage>
          . (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Tian</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zheng</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          :
          <article-title>College library personalized recommendation system based on hybrid recommendation algorithm</article-title>
          .
          <source>Procedia CIRP 83</source>
          ,
          <issue>490</issue>
          {
          <fpage>494</fpage>
          (
          <year>2019</year>
          ) https://doi.org/10.1016/j.procir.
          <year>2019</year>
          .
          <volume>04</volume>
          .126
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Tsuji</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Takizawa</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sato</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ikeuchi</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ikeuchi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yoshikane</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Itsumura</surname>
          </string-name>
          , H.:
          <article-title>Book recommendation based on library loan records and bibliographic information</article-title>
          .
          <source>Procedia-Social and Behavioral Sciences</source>
          <volume>147</volume>
          ,
          <volume>478</volume>
          {
          <fpage>486</fpage>
          (
          <year>2014</year>
          ) https://doi.org/10.1016/j.sbspro.
          <year>2014</year>
          .
          <volume>07</volume>
          .142
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Young</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hazarika</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Poria</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cambria</surname>
          </string-name>
          , E.:
          <article-title>Recent Trends in Deep Learning Based Natural Language Processing</article-title>
          .
          <source>In: IEEE Computational Intelligence Magazine</source>
          , vol.
          <volume>13</volume>
          , pp.
          <volume>55</volume>
          {
          <fpage>75</fpage>
          . (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>