<!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 Banking and Financial Services</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Andrea Gigli</string-name>
          <email>andrea.gigli@mpscs.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fabrizio Lillo</string-name>
          <email>fabrizio.lillo@unibo.it</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Daniele Regoli</string-name>
          <email>daniele.regoli@sns.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>MPS Capital Services</institution>
          ,
          <addr-line>Viale Mazzini, 23, Siena</addr-line>
          ,
          <country country="IT">Italy 53100</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Scuola Normale Superiore</institution>
          ,
          <addr-line>Piazza dei Cavalieri 7, Pisa</addr-line>
          ,
          <country country="IT">Italy 56126</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Università di Bologna</institution>
          ,
          <addr-line>Viale Quirico Filopanti 5, Bologna, Italy 40126</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2017</year>
      </pub-date>
      <abstract>
        <p>In this work we demonstrate the usefulness of the application of Recommender Systems in the financial domain. Specifically we investigate a dataset, made available by a major European bank, containing the purchases of a large set of investment assets by 200k investors. We also present some preliminary results of the application of network analysis via statistical validation to identify clusters of investment assets.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>Banking and Financial Services, being them provided by incumbent
Banks or by FinTech companies, are looking seriously at machine
learning and information retrieval fields in order to leverage the
data at their disposal to provide tailored services and customized
experiences to their customers.</p>
      <p>One of the fields of computer science which can support this
attempt is the one represented by Recommender Systems (RecSys),
which has been heavily investigated in the last years by the research
community as well as the most promising companies in the
ecommerce and entertainment fields.</p>
      <p>In this work we show the usefulness of some RecSys algorithms
in suggesting investment assets to a large panel of investors. This
is done by using a large dataset provided by a major European bank
and comparing the performance of three diferent RecSys against
two baseline models in the task of suggesting investment assets.
The recommender system implementation and analysis have been
done on a dataset with financial investment information, made
available to us by a European bank during a research collaboration
program, which contains 224,885 clients, 1,288,315 transactions and
information related to 7 diferent asset types, 23 rating levels, 6
order channels, 12 industrial sectors, 8 maturity buckets, 5 coupon
types, 2 product complexity levels.</p>
      <p>The records span a period of twelve months and all data entries
are properly hashed, anonymized and organized as a table, where
each record represents a purchase defined by: execution date, user
data (client, branch and account identifiers) and traded item data
(type of asset, transaction currency, asset country, time to maturity,
complexity, industrial sector, industrial group, industrial sub-group,
rating, coupon type, trading channel, buy-sell type).</p>
      <p>Having no information on the traded volume per transaction
nor the client total wealth at the time of each trade, we model the
recommendation problem on the basis of the binary information
purchased/not purchased item.</p>
      <p>Implicit feedback recommender for financial
investments
To better capture clients’ preferences we compare three diferent
RecSys algorithms. All of them required to test diferent
combinations of features at our disposal in order to define user and item
entities. After some trials and analysis, we defined the user as a
combination of client ID and bank branch, and the item as a combination
of asset type, country, time to maturity, coupon type, industrial
sector and rating.The results for other aggregations are qualitatively
analogous.</p>
      <p>
        The first algorithm we tested is the Bayesian Personalized
Ranking algorithm [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] where we use a matrix factorization method
maximizing the posterior probability of user preference structure,
and tune model’s parameters via 5-fold cross-validation. The
second one is the Alternating Least Squares algorithm [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] using 30
latent factors and a regularization factor equal to 0.01. The third
one is an adaptation of the Word2Vec algorithm [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] that we call
Asset-Embedding in the following. In this case we treated the clients’
portfolios as they were documents, each asset as a word, and
vectorrepresented each asset by the portfolio it belongs to via continuous
bag of words in a 300 dimension space.
      </p>
      <p>
        The RecSys algorithms mentioned above are evaluated through
various tests against two benchmark algorithms based on most
popular items by number of users (POP.u) or by number of transactions
(POP.trans):
(1) Average Accuracy of the user preference structure (see [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]);
(2) Expected percentile ranking, as defined in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] (the lower, the
better);
(3) the Area Under the ROC curve.
      </p>
      <p>Other metrics (e.g. novelty and coverage) have been calculated but
are left out for lack of space. Diferent train/test sampling
methodologies were used:
(1) leave-one-out: removing randomly from train one purchased
asset for each user (who has at least 5 purchases);
(2) leave-last-out: removing from train the last (in time) asset
purchased by each user;
(3) 20% level sampling: removing randomly from train 20% of
interactions.
Due to limited amount of space, we here report the results for the
leave-last-out case only.</p>
      <p>Given that a good RecSys should give suggestions relevant and
