<!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>Assessing the Impact of a User-Item Collaborative Atack on Class of Users∗</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Yashar Deldjoo</string-name>
          <email>R@k</email>
          <email>yashar.deldjoo@poliba.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tommaso Di Noia</string-name>
          <email>tommaso.dinoia@poliba.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Felice Antonio Merra†</string-name>
          <email>felice.merra@poliba.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Polytechnic University of Bari</institution>
          ,
          <addr-line>Bari</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Collaborative Filtering (CF) models lie at the core of most recommendation systems due to their state-of-the-art accuracy. They are commonly adopted in e-commerce and online services for their impact on sales volume and/or diversity, and their impact on companies' outcome. However, CF models are only as good as the interaction data they work with. As these models rely on outside sources of information, counterfeit data such as user ratings or reviews can be injected by attackers to manipulate the underlying data and alter the impact of resulting recommendations, thus implementing a so-called shilling attack. While previous works have focused on evaluating shilling attack strategies from a global perspective paying particular attention to the efect of the size of attacks and attacker's knowledge, in this work we explore the efectiveness of shilling attacks under novel aspects. First, we investigate the efect of attack strategies crafted on a target user in order to push the recommendation of a low-ranking item to a higher position, referred to as user-item attack. Second, we evaluate the efectiveness of attacks in altering the impact of diferent CF models by contemplating the class of the target user, from the perspective of the richness of her profile (i.e., slightly-active v.s. highly-active user). Finally, similar to previous work we contemplate the size of attack (i.e., the amount of fake profiles injected) in examining their success. The results of experiments on two widely used datasets in business and movie domains, namely Yelp and MovieLens, suggest that highly-active and slightly-active users exhibit contrasting behaviors in datasets with diferent characteristics.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction and Related Work</title>
      <p>
        Collaborative filtering (CF) models are a crucial component in
many real-world recommendation services due to their
state-of-theart accuracy. Considering their widespread popularity and adoption
in the industry, the output of these models can impact many
decision qualities in diferent application scenarios [
        <xref ref-type="bibr" rid="ref16 ref28 ref3">3, 16, 28</xref>
        ]. The
open nature of CF models, which rely on user-specified judgments
(e.g., ratings or reviews) to build user profiles and compute
recommendation, can be used in the hand of adversaries to manipulate
the underlying data and afect the impact of recommendation, a
phenomenon commonly referred to as shilling attacks [
        <xref ref-type="bibr" rid="ref11 ref19">11, 19</xref>
        ]. The
attacker may manipulate the recommender for positive motivations,
like outcomes improvement, or malicious, like reducing the user’s
loyalty to a competitor.
      </p>
      <p>
        In this direction, first works [
        <xref ref-type="bibr" rid="ref15 ref19 ref24">15, 19, 24</xref>
        ] focused on diferent
profile injection strategies by analyzing and classifying them on
the required efort and amount of attacker’s knowledge to craft
successful attacks. These works have been followed by multiple
studies on the evaluation of the robustness [
        <xref ref-type="bibr" rid="ref22 ref4 ref7">4, 7, 22</xref>
        ] of diferent CF
models and detection strategies [
        <xref ref-type="bibr" rid="ref18 ref29 ref8">8, 18, 29</xref>
        ]. The robustness analysis
in surveys [
        <xref ref-type="bibr" rid="ref11 ref21">11, 21</xref>
        ] shows that Item-kNN is more robust than
UserkNN and model-based CF are generally more resistant to shilling
attacks than conventional nearest neighbor-based algorithms.
      </p>
      <p>
        One common characteristic of the previous literature on shilling
