<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//TaxonX//DTD Taxonomic Treatment Publishing DTD v0 20100105//EN" "../../nlm/tax-treatment-NS0.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:tp="http://www.plazi.org/taxpub" article-type="research-article" dtd-version="3.0" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">109</journal-id>
      <journal-id journal-id-type="index">urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891</journal-id>
      <journal-title-group>
        <journal-title xml:lang="en">JUCS - Journal of Universal Computer Science</journal-title>
        <abbrev-journal-title xml:lang="en">jucs</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="ppub">0948-695X</issn>
      <issn pub-type="epub">0948-6968</issn>
      <publisher>
        <publisher-name>Journal of Universal Computer Science</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3217/jucs-017-14-2009</article-id>
      <article-id pub-id-type="publisher-id">30036</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group subj-group-type="scientific_subject">
          <subject>H.1.m - Miscellaneous</subject>
          <subject>H.3.1 - Content Analysis and Indexing</subject>
          <subject>H.4.m - Miscellaneous</subject>
          <subject>J.0 - GENERAL</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>A Visited Item Frequency Based Recommender System: Experimental Evaluation and Scenario Description</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Konow</surname>
            <given-names>Roberto</given-names>
          </name>
          <email xlink:type="simple">roberto.konow@mail.udp.cl</email>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Tan</surname>
            <given-names>Wayman</given-names>
          </name>
          <xref ref-type="aff" rid="A2">2</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Loyola</surname>
            <given-names>Luis</given-names>
          </name>
          <xref ref-type="aff" rid="A2">2</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Pereira</surname>
            <given-names>Javier</given-names>
          </name>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Baloian</surname>
            <given-names>Nelson</given-names>
          </name>
          <uri content-type="orcid">https://orcid.org/0000-0003-1608-6454</uri>
          <xref ref-type="aff" rid="A3">3</xref>
        </contrib>
      </contrib-group>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">Universidad Diego Portales, Santiago de Chile, Chile</addr-line>
        <institution>Universidad Diego Portales</institution>
        <addr-line content-type="city">Santiago de Chile</addr-line>
        <country>Chile</country>
      </aff>
      <aff id="A2">
        <label>2</label>
        <addr-line content-type="verbatim">SkillUpJapan Corporation, Tokyo, Japan</addr-line>
        <institution>SkillUpJapan Corporation</institution>
        <addr-line content-type="city">Tokyo</addr-line>
        <country>Japan</country>
      </aff>
      <aff id="A3">
        <label>3</label>
        <addr-line content-type="verbatim">DCC, Universidad de Chile, Santiago, Chile</addr-line>
        <institution>DCC, Universidad de Chile</institution>
        <addr-line content-type="city">Santiago</addr-line>
        <country>Chile</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Roberto Konow (<email xlink:type="simple">roberto.konow@mail.udp.cl</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>2011</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>01</day>
        <month>10</month>
        <year>2011</year>
      </pub-date>
      <volume>17</volume>
      <issue>14</issue>
      <fpage>2009</fpage>
      <lpage>2028</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/56AE2581-D07D-56E6-8BF1-F84E060520B9">56AE2581-D07D-56E6-8BF1-F84E060520B9</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/7001803">7001803</uri>
      <permissions>
        <copyright-statement>Roberto Konow, Wayman Tan, Luis Loyola, Javier Pereira, Nelson Baloian</copyright-statement>
        <license license-type="creative-commons-attribution" xlink:href="" xlink:type="simple">
          <license-p>This article is freely available under the J.UCS Open Content License.</license-p>
        </license>
      </permissions>
      <abstract>
        <label>Abstract</label>
        <p>There has been a continuous development of new clustering and prediction techniques that help customers select products that meet their preferences and/or needs from an overwhelming amount of available choices. Because of the possible huge amount of available data, existing Recommender Systems showing good results might be difficult to implement and may require a lot of computational resources to perform in this scenario. In this paper, we present a more simple recommender system than the traditional ones, easy to implement, and requiring a reasonable amount of resources to perform. This system clusters users according to the frequency an item has been visited by users belonging to the same cluster, performing a collaborative filtering scheme. Experiments were conducted to evaluate the accuracy of this method using the Movielens dataset. Results obtained, as measured by the F-measure value, are comparable to other approaches found in the literature which are far more complex to implement. Following this, we explain the application of this system to an e-content site scenario for advertising. In this context, a filtering tool is shown which has been developed to filter and contextualize recommended items.</p>
      </abstract>
    </article-meta>
  </front>
</article>
