<!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>
      <journal-title-group>
        <journal-title>Workshop on Adaptive Lifelong Learning, July</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>mendations in MOOCs using collaborative filtering and survival analysis (Invited Paper)</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Alireza Gharahighehi</string-name>
          <email>alireza.gharahighehi@kuleuven.be</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Michela Venturini</string-name>
          <email>michela.venturini@kuleuven.be</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Celine Vens</string-name>
          <email>celine.vens@kuleuven.be</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>KU Leuven</institution>
          ,
          <addr-line>Campus Kulak</addr-line>
          ,
          <institution>Department of Public Health and Primary Care</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2024</year>
      </pub-date>
      <volume>0</volume>
      <fpage>8</fpage>
      <lpage>12</lpage>
      <abstract>
        <p>Massive Open Online Courses (MOOCs) are becoming a complementary, or even preferred, method of learning compared to traditional education among learners. While MOOCs enable learners to access a wide range of courses from various disciplines, anytime and anywhere, a significant number of course enrollments in MOOCs end up in dropouts. To increase learners' engagement in MOOCs, they need to interact with the courses that match their preferences and needs. A course Recommender System (RS) models learners' preferences and recommends courses based on their previous interactions within the MOOC platform. Dropout events in MOOCs, like other time-to-event predictions, can be efectively modeled using survival analysis methods. The objective of this talk is to illustrate the benefits of employing survival analysis in enhancing the performance of collaborative ifltering-based course recommendations in MOOCs.</p>
      </abstract>
      <kwd-group>
        <kwd>recommendation systems</kwd>
        <kwd>survival analysis</kwd>
        <kwd>collaborative filtering</kwd>
        <kwd>massive open online courses</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Massive Open Online Courses (MOOCs) platforms ofer a diverse selection of online courses to learners