attacks on CF-RS is their focus on assessing the global impact of
shilling attacks on diferent CF models by examining the success of
attacks from the perspective of attacker’s knowledge and the size of
attack (i.e. the number of shilling profiles) [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. In the present work
instead, we investigate the efectiveness of an attack on a
targetitem of a target-user, namely user-item attack, with a novel point of
attention focused on influence of the attack on the classes of attacked
users in particular highly-active (HA) user and slightly-active (SA)
user.
      </p>
      <p>The application scenario for class-based study of attacks on RS
may span in diferent domains. As an example, a restaurant owner
may wish to diminish the trust on a target user of a competitor
by pushing a low-ranked product for the specific user . The same
argument can be made for new users. An attacker may be interested
in pushing or nuking, particular products with the objective of
modifying the impact of a recommender system in order to afect
future interactions of the new user.</p>
      <p>The leading reserach questions of this work are then:
• RQ1: From a global perspective, what is the impact of
useritem attack on classes of users such as slightly-active and
highly-active users?
– Could attacks be tailored to have a higher impact on a
particular class of users?
– Which factors play a role on the impact of such an attack?
• RQ2: From a local perspective, how do CF recommendation
model work diferently under user-item attacks by looking
to user-classes?</p>
      <p>The remainder of the paper is structured as follows. Section 2
presents the evaluation protocol and datasets description we used
in our experimental evaluation. Section 3 reports on the results
and their discussion. Section 4 concludes the paper and introduces
future perspectives.</p>
    </sec>
    <sec id="sec-2">
      <title>2 User-Item attack modeling and evaluation</title>
      <p>In this section, we discuss our evaluation protocol for a user-item
attack modeling and the corresponding evaluation setup.</p>
    </sec>
    <sec id="sec-3">
      <title>2.1 Evaluation Protocol</title>
      <p>
        In order to test the efects of a user-item attack on attacked
user classes, an extensive set of experiments has been carried out
with respect to three dimensions: (i) the attack strategy (type and
quantity of injected profiles), (ii) core CF recommendation model
and (iii) the user classes. The experimental evaluation has been
executed on two well-known datasets, MovieLens-1M (ML-1M) and
Yelp (described in Section 2.2).
2.1.1 Atack Strategies. We have implemented two attack
strategies to craft shilling profiles (SP) in order to model diferent level
of attacker’s capability. Given a user profile P (u) = {ri1 , . . . , rin }
(consisting of a set of items rated by user u), we consider the items
in P (u) in the form of: selected items (IS ), filler items (IF ), target
item (IT ) previously identified in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], with |IS | + |IF | + |IT | = |P (u)|.
The items in the set IF are selected randomly in order to obstruct
detection of an SP while the only element in IT is the item that the
attacker wants to push, or nuke. Here we focus on two strategies
to build IS , which lies at the core of a shilling profile generation.
The number of items in a shilling profile is close to the mean value
of the number of rating in the dataset. We execute two types of
attacks:
• User-and-Model aware attack (UMA) assumes a partial
knowledge of some victim preferences. The attacker creates
a new profile, called seed profile , on the system with these
preferences and uses the recommendation systems to receive
recommendations. The recommendations are then used to
ifll IS with high ratings. This type of attack is inspired by the
probe attack [
        <xref ref-type="bibr" rid="ref11 ref2 ref6">2, 6, 11</xref>
        ]. In the probe attack, the seed profile is
created by the adversary and the recommendations
generated by the recommender system are used to learn related
items and their ratings in order to built up shilling profiles
very similar to existing users in the system. These items
constitute the 50% of each shilling profile.
• User-Neighbor aware attack (UNA) assumes that the
attacker knows some users similar to the victim. We employ
this attack by evaluating the k-nearest neighbor users of each
victim1 and selecting the most rated items in the neighbor
in order to fill IS . This attack is a modified version of the
bandwagon or popular attack [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ]. While the bandwagon
attack sets high ratings on the popular items of the system; the
proposed attack sets high ratings on the popular items inside
the victim’s neighborhood in order in order to inject profiles
capable to influence more the victim-s recommendations.
We executed experiments with diferent size of injected profiles,
which are classified in small-size attacks by averaging results of
attacks with 2, 10, 20, 50 shilling profiles and large-size attacks by
averaging attacks with 200 and 500 injected profiles.
2.1.2 CF Models. In our evaluation, we compared the
vulnerability/robustness of the following CF models:
User-kNN [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]: user-based k-nearest-neighbor (kNN) method. In
our experiments, we set the number of neighbors k to 20 [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ].
Item-kNN [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ]: item-based kNN method. Also in this case, the
number of neighbors k has been set equal to 20.
1experiment setting: k = 50, similarity metric = cosine similarity.
      </p>
      <p>
        BPR-SLIM [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]: Sparse LInear Method (SLIM) is an item-item
model that models the estimation of unknown user-item rating
as a regression problem. It learns a sparse aggregation coeficient
matrix from aggregated users’ preferences. This model allows the
system to capture correlations between items. BPR-SLIM uses the
BPR optimization criterion.2
BPR-MF [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ]: This method uses matrix factorization (MF) as its
underlying core predictor and optimizes it with Bayesian Personalized
Ranking (BPR) objective function.
      </p>
      <p>
        These CF models stand for state-of-the-art models for the item
