<!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>Recommender Systems for Online Classi ed Advertisements</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Vasily A. Leksin</string-name>
          <email>vleksin@avito.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Recommender Systems Unit, AVITO.ru</institution>
          ,
          <addr-line>Moscow</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This talk is about our journey from simple linear models to neural networks in the development of Recommender Systems in Avito and the current recommendations architecture. I share successes and failures in building highly loaded Recommendation Systems. We discuss the gap between the latest scienti c approaches and methods applicable in production systems and why we claim that the \keep it simple" principle works well in production systems.</p>
      </abstract>
      <kwd-group>
        <kwd>Reccomnder Systems</kwd>
        <kwd>Classi ed Advertisements</kwd>
        <kwd>high load</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body />
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Rubtsov</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kamenshchikov</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Valyaev</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leksin</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ignatov</surname>
            ,
            <given-names>D.I.:</given-names>
          </string-name>
          <article-title>A hybrid two-stage recommender system for automatic playlist continuation</article-title>
          .
          <source>In: Proceedings of the ACM Recommender Systems Challenge</source>
          <year>2018</year>
          . RecSys Challenge '
          <volume>18</volume>
          , New York, NY, USA, ACM (
          <year>2018</year>
          )
          <volume>16</volume>
          :
          <fpage>1</fpage>
          {
          <issue>16</issue>
          :
          <fpage>4</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Leksin</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ostapets</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kamenshikov</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Khodakov</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rubtsov</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Combination of content-based user pro ling and local collective embeddings for job recommendation</article-title>
          .
          <source>In: CEUR Workshop Proceeding</source>
          , Vol.
          <year>1968</year>
          , International Workshop on Experimental Economics and
          <article-title>Machine Learning (EEML</article-title>
          <year>2017</year>
          ).
          <article-title>CEUR-ws (</article-title>
          <year>2017</year>
          )
          <volume>9</volume>
          {
          <fpage>17</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Leksin</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ostapets</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Job recommendation based on factorization machine and topic modelling</article-title>
          .
          <source>In: Proceedings of the Recommender Systems Challenge. RecSys Challenge '16</source>
          , New York, NY, USA, ACM (
          <year>2016</year>
          )
          <article-title>6:1{6:4</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Leksin</surname>
            ,
            <given-names>V.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nikolenko</surname>
            ,
            <given-names>S.I.</given-names>
          </string-name>
          :
          <article-title>Semi-supervised tag extraction in a web recommender system</article-title>
          . In Brisaboa, N.,
          <string-name>
            <surname>Pedreira</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zezula</surname>
          </string-name>
          , P., eds.:
          <source>Similarity Search and Applications</source>
          , Berlin, Heidelberg, Springer Berlin Heidelberg (
          <year>2013</year>
          )
          <volume>206</volume>
          {
          <fpage>212</fpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>