specific to the user and expand user’s taste into neighboring areas,
we run the above tests after removing n = {0, 20, 50} most popular
items from the test set. In this way if a RecSys performs well with
0 popular items removed and poorly with 50, it is reasonable to
deduce that maybe it is just good in suggesting popular items but
not items related to the specific interests of the user.</p>
      <p>Table 1 displays the results of our study for the leave-last-out
train/test sampling case.It shows that all the RecSys we propose
perform extremely well on the dataset at our disposal, in terms of
both average accuracy and ranking structure (expected percentile
ranking - Rank - and AUC). BPR-MF is the best performer when
no popular items is excluded from the test set and its advantage
doesn’t reduce when we increase the number of popular purchased
item removed from the test set. ALS performs similarly well, while
Asset Embedding performs better than POPs when the number of
popular items excluded from the test set is at least 50, but it never
beats BPR-MF and ALS.</p>
      <p>
        Toward a network-based RecSys for banking and
ifnancial services
Besides the training of the recommender system shown above and
the detailed test previously mentioned, we performed an analysis
of the dataset seen as it were a bipartite network users → items.
We implemented a statistical validation procedure [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] to get a
statistically significant projection on the item module of the network.
We used this statistically filtered network:
• to identify items’ communities: each community represents
the set of items that are purchased together by users in a
statistically over-expressed way with respect to a random
rewiring of the bipartite network keeping fixed the assets’
degrees;
• to identify the features that are statistically over-expressed
(or under-expressed) inside communities;
• to compute, for each user, a raking of communities of items
based on the p-values of the hyper-geometric distribution of
Andrea Gigli, Fabrizio Lillo, and Daniele Regoli
      </p>
      <p>the number of purchased objects in the diferent
communities.</p>
      <p>As an example of the possible network analysis, Figure 1 shows
the statistically filtered network derived by applying the validation
algorithm to the bipartite network with the same specification of
users and items as in Table 1, for 1% confidence threshold. There are
4 big connected communities, 2 smaller ones (but still connected)
and 6 small isolated communities. Color of nodes (i.e. of assets)
refers to diferent value of sector attribute. As an example, the
light-blue sector, Governmental assets, results to be statistically
over-expressed in the rightmost community, and under-expressed
in the leftmost and in the bottom one. This evidence indicates that
statistically filtered investors’ decisions could be used to cluster
assets: a promising starting point to build a statistically guided
algorithm for recommendations. This is part of a work in progress
for future publication.</p>
    </sec>
    <sec id="sec-2">
      <title>ACKNOWLEDGMENTS</title>
      <p>The authors would like to thank MPS Bank for supporting the
collaboration, Francesco Mainieri (MPS) for essential support in
extracting the data and Franco Maria Nardini (CNR, Pisa) for useful
comments. FL and DR acknowledge support by the European
Community’s H2020 Program under the scheme INFRAIA-1- 2014-2015:
Research Infrastructures, Grant Agreement No. 654024 SoBigData:
Social Mining &amp; Big Data Ecosystem.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Yifan</given-names>
            <surname>Hu</surname>
          </string-name>
          , Yehuda Koren, and
          <string-name>
            <given-names>Chris</given-names>
            <surname>Volinsky</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>Collaborative filtering for implicit feedback datasets</article-title>
          .
          <source>In Data Mining</source>
          ,
          <year>2008</year>
          . ICDM'08. Eighth IEEE International Conference on. Ieee,
          <volume>263</volume>
          -
          <fpage>272</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Tomas</given-names>
            <surname>Mikolov</surname>
          </string-name>
          , Kai Chen, Greg Corrado, and
          <string-name>
            <given-names>Jefrey</given-names>
            <surname>Dean</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Eficient Estimation of Word Representations in Vector Space</article-title>
          .
          <source>CoRR abs/1301</source>
          .3781 (
          <year>2013</year>
          ). http://arxiv.org/abs/1301.3781
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Stefen</given-names>
            <surname>Rendle</surname>
          </string-name>
          , Christoph Freudenthaler, Zeno Gantner, and
          <string-name>
            <surname>Lars</surname>
          </string-name>
          Schmidt-Thieme.
          <year>2009</year>
          .
          <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>
          . AUAI Press,
          <fpage>452</fpage>
          -
          <lpage>461</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Michele</given-names>
            <surname>Tumminello</surname>
          </string-name>
          , Salvatore Micciche, Fabrizio Lillo, Jyrki Piilo, and
          <string-name>
            <surname>Rosario N Mantegna</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>Statistically validated networks in bipartite complex systems</article-title>
          .
          <source>PloS one 6</source>
          ,
          <issue>3</issue>
          (
          <year>2011</year>
          ),
          <year>e17994</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>