recommendation task, each using a diferent prediction concept,
allowing us to study the impact of diferent attack strategies from
multiple viewpoints.
2.1.3 User Classes. Given that CF models only rely on user
preference scores (i.e., ratings) to compute recommendation, we
hypothesize that it is relevant to investigate the impact of diferent attack
strategies with respect to the victim user’s level of activity, i.e. the
richness of her profile, calculated on the basis of the number of
ratings available in her profile. To this aim, we define two classes
of users:
• Highly-active (HA) users are defined as users who have
a number of ratings greater than the second quartile of the
number of ratings for each user in the dataset.
• Slightly-active (SA) users are defined as users who have
a number of ratings lower than the second quartile.
2.1.4 Evaluation Metric. Several metrics have already been
proposed to evaluate malicious attacks. For example, [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] proposes the
prediction shift (PS) which estimates the success of an attack by
measuring the prediction diference before and after the attack [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ].
It has been identified that a strong PS does not necessarily implies
an efective attack result [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. From the perspective of the attacker,
the ideal goal in a push attack is to increase the chance of a
desired item being recommended after the attack than before. We
use a modified version of Hit-Ratio [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] to measure the fraction of
successful attacks on a set of diferent user-item pairs.
      </p>
      <p>Definition 1. Let u be the user under attack and i be the targeted
item that the attacker wants to push/appear in the top-k
recommendations of u. Let topuk be the top-k recommendations of u. Let ϕ(i, topuk )
be the function to evaluate the efectiveness on an attack on (u, i).
If i is pushed in the top-k then ϕ(i, topuk ) = 1 (successful attack),
otherwise ϕ(i, topuk ) = 0 (unsuccessful attack). Let S be the set of
(u, i) user-item pairs under attack. H R@k is defined as the fraction
of successful attacks on each (u, i) ∈ S.</p>
      <p>Í(u,i)∈S ϕ(i, topuk )
|S |
where |S | is the number of (u, i) pairs over which H R@k is measured.</p>
    </sec>
    <sec id="sec-4">
      <title>2.2 Data Descriptions</title>
      <p>
        We conducted experiments on two well-known datasets,
MovieLens 1M [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] and Yelp [
        <xref ref-type="bibr" rid="ref13 ref14">13, 14</xref>
        ]. The datasets represent diferent item
2The computation of the CF comparative models has been done with the publicly
available software library MyMediaLite http://www.mymedialite.net/. We used default
parameters for both BPR-MF and BPR-SLIM.
recommendation scenarios for movie and business domains and
have data densities which are approximately 40 times diferent from
each other. Table 1 summarizes the statistics of the two datasets
(after pre-processing).
MovieLens-1M: We used a million-sized version of the dataset
ML-1M, which contain 1M ratings of users for items (movies). We
used the original ML-1M dataset for the experiments without any
ifltering.
      </p>
      <p>
        Yelp: This dataset contains ratings of users on businesses. We used
the pre-processed version of the dataset provided by [
        <xref ref-type="bibr" rid="ref13 ref14">13, 14</xref>
        ] with
731K ratings of 25K users for 25K businesses. Given the large size
of users and items from which item-item or user-similarities have
to be computed, similar to [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] we extracted a random sample of
5K users and 5K items in order to speed up the experiments. The
resulted dataset contains 24.8K ratings with data density (0.110%),
which is comparable with the one before filtering (0.093%).
      </p>
    </sec>
    <sec id="sec-5">
      <title>3 Results and Discussion</title>
      <p>In order to validate the empirical impact of the under study attack
types on diferent classes of users , an extensive set of experiments
has been carried out with respect to the dimensions introduced in
Section 2.1. The final results are presented in Table 2 and discussed
from the following viewpoints:
• A global analysis of the impact of attacks on user classes (cf.</p>
      <p>Section 3.1)
• A fine-grained analysis of the impact of attacks on user
classes by looking into the CF models and attack types. (cf.</p>
      <p>Section 3.2)
We present each of these analysis viewpoints in the following
subsections.</p>
    </sec>
    <sec id="sec-6">
      <title>3.1 Global impact of attacks on user classes</title>
      <p>
        The goal of this analysis is to answer the first research question
related to the global assessment on the efectiveness of user-item
attack with respect to the identified users classes. We use the term
global here, since in this analysis we would like to free our attention
from the impact of attacks on CF models, attack quality (type)
and/or quantity as they have been largely addressed in previous
works [
        <xref ref-type="bibr" rid="ref11 ref21 ref22">11, 21, 22</xref>
        ]. Instead, we examine the impact of attacks on
the dimension of user classes by looking into the aggregate mean
values computed across CF models on the two datasets we adopted
in our experimental evaluation.
      </p>
      <p>
        A general observation for the results in Table 2 is that larger-size
attacks reach higher level of efectiveness on both classes of users
(highly-active and slightly-active) in comparison with smaller-size
attacks. For example, on the Yelp dataset, the average HR@10 for
UNA attack on highly-active users (across CF models) is 0.256 for
small-size attacks, while it is 0.800 for large-size attacks, a diference
of approximately three times. The same pattern of results is obtained
in other experimental cases. These results are in line with those
presented in previous works [
        <xref ref-type="bibr" rid="ref21 ref22">21, 22</xref>
        ].
      </p>
      <p>Our objective here is to study the impact of diferent attack
strategies on user classes. For this purpose, we define the variable
r = H RH A and refer to it as user-class attack impact —i.e., the</p>
      <p>H RSA
impact of an attack on highly-active users in comparison with
slightly-active users. Diferent values for r are interpreted as in the
following:
• r = 1: the attack has an equal impact on highly-active and
slightly-active users.
• r &gt; 1: the attack has an unequal impact on highly-active w.r.t
slightly-active users. The impact of attack on highly-active
users is relatively higher in comparison with slightly-active
users.3
• r &lt; 1: the attack has an unequal impact on highly-active v.s.
slightly-active users. The impact of attack on slightly-active
users is relatively higher in comparison with highly-active
users.</p>
      <p>It is obvious that the larger r deviates from the center point 1, the
larger is the attack success in diferentiating highly-active with
respect to slightly-active users in one of the above-mentioned
directions (r &lt; 1 or r &gt; 1). Before starting a deeper analysis of the
results we highlight that the most interesting values are in the
left portion of Table 2 (small-size attacks), because when the size
of attack is larger the attack reaches the maximum efectiveness,
H R = 1, independently of user classes.</p>
      <p>By looking at the results for each attack size in Table 2, we can
see that the average user-class impact r¯ has a value higher than 1 for
the Yelp dataset (r¯ &gt; 1), while a value lower than 1 for the ML-1M
dataset (r¯ &lt; 1). These results show that both attack types have an
unequal impact on slightly-active vs highly-active users as r , 1.
However, the class of users they have a larger impact on remains
largely diferent and contrasting in the two datasets .</p>
      <p>As an example, in Yelp and for UMA, one can note that for
smallsize attack r¯ = 2.393 and for large-size attack r¯ = 1.832, while
the corresponding values on ML-1M are r¯ = 0.658 and r¯ = 0.909,
respectively. This means that the impact of attacks on user classes is
higher on highly-active users on the Yelp dataset (r¯&gt;1), diferently
from ML-1M (r¯&lt;1).</p>
      <p>We conjecture that the above contrasting behaviors are directly
linked with the characteristics of the datasets such as their sparsity.
As shown in Table 1, Yelp dataset is approximately 40 times sparser
than ML-1M and we consider this diference as the main/possible
cause of the contrasting outcomes in tested datasets. We try to
provide a possible explanation here. In the more sparse dataset (i.e.,
the Yelp dataset), users with a small number of ratings
(slightlyactive users) are more immune to attacks because they have a smaller
support size of the user profile (i.e., the user profile is not rich
enough for the attacker to be able to mimic it in a crafted way).
In contrast, highly-active users are more immune to attack in
ML1M with higher density, because their recommendations rely on
neighbors with (very) rich user profiles. Put it simply, the crafted
3This is equal to say, slightly-active users are relatively more immune to the attack
w.r.t. highly-active users.
attacks need to use a large number of profiles to be able to alter
recommendation for the target user.</p>
      <p>The insight on sparsity is an important indication that data
characteristics are playing a role in the efectiveness of attacks and
it motivates further research in this direction.</p>
    </sec>
    <sec id="sec-7">
      <title>3.2 Fine-grained analysis of the impact of attacks on user classes</title>
      <p>The goal of this analysis is to study how diferent CF models
behave against the attacks: which ones have similar performance
and which ones have a diferent performance. This study resembles
previous work on shilling attacks on CF models. However, we take
into account the impact of attack on user classes in this study as
well.</p>
      <p>Instead of individual CF models performances and attack types,
we compute the pairwise Pearson correlation between each pair
of analyzed CF models. Figure 1 indicates a strong correlation on
HR@10 between BPR-SLIM and Item-kNN (ρ = 0.960 in Figure 1a
and ρ = 0.993 in Figure 1b). We justify this value by the fact
that both CF models exploit the item-item similarity computation.
Looking at the correlation values for User-kNN in Figure 1, one can
observe a slightly lower correlation in the case of
slightly-activeusers with respect to other models. We think that this phenomenon
comes from the fact that tested attack are based on user preferences
which gain good efect also with small-size attacks. For instance,
HR@10 for Yelp on slightly-active users (0.750 and 0.850) is higher
than the mean values with other models for both attack (mean =
0.288 and 0.440). We can also observe an interesting behavior when
we compare ρ of BPR-MF with BPR-SLIM and Item-kNN. Figure 1
(a) and (b) show that HR@10 on both classes of attacked users
is highly correlated (ρ ≥ 0.840). Finally, results in Table 2 show
that BPR-MF is the model that is less influenced by user-classes
because the user-impact factor is close to 1 for each class of users
and attacks.</p>
    </sec>
    <sec id="sec-8">
      <title>4 Conclusion and Future Work</title>
      <p>This work investigates the efect of user-item attacks on classes
of users. Particularly, we investigated the efectiveness of attacks
from a global and local perspective by varying the quality and
quantity of attacks, the target user class and the collaborative filtering
recommendation model.</p>
      <p>
        Experimental results on Yelp and MovieLens datasets indicate
that for Yelp dataset slightly-active users are more immune to
shilling attacks than highly-active users, a characteristic that is in
contrast with the results on MovieLens dataset where highly-active
users are more immune than slightly-active users. As datasets have
a very diferent sparsity (Yelp is approximately 40 time more sparse
than MovieLens) we will move our future works in analyzing the
efectiveness of dataset properties under diferent attack scenarios.
From a local perspective, we evidence that BPR-MF is less
influenced than other models when varying user-class and attack types.
On the other hand, BPR-SLIM and Item-kNN have shown similar
behavior related to the efect of attacks on user classes. In future,
we also plan to extend our study by considering more datasets from
diferent domains, exploring in an extensive way the influence of
dataset properties, such as sparsity, user and item skewness, rating
variance, on the efectiveness of diferent type of attacks. Also, it
is of our interest to consider the impact of various shilling attack
types on CF models using item content as side information [
        <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
        ].
      </p>
      <p>These studies give important insights on the impact of shilling
attacks on recommender systems and provide clues on how to
reduce their efectiveness by working on datasets characteristics.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Gediminas</given-names>
            <surname>Adomavicius</surname>
          </string-name>
          and
          <string-name>
            <given-names>Jingjing</given-names>
            <surname>Zhang</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Improving Stability of Recommender Systems: A Meta-Algorithmic Approach</article-title>
          .
          <source>IEEE Trans. Knowl. Data Eng</source>
          .
          <volume>27</volume>
          ,
          <issue>6</issue>
          (
          <year>2015</year>
          ),
          <fpage>1573</fpage>
          -
          <lpage>1587</lpage>
          . https://doi.org/10.1109/TKDE.
          <year>2014</year>
          .2384502
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Charu</surname>
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Aggarwal</surname>
          </string-name>
          .
          <year>2016</year>
          . Recommender Systems - The Textbook. Springer. https://doi.org/10.1007/978-3-
          <fpage>319</fpage>
          -29659-3
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Xavier</given-names>
            <surname>Amatriain</surname>
          </string-name>
          and
          <string-name>
            <given-names>Justin</given-names>
            <surname>Basilico</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Recommender Systems in Industry: A Netflix Case Study</article-title>
          .
          <source>In Recommender Systems Handbook</source>
          , Francesco Ricci, Lior Rokach, and Bracha Shapira (Eds.). Springer,
          <fpage>385</fpage>
          -
          <lpage>419</lpage>
          . https://doi.org/10.1007/ 978-1-
          <fpage>4899</fpage>
          -7637-6_
          <fpage>11</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Runa</given-names>
            <surname>Bhaumik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Chad</given-names>
            <surname>Williams</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Bamshad</given-names>
            <surname>Mobasher</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Robin</given-names>
            <surname>Burke</surname>
          </string-name>
          .
          <year>2006</year>
          .
          <article-title>Securing collaborative filtering against malicious attacks through anomaly detection</article-title>
          .
          <source>In Proceedings of the 4th Workshop on Intelligent Techniques for Web Personalization (ITWP'06)</source>
          , Boston, Vol.
          <volume>6</volume>
          . 10.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>John</surname>
            <given-names>S. Breese</given-names>
          </string-name>
          , David Heckerman, and Carl Myers Kadie.
          <year>1998</year>
          .
          <article-title>Empirical Analysis of Predictive Algorithms for Collaborative Filtering</article-title>
          .
          <source>In UAI '98: Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence</source>
          , University of Wisconsin Business School, Madison, Wisconsin, USA, July
          <volume>24</volume>
          -
          <issue>26</issue>
          ,
          <year>1998</year>
          .
          <fpage>43</fpage>
          -
          <lpage>52</lpage>
          . https://dslpitt.org/uai/displayArticleDetails.jsp?
          <source>mmnu=1&amp;smnu=2&amp;article_ id=231&amp;proceeding_id=14</source>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Robin</given-names>
            <surname>Burke</surname>
          </string-name>
          , Bamshad Mobasher, Roman Zabicki, and
          <string-name>
            <given-names>Runa</given-names>
            <surname>Bhaumik</surname>
          </string-name>
          .
          <year>2005</year>
          .
          <article-title>Identifying attack models for secure recommendation</article-title>
          .
          <source>Beyond Personalization</source>
          <year>2005</year>
          (
          <year>2005</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Zunping</given-names>
            <surname>Cheng and Neil Hurley</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>Robust Collaborative Recommendation by Least Trimmed Squares Matrix Factorization</article-title>
          .
          <source>In 22nd IEEE International Conference on Tools with Artificial Intelligence</source>
          ,
          <source>ICTAI</source>
          <year>2010</year>
          , Arras, France,
          <fpage>27</fpage>
          -
          <lpage>29</lpage>
          October 2010 - Volume
          <volume>2</volume>
          .
          <fpage>105</fpage>
          -
          <lpage>112</lpage>
          . https://doi.org/10.1109/ICTAI.
          <year>2010</year>
          .90
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Paul-Alexandru</surname>
            <given-names>Chirita</given-names>
          </string-name>
          , Wolfgang Nejdl, and
          <string-name>
            <given-names>Cristian</given-names>
            <surname>Zamfir</surname>
          </string-name>
          .
          <year>2005</year>
          .
          <article-title>Preventing shilling attacks in online recommender systems</article-title>
          .
          <source>In Seventh ACM International Workshop on Web Information and Data Management (WIDM</source>
          <year>2005</year>
          ), Bremen, Germany, November 4,
          <year>2005</year>
          .
          <fpage>67</fpage>
          -
          <lpage>74</lpage>
          . https://doi.org/10.1145/1097047.1097061
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Yashar</given-names>
            <surname>Deldjoo</surname>
          </string-name>
          , Maurizio Ferrari Dacrema, Mihai Gabriel Constantin, Hamid Eghbal-zadeh, Stefano Cereda, Markus Schedl, Bogdan Ionescu, and
          <string-name>
            <given-names>Paolo</given-names>
            <surname>Cremonesi</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Movie genome: alleviating new item cold start in movie recommendation</article-title>
          .
          <source>User Model. User-Adapt. Interact</source>
          .
          <volume>29</volume>
          ,
          <issue>2</issue>
          (
          <year>2019</year>
          ),
          <fpage>291</fpage>
          -
          <lpage>343</lpage>
          . https: //doi.org/10.1007/s11257-019-09221-y
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Yashar</surname>
            <given-names>Deldjoo</given-names>
          </string-name>
          , Markus Schedl, Paolo Cremonesi, and
          <string-name>
            <given-names>Gabriella</given-names>
            <surname>Pasi</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Content-Based Multimedia Recommendation Systems: Definition and Application Domains</article-title>
          .
          <source>In Proceedings of the 9th Italian Information Retrieval Workshop</source>
          , Rome, Italy, May,
          <fpage>28</fpage>
          -
          <lpage>30</lpage>
          ,
          <year>2018</year>
          . http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2140</volume>
          /paper15.pdf
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Ihsan</surname>
            <given-names>Gunes</given-names>
          </string-name>
          , Cihan Kaleli, Alper Bilge, and
          <string-name>
            <given-names>Huseyin</given-names>
            <surname>Polat</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Shilling attacks against recommender systems: a comprehensive survey</article-title>
          .
          <source>Artif. Intell. Rev</source>
          .
          <volume>42</volume>
          ,
          <issue>4</issue>
          (
          <year>2014</year>
          ),
          <fpage>767</fpage>
          -
          <lpage>799</lpage>
          . https://doi.org/10.1007/s10462-012-9364-9
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>F.</given-names>
            <surname>Maxwell</surname>
          </string-name>
          Harper and
          <string-name>
            <given-names>Joseph A.</given-names>
            <surname>Konstan</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>The MovieLens Datasets: History and Context</article-title>
          .
          <source>TiiS 5</source>
          ,
          <issue>4</issue>
          (
          <year>2016</year>
          ),
          <volume>19</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>19</lpage>
          :
          <fpage>19</fpage>
          . https://doi.org/10.1145/2827872
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Xiangnan</surname>
            <given-names>He</given-names>
          </string-name>
          , Zhankui He,
          <string-name>
            <surname>Xiaoyu Du</surname>
          </string-name>
          , and
          <string-name>
            <surname>Tat-Seng Chua</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Adversarial Personalized Ranking for Recommendation</article-title>
          .
          <source>In The 41st International ACM SIGIR Conference on Research &amp; Development in Information Retrieval</source>
          ,
          <string-name>
            <surname>SIGIR</surname>
          </string-name>
          <year>2018</year>
          , Ann Arbor, MI, USA, July
          <volume>08</volume>
          -
          <issue>12</issue>
          ,
          <year>2018</year>
          .
          <fpage>355</fpage>
          -
          <lpage>364</lpage>
          . https://doi.org/10.1145/3209978.3209981
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Xiangnan</surname>
            <given-names>He</given-names>
          </string-name>
          , Hanwang Zhang,
          <string-name>
            <surname>Min-Yen Kan</surname>
          </string-name>
          , and
          <string-name>
            <surname>Tat-Seng Chua</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Fast Matrix Factorization for Online Recommendation with Implicit Feedback</article-title>
          .
          <source>In Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval</source>
          ,
          <string-name>
            <surname>SIGIR</surname>
          </string-name>
          <year>2016</year>
          , Pisa, Italy,
          <source>July 17-21</source>
          ,
          <year>2016</year>
          .
          <fpage>549</fpage>
          -
          <lpage>558</lpage>
          . https://doi.org/10.1145/2911451.2911489
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Shyong</surname>
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Lam and John Riedl</surname>
          </string-name>
          .
          <year>2004</year>
          .
          <article-title>Shilling recommender systems for fun and profit</article-title>
          .
          <source>In Proceedings of the 13th international conference on World Wide Web, WWW</source>
          <year>2004</year>
          , New York, NY, USA, May
          <volume>17</volume>
          -20,
          <year>2004</year>
          .
          <fpage>393</fpage>
          -
          <lpage>402</lpage>
          . https://doi.org/10. 1145/988672.988726
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Greg</surname>
            <given-names>Linden</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Brent</given-names>
            <surname>Smith</surname>
          </string-name>
          , and Jeremy York.
          <year>2003</year>
          .
          <article-title>Industry Report: Amazon.com Recommendations: Item-to-Item Collaborative Filtering</article-title>
          .
          <source>IEEE Distributed Systems Online</source>
          <volume>4</volume>
          ,
          <issue>1</issue>
          (
          <year>2003</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>Bhaskar</given-names>
            <surname>Mehta</surname>
          </string-name>
          and
          <string-name>
            <given-names>Wolfgang</given-names>
            <surname>Nejdl</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>Attack resistant collaborative filtering</article-title>
          .
          <source>In Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <string-name>
            <surname>SIGIR</surname>
          </string-name>
          <year>2008</year>
          , Singapore,
          <source>July 20-24</source>
          ,
          <year>2008</year>
          .
          <fpage>75</fpage>
          -
          <lpage>82</lpage>
          . https://doi.org/10.1145/1390334.1390350
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>Bhaskar</given-names>
            <surname>Mehta</surname>
          </string-name>
          and
          <string-name>
            <given-names>Wolfgang</given-names>
            <surname>Nejdl</surname>
          </string-name>
          .
          <year>2009</year>
          .
          <article-title>Unsupervised strategies for shilling detection and robust collaborative filtering</article-title>
          .
          <source>User Model. User-Adapt. Interact</source>
          .
          <volume>19</volume>
          ,
          <issue>1</issue>
          -
          <fpage>2</fpage>
          (
          <year>2009</year>
          ),
          <fpage>65</fpage>
          -
          <lpage>97</lpage>
          . https://doi.org/10.1007/s11257-008-9050-4
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Bamshad</surname>
            <given-names>Mobasher</given-names>
          </string-name>
          , Robin Burke, Runa Bhaumik, and
          <string-name>
            <given-names>Chad</given-names>
            <surname>Williams</surname>
          </string-name>
          .
          <year>2005</year>
          .
          <article-title>Efective attack models for shilling item-based collaborative filtering systems</article-title>
          . Citeseer.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Bamshad</surname>
            <given-names>Mobasher</given-names>
          </string-name>
          , Robin Burke, and
          <string-name>
            <surname>Jef</surname>
          </string-name>
          J Sandvig.
          <year>2006</year>
          .
          <article-title>Model-based collaborative filtering as a defense against profile injection attacks</article-title>
          .
          <source>In AAAI</source>
          , Vol.
          <volume>6</volume>
          . 1388.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Bamshad</surname>
            <given-names>Mobasher</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Robin D.</given-names>
            <surname>Burke</surname>
          </string-name>
          , Runa Bhaumik, and
          <string-name>
            <given-names>Jef J.</given-names>
            <surname>Sandvig</surname>
          </string-name>
          .
          <year>2007</year>
          .
          <article-title>Attacks and Remedies in Collaborative Recommendation</article-title>
          .
          <source>IEEE Intelligent Systems</source>
          <volume>22</volume>
          ,
          <issue>3</issue>
          (
          <year>2007</year>
          ),
          <fpage>56</fpage>
          -
          <lpage>63</lpage>
          . https://doi.org/10.1109/MIS.
          <year>2007</year>
          .45
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Bamshad</surname>
            <given-names>Mobasher</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Robin D.</given-names>
            <surname>Burke</surname>
          </string-name>
          , Runa Bhaumik, and
          <string-name>
            <given-names>Chad</given-names>
            <surname>Williams</surname>
          </string-name>
          .
          <year>2007</year>
          .
          <article-title>Toward trustworthy recommender systems: An analysis of attack models and algorithm robustness</article-title>
          .
          <source>ACM Trans. Internet Techn. 7</source>
          ,
          <issue>4</issue>
          (
          <year>2007</year>
          ),
          <volume>23</volume>
          . https://doi.org/ 10.1145/1278366.1278372
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>Xia</given-names>
            <surname>Ning</surname>
          </string-name>
          and
          <string-name>
            <given-names>George</given-names>
            <surname>Karypis</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>SLIM: Sparse Linear Methods for Top-N Recommender Systems</article-title>
          .
          <source>In 11th IEEE International Conference on Data Mining, ICDM</source>
          <year>2011</year>
          , Vancouver, BC, Canada,
          <source>December 11-14</source>
          ,
          <year>2011</year>
          .
          <fpage>497</fpage>
          -
          <lpage>506</lpage>
          . https://doi. org/10.1109/ICDM.
          <year>2011</year>
          .134
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <surname>Michael P. O'Mahony</surname>
            ,
            <given-names>Neil J.</given-names>
          </string-name>
          <string-name>
            <surname>Hurley</surname>
          </string-name>
          , Nicholas Kushmerick, and
          <string-name>
            <surname>Guenole C. M. Silvestre</surname>
          </string-name>
          .
          <year>2004</year>
          .
          <article-title>Collaborative recommendation: A robustness analysis</article-title>
          .
          <source>ACM Trans. Internet Techn. 4</source>
          ,
          <issue>4</issue>
          (
          <year>2004</year>
          ),
          <fpage>344</fpage>
          -
          <lpage>377</lpage>
          . https://doi.org/10.1145/1031114.1031116
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <surname>Michael P. O'Mahony</surname>
            ,
            <given-names>Neil J.</given-names>
          </string-name>
          <string-name>
            <surname>Hurley</surname>
          </string-name>
          , and
          <string-name>
            <surname>Guenole C. M. Silvestre</surname>
          </string-name>
          .
          <year>2005</year>
          .
          <article-title>Recommender Systems: Attack Types and Strategies</article-title>
          .
          <source>In Proceedings, The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, July 9-13</source>
          ,
          <year>2005</year>
          , Pittsburgh, Pennsylvania, USA.
          <fpage>334</fpage>
          -
          <lpage>339</lpage>
          . http://www.aaai.org/Library/AAAI/
          <year>2005</year>
          /aaai05-
          <fpage>053</fpage>
          .php
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <surname>Stefen</surname>
            <given-names>Rendle</given-names>
          </string-name>
          , Christoph Freudenthaler, Zeno Gantner, and Lars SchmidtThieme.
          <year>2009</year>
          .
          <article-title>BPR: Bayesian Personalized Ranking from Implicit Feedback</article-title>
          .
          <source>In UAI 2009, Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence</source>
          , Montreal, QC, Canada, June 18-21,
          <year>2009</year>
          .
          <fpage>452</fpage>
          -
          <lpage>461</lpage>
          . https://dslpitt.org/uai/displayArticleDetails.jsp?
          <source>mmnu=1&amp;smnu=2&amp;article_ id=1630&amp;proceeding_id=25</source>
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>Badrul</given-names>
            <surname>Munir</surname>
          </string-name>
          <string-name>
            <given-names>Sarwar</given-names>
            , George Karypis, Joseph A.
            <surname>Konstan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and John</given-names>
            <surname>Riedl</surname>
          </string-name>
          .
          <year>2001</year>
          .
          <article-title>Item-based collaborative filtering recommendation algorithms</article-title>
          .
          <source>In Proceedings of the Tenth International World Wide Web Conference, WWW 10</source>
          ,
          <string-name>
            <surname>Hong</surname>
            <given-names>Kong</given-names>
          </string-name>
          , China, May 1-
          <issue>5</issue>
          ,
          <year>2001</year>
          .
          <fpage>285</fpage>
          -
          <lpage>295</lpage>
          . https://doi.org/10.1145/371920.372071
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <surname>Yue</surname>
            <given-names>Shi</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Martha</given-names>
            <surname>Larson</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Alan</given-names>
            <surname>Hanjalic</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Collaborative filtering beyond the user-item matrix: A survey of the state of the art and future challenges</article-title>
          .
          <source>ACM Computing Surveys (CSUR) 47</source>
          ,
          <issue>1</issue>
          (
          <year>2014</year>
          ),
          <fpage>3</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>Zhihai</given-names>
            <surname>Yang</surname>
          </string-name>
          and
          <string-name>
            <given-names>Zhongmin</given-names>
            <surname>Cai</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Detecting abnormal profiles in collaborative filtering recommender systems</article-title>
          .
          <source>J. Intell. Inf. Syst</source>
          .
          <volume>48</volume>
          ,
          <issue>3</issue>
          (
          <year>2017</year>
          ),
          <fpage>499</fpage>
          -
          <lpage>518</lpage>
          . https://doi.org/10.1007/s10844-016-0424-5
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <surname>Mi</surname>
            <given-names>Zhang</given-names>
          </string-name>
          , Jie Tang, Xuchen Zhang, and
          <string-name>
            <given-names>Xiangyang</given-names>
            <surname>Xue</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Addressing cold start in recommender systems: A semi-supervised co-training algorithm</article-title>
          .
          <source>In Proceedings of the 37th international ACM SIGIR conference on Research &amp; development in information retrieval. ACM</source>
          ,
          <volume>73</volume>
          -
          <fpage>82</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>