worldwide, promoting the concept of equitable learning by removing barriers of location and time.
Despite its considerable advantages, a significant portion of MOOC enrollments end up in dropouts. It
has been reported that dropout rates for courses ofered by prestigious institutions like MIT and Harvard
can be as high as 90% [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. While dropouts may result from various reasons, such as accessing only the
free portions of the courses, finding the course or topic irrelevant, or insuficient competencies, this
information is valuable for modeling users’ preferences in MOOCs and would provide more infromed
recommendations.
      </p>
      <p>Recommender Systems (RSs) are intelligent information retrieval algorithms that utilize users’ past
interactions to suggest the most relevant items to them. Generally, RSs can be categorized into two
main types: Content-based filtering and collaborative filtering. Content-based filtering RSs recommend
items whose features match those of items that the target user has previously liked. On the other hand,
collaborative filtering RSs model users’ preferences based on similarities between the past interactions
of users and items.</p>
      <p>
        In a MOOC platform, a collaborative filtering-based RS can be applied to recommend courses to users
based on their previous enrollments in the platform. While previous enrollments are informative to
model users’ preferences, the dropout information is still missing in this kind of recommendations.
The dropout event in MOOCs is crucial as a significant portion of enrollments result in dropout. This
additional information about user-course interactions can be useful to better model users’ preferences
or needs regarding the courses in MOOC platform. Survival analysis (SA) comprises a set of statistical
methods that model the time until an instance experiences a specific event such as death or machine
failure [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The key characteristic of survival data is that some instances have unobserved events,
      </p>
      <p>CEUR
Workshop
Proceedings</p>
      <p>
        ceur-ws.org
ISSN1613-0073
referred to as censored data. The most common form of censoring in SA is right-censoring, where the
target event is not observed during follow-up or the instance is lost before the end of the follow-up
period. The main strength of SA is its utilization of such partial information during the learning
process by considering instances with censored events, which are usually discarded in classification and
regression tasks. We believe that time to dropout is highly informative in modeling users’ preferences in
the context of course recommendations, as it provides valuable insights regarding students’ engagement
in MOOCs [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
      </p>
      <p>
        In a previous study [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], the authors demonstrated that SA can improve the performance of a specific
RS, namely Bayesian Personalized Ranking (BPR), when the predictions of a SA method, trained based
on time to dropouts, are embedded in the BPR algorithm. In this invited talk, we discuss how to
generalize the usage of SA in any type of collaborative filtering-based RS. In the next section, we briefly
report the existing literature around dropout in MOOCs and then in Section 3, elaborate on the research
questions that could be tackled by researchers regarding enhancing MOOC recommendations using
dropout information. Finally, in Section 4, we illustrate the possible experimental setup to conduct such
research studies.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Related work</title>
      <p>
        The task of dropout prediction in the context of MOOCs has been mainly modeled as a classification
task [
        <xref ref-type="bibr" rid="ref2 ref6">6, 2</xref>
        ]. While in this studies the task was predicting the event of dropout they ignored the time
information, i.e., time to dropout, in their predictions. SA can be used to incorporate the time information
in modeling dropout in MOOCs and there are some promising examples in the literature. In [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] survival
analysis was used to model dropout risk in the context of MOOCs and unveil social and behavioral
feature impacts on the outcome. Xie [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] utilized survival analysis to examine the hazard function of
dropout, employing the learner’s course viewing duration on a course in MOOCs. Labrador et al. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]
specified the fundamental factors attached to learners’ dropout in an online MOOCs platform using
Cox Proportional Hazard regression. Wintermute et al. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] applied Weibull survival function to model
the certificate rates of learners in a MOOCs platform, assuming that learners “survive” in a course for
a particular time before stochastically dropping out. In [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] a more sophisticated SA deep learning
approach was proposed to tackle volatility and sparsity of the data, that moderately outperformed the
Cox model.
      </p>
      <p>While SA has been already applied in literature to model dropout in MOOCs, to the best of our
knowledge, such time to dropout from courses has never been incorporated in course recommendations
in the context of MOOCs. The research gap this invited talk aims to investigate is whether utilizing this
time-to-event information would enhance the performance of typical collaborative filtering approaches,
and how it would do so.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Research questions</title>
      <p>
        In this invited talk, the focus is to discuss the merits of SA in course recommendations when the
time-to-events information is available in the context of MOOCs. The following research questions
would be interesting to tackle:
1. Does a SA method trained based on time to dropout have a positive impact on the performance of
course recommendations in MOOCs when combined with a regular RS? In a previous paper [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ],
authors followed the most straightforward approach to combine the SA method and the RS. They
enhanced the training data of the RS using the predictions of the SA method. What would be the
other possible ways of combining the SA method and the RS?
a) Is it possible to generalize the proposed augmentation idea in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] to the other possible
learning-to-rank recommendation approaches such as Weighted Approximate-Rank
Pairwise (WARP) [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]?
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. Experimental setup</title>
      <p>
        To conduct research studies to answer the raised research questions in the previous section, powerful
collaborative filtering RSs should be employed as the competing approaches. Following the findings of
the award winning paper [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], traditional collaborative filtering methods such as BPR [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], WARP [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ],
User- and Item-based k Nearest Neighbors (UKNN [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] and IKNN [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]) and Sparse Linear Methods
(SLIM [19]) outperform more recent neural network based RSs and therefore can be used as baselines.
These baselines can be used to benchmark performance of a SA-based RS, a collaborative filtering RS
enhanced with SA post-processing, or a multi-task method that learns both the time-to-event prediction
task and the recommendation task. Researchers could apply the competing methods on the three
publicly available datasets, namely Xuentangx [20], Canvas [21] and KDD-CUP [20] and possibly an
additional dataset from another domain such as series recommendations. The competing methods shall
be evaluated based on the typical evaluation measures for RSs such as NDCG and recall.
[19] X. Ning, G. Karypis, Slim: Sparse linear methods for top-n recommender systems, in: 2011 IEEE
11th international conference on data mining, IEEE, 2011, pp. 497–506. doi:10.1109/ICDM.2011.
134.
[20] W. Feng, J. Tang, T. X. Liu, Understanding dropouts in moocs, in: Proceedings of the AAAI
Conference on Artificial Intelligence, volume 33, 2019, pp. 517–524. doi: 10.1609/aaai.v33i01.
3301517.
[21] C. Network, Canvas Network Person-Course (1/2014 - 9/2015) De-Identified Open Dataset, Harvard
Dataverse, 2016. doi:10.7910/DVN/1XORAL.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Gharahighehi</surname>
          </string-name>
          ,
          <string-name>
            <surname>R. Van Schoors</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Topali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Ooge</surname>
          </string-name>
          ,
          <article-title>Adaptive lifelong learning (all)</article-title>
          ,
          <source>in: International Conference on Artificial Intelligence in Education</source>
          , Springer,
          <year>2024</year>
          , pp.
          <fpage>452</fpage>
          -
          <lpage>459</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>031</fpage>
          -64312-5_
          <fpage>57</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Fang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Xue</surname>
          </string-name>
          ,
          <article-title>A systematic review for mooc dropout prediction from the perspective of machine learning, Interactive Learning Environments (</article-title>
          <year>2022</year>
          )
          <fpage>1</fpage>
          -
          <lpage>14</lpage>
          . doi:
          <volume>10</volume>
          .1080/ 10494820.
          <year>2022</year>
          .
          <volume>2124425</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>T. G.</given-names>
            <surname>Clark</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. J.</given-names>
            <surname>Bradburn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. B.</given-names>
            <surname>Love</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. G.</given-names>
            <surname>Altman</surname>
          </string-name>
          ,
          <article-title>Survival analysis part i: basic concepts and ifrst analyses</article-title>
          ,
          <source>British journal of cancer 89</source>
          (
          <year>2003</year>
          )
          <fpage>232</fpage>
          -
          <lpage>238</lpage>
          . doi:
          <volume>10</volume>
          .1038/sj.bjc.
          <volume>6601118</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Rõõm</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lepp</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Luik</surname>
          </string-name>
          ,
          <article-title>Dropout time and learners' performance in computer programming moocs</article-title>
          ,
          <source>Education Sciences</source>
          <volume>11</volume>
          (
          <year>2021</year>
          )
          <fpage>643</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>A.</given-names>
            <surname>Gharahighehi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Venturini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ghinis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Cornillie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Vens</surname>
          </string-name>
          ,
          <article-title>Extending bayesian personalized ranking with survival analysis for mooc recommendation</article-title>
          ,
          <source>in: Adjunct Proceedings of the 31st ACM Conference on User Modeling, Adaptation and Personalization</source>
          ,
          <year>2023</year>
          , pp.
          <fpage>56</fpage>
          -
          <lpage>59</lpage>
          . doi:
          <volume>10</volume>
          . 1007/978-3-
          <fpage>031</fpage>
          -64312-5_
          <fpage>57</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>F.</given-names>
            <surname>Dalipi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Imran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Kastrati</surname>
          </string-name>
          ,
          <article-title>Mooc dropout prediction using machine learning techniques: Review and research challenges, in: 2018 IEEE global engineering education conference (EDUCON)</article-title>
          , IEEE,
          <year>2018</year>
          , pp.
          <fpage>1007</fpage>
          -
          <lpage>1014</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>N.</given-names>
            <surname>Gitinabard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Khoshnevisan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. F.</given-names>
            <surname>Lynch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Your actions or your associates? predicting certification and dropout in moocs with behavioral and social features</article-title>
          , arXiv preprint arXiv:
          <year>1809</year>
          .
          <volume>00052</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <article-title>Modelling the dropout patterns of mooc learners</article-title>
          ,
          <source>Tsinghua Science and Technology</source>
          <volume>25</volume>
          (
          <year>2019</year>
          )
          <fpage>313</fpage>
          -
          <lpage>324</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>M. M. Labrador</surname>
            ,
            <given-names>G. R. G.</given-names>
          </string-name>
          <string-name>
            <surname>Vargas</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Alvarado</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Caicedo</surname>
          </string-name>
          ,
          <article-title>Survival and risk analysis in moocs</article-title>
          ,
          <source>Turkish Online Journal of Distance Education</source>
          <volume>20</volume>
          (
          <year>2019</year>
          )
          <fpage>149</fpage>
          -
          <lpage>159</lpage>
          . doi:
          <volume>10</volume>
          .17718/tojde.640561.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>E. H.</given-names>
            <surname>Wintermute</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Cisel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. B.</given-names>
            <surname>Lindner</surname>
          </string-name>
          ,
          <article-title>A survival model for course-course interactions in a massive open online course platform</article-title>
          ,
          <source>PloS one 16</source>
          (
          <year>2021</year>
          )
          <article-title>e0245718</article-title>
          . doi:
          <volume>10</volume>
          .1371/journal.pone.
          <volume>0245718</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>F.</given-names>
            <surname>Pan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ji</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>A survival analysis based volatility and sparsity modeling network for student dropout prediction</article-title>
          ,
          <source>PloS one 17</source>
          (
          <year>2022</year>
          )
          <article-title>e0267138</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J.</given-names>
            <surname>Weston</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bengio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Usunier</surname>
          </string-name>
          , Wsabie:
          <article-title>Scaling up to large vocabulary image annotation</article-title>
          , in: Twenty-Second
          <source>International Joint Conference on Artificial Intelligence</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>A.</given-names>
            <surname>Gharahighehi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Pliakos</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Vens, Addressing the cold-start problem in collaborative filtering through positive-unlabeled learning and multi-target prediction</article-title>
          ,
          <source>IEEE Access 10</source>
          (
          <year>2022</year>
          )
          <fpage>117189</fpage>
          -
          <lpage>117198</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>A.</given-names>
            <surname>Gharahighehi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Vens</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Pliakos</surname>
          </string-name>
          ,
          <article-title>An ensemble hypergraph learning framework for recommendation</article-title>
          ,
          <source>in: Discovery Science: 24th International Conference, DS</source>
          <year>2021</year>
          ,
          <article-title>Halifax</article-title>
          ,
          <string-name>
            <surname>NS</surname>
          </string-name>
          , Canada,
          <source>October 11-13</source>
          ,
          <year>2021</year>
          , Proceedings 24, Springer,
          <year>2021</year>
          , pp.
          <fpage>295</fpage>
          -
          <lpage>304</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -88942-5_
          <fpage>23</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>M. F.</given-names>
            <surname>Dacrema</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Cremonesi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Jannach</surname>
          </string-name>
          ,
          <article-title>Are we really making much progress? a worrying analysis of recent neural recommendation approaches</article-title>
          ,
          <source>in: Proceedings of the 13th ACM conference on recommender systems</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>101</fpage>
          -
          <lpage>109</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>S.</given-names>
            <surname>Rendle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Freudenthaler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Gantner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Schmidt-Thieme</surname>
          </string-name>
          ,
          <article-title>Bpr: Bayesian personalized ranking from implicit feedback</article-title>
          ,
          <source>in: Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence</source>
          ,
          <year>2009</year>
          , pp.
          <fpage>452</fpage>
          -
          <lpage>461</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>B.</given-names>
            <surname>Sarwar</surname>
          </string-name>
          , G. Karypis,
          <string-name>
            <given-names>J.</given-names>
            <surname>Konstan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Riedl</surname>
          </string-name>
          ,
          <article-title>Item-based collaborative filtering recommendation algorithms</article-title>
          ,
          <source>in: Proceedings of the 10th international conference on World Wide Web</source>
          ,
          <year>2001</year>
          , pp.
          <fpage>285</fpage>
          -
          <lpage>295</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>P.</given-names>
            <surname>Lops</surname>
          </string-name>
          , M. d. Gemmis, G. Semeraro,
          <article-title>Content-based recommender systems: State of the art and trends, Recommender systems handbook (</article-title>
          <year>2011</year>
          )
          <fpage>73</fpage>
          -
          <lpage>105</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>