<!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>September</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Personality in Computational Advertising: A Benchmark</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Giorgio Roffo</string-name>
          <email>Giorgio.Roffo@univr.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alessandro Vinciarelli</string-name>
          <email>Alessandro.Vinciarelli@glasgow.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Glasgow, School of Computing Science</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Verona, Department of Computer Science</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2016</year>
      </pub-date>
      <volume>16</volume>
      <issue>2016</issue>
      <abstract>
        <p>In the last decade, new ways of shopping online have increased the possibility of buying products and services more easily and faster than ever. In this new context, personality is a key determinant in the decision making of the consumer when shopping. A person's buying choices are influenced by psychological factors like impulsiveness; indeed some consumers may be more susceptible to making impulse purchases than others. Since affective metadata are more closely related to the user's experience than generic parameters, accurate predictions reveal important aspects of user's attitudes, social life, including attitude of others and social identity. This work proposes a highly innovative research that uses a personality perspective to determine the unique associations among the consumer's buying tendency and advert recommendations. In fact, the lack of a publicly available benchmark for computational advertising do not allow both the exploration of this intriguing research direction and the evaluation of recent algorithms. We present the ADS Dataset, a publicly available benchmark consisting of 300 real advertisements (i.e., Rich Media Ads, Image Ads, Text Ads) rated by 120 unacquainted individuals, enriched with Big-Five users' personality factors and 1,200 personal users' pictures.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>
        Nowadays, online shopping plays an increasingly significant role
in our daily lives [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Most consumers shop online with the
majority of these shoppers preferring to shop online for reasons like
saving time and avoiding crowds. Marketing campaigns can create
awareness that drive consumers all the way through the process to
actually making a purchase online [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. Accordingly, a challenging
problem is to provide the user with a list of recommended
advertisements they might prefer, or predict how much they might prefer
the content of each advert.
      </p>
      <p>
        Past studies on recommender systems take into account
information like user preferences (e.g., user’s past behavior, ratings, etc.),
or demographic information (e.g., gender, age, etc.), or item
characteristics (e.g., price, category, etc.). For example, collaborative
filtering approaches first build a model from a user’s past
behavior (e.g., items previously purchased and/or ratings given to those
items), then use that model to predict items (or ratings for items)
that the user may have an interest in by considering the opinions
of other like-minded users. Other information (e.g., contexts, tags
and social information) have also taken into account in the design
of recommender systems [
        <xref ref-type="bibr" rid="ref18 ref20 ref5">5, 18, 20</xref>
        ].
      </p>
      <p>
        The impact of personality factors on advertisements has been
studied at the level of social sciences and microeconomics [
        <xref ref-type="bibr" rid="ref2 ref35 ref9">2, 9,
35</xref>
        ]. Recently, personality-based recommender systems are
increasingly attracting the attention of researchers and industry
practitioners [
        <xref ref-type="bibr" rid="ref15 ref33 ref6">6, 15, 33</xref>
        ]. Personality is the latent construct that accounts for
“individuals characteristic patterns of thought, emotion, and
behavior together with the psychological mechanisms - hidden or not
- behind those patterns" [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Hence, personality is a critical factor
which influences people’s behavior and interests. Attitudes,
perceptions and motivations are not directly apparent from clicks on
advertisements or online purchases, but they are an important part
of the success or failure of online marketing strategies. A person’s
buying choices are further influenced by psychological factors like
impulsiveness (e.g., leads to impulse buying behaviors), openness
(e.g., which reflects the degree of intellectual curiosity, creativity
and a preference for novelty and variety a person has), neuroticism
(i.e., sensitive/nervous vs. secure/confident), or extraversion (i.e.,
outgoing/energetic vs. solitary/reserved) which affect their
motivations and attitudes [
        <xref ref-type="bibr" rid="ref35">35</xref>
        ].
      </p>
      <p>
        To the best of our knowledge, the impact of personality factors
on advertisements has been largely neglected at the level of
advert recommendation. There is a high potential that
incorporating users’ characteristics into recommender systems could enhance
recommendation quality and user experience. For example, given a
user’s preference for some items, it is possible to compute the
probability that they are of the same personality type as other users, and,
in turn, the probability that they will like new items [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ].
      </p>
      <p>
        Moreover, personality has shown to play an important role also
in other aspects of recommender systems, such as implicit
feedback, contextual information [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ], affective content labeling [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ].
With the development of novel techniques for the unobtrusive
acquisition of personality (e.g. from social media [
        <xref ref-type="bibr" rid="ref28 ref29 ref7">7, 28, 29</xref>
        ]) this
study is meant to contribute to this emerging domain proposing
a new corpus which includes questionnaires of the Big-Five
(BFI10) personality model [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ], as well as, users’ liked/disliked pictures
that convey much information about the users’ attitudes [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>
        The ADS Dataset is a highly innovative collection of 300 real
advertisements rated by 120 participants and enriched with the users’
five broad personality dimensions, which have been shown to
capture most individual differences [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. The user study is conducted by
recruiting a set of test subjects, and asking them to perform several
tasks. The subjects included in the corpus were recruited through
a public platform purely dedicated to recruiting participants. The
process was stopped once the first 120 individuals answered
positively. The experimental protocol adopted for the data collection
has been designed to capture users’ preferences in a controlled
usage scenario (see Section 2.1 for further details).
      </p>
      <p>
        In this work we carry out prediction experiments performing two
different tasks: ad rating prediction or ad click prediction, with
the goal in mind to analyze the effect of using personality data
for recommending ads. Therefore, we propose Logistic
Regression (LR) [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], Support Vector Regression with radial basis function
(SVR-rbf) [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], and L2-regularized L2-loss Support Vector
Regression (L2-SVR) [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] as baseline systems for recommendation. We
then review a large set of properties, and explain how to evaluate
systems given relevant properties. We also survey a large set of
evaluation metrics in the context of the property that they evaluate,
and provide a library within one integrated toolbox.
      </p>
      <p>Summarizing, the contribution of this work is two-fold:
Dataset: we collect and introduce a representative benchmark
for computational advertising enriched with affective-like metadata
such as personality factors. The benchmark allows to (i) explore
the relationship between consumer characteristics, attitude toward
online shopping and advert recommendation, (ii) identify the
underlying dimensions of consumer shopping motivations and
attitudes toward online in-store conversions, and (iii) have a
reference benchmark for comparison of state-of-the-art advertisement
recommender systems (ARSs). To the best of our knowledge, the
ADS dataset is the first attempt at providing a set of advertisements
scored by the users according to their interest into the content.</p>
      <p>Code library: we present two broad classes of prediction
accuracy measures, depending on the task the recommender system
is performing: “ad rating prediction” or “ad click prediction”, and
provide a code library, integrating the evaluation metrics with
uniform input and output formats to facilitate large scale performance
evaluation. The code library and the annotated dataset are available
on the project page1.</p>
      <p>The rest of the paper is organized as follows: in Section 2 we
present and describe the ADS Dataset. We perform a corpus
analysis investigating on the linkages between buying habits,
recommendations, and personality. In Section 3, we survey a large set of
evaluation metrics in the context of the property that ARSs
evaluate. In Section 4 we conduct experiments for each scenario taken
into account in this work, investigating on the strengths and
weakness of using personality data as features for recommendation.
Finally, in Section 5 conclusions are given, and future perspectives
are envisaged.</p>
    </sec>
    <sec id="sec-2">
      <title>CORPUS ANALYSIS</title>
      <p>The corpus includes 300 advertisements voted by unacquainted
individuals (120 subjects in total. Note, the data collection
process is still running). Adverts equally cover three display formats:
Rich Media Ads, Image Ads, Text Ads (i.e., 100 ads for each
for1http://giorgioroffo.it/?ADSdataset
mat). Participants rated (from 1-star to 5-stars) each recommended
advertisement according to if they would or would not click on it
(some examples are shown in the Fig.1). We labeled adverts as
“clicked” (rating greater or equal to four), otherwise “not clicked”
(rating less than four). The distribution of the ratings across the
adverts that were scored by the users turns out to be unbalanced
(4,841 clicked vs 31,159 unclicked).</p>
      <p>Advert content is categorized in terms of 20 main product/service
categories. For each one of the categories 15 real adverts are
provided. Table 1 reports the full list of the categories used with the
associated class annotations and the percentage of clicks received.
At the category level, the distribution of the ratings results to be
balanced (1,229 clicked vs 1,171 unclicked), where a category is
considered to be clicked whenever it contains at least one clicked
advert.</p>
      <p>
        Inspired from recent findings which investigate the effects of
personality traits on online impulse buying [
        <xref ref-type="bibr" rid="ref2 ref35 ref9">2, 9, 35</xref>
        ], and many other
approaches based upon behavioral economics, lifestyle analysis,
and merchandising effects [
        <xref ref-type="bibr" rid="ref19 ref2">2, 19</xref>
        ], the proposed dataset supports a
trait theory approach to study the effect of personality on user’s
motivations and attitudes toward online in-store conversions. The trait
approach was selected because it encourages the use of
scientifically sound scale construction methods for developing reliable and
valid measures of individual differences. As a result, the corpus
includes the Big Five Inventory-10 to measure personality traits [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ],
the five factors have been defined as openness to experience,
conscientiousness, extraversion, agreeableness, and neuroticism, often
listed under the acronyms OCEAN.
      </p>
      <p>
        Recent soft-biometric approaches have shown the ability to
unobtrusive acquire these traits from social media [
        <xref ref-type="bibr" rid="ref28 ref29">28, 29</xref>
        ], or infer the
personality types of users from visual cues extracted from their
favorite pictures [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] from a social signal processing perspective [
        <xref ref-type="bibr" rid="ref36">36</xref>
        ].
While not necessarily corresponding to the actual traits of an
individual, attributed traits are still important because they are
predictive of important aspects of social life, including attitude of others
and social identity.
      </p>
      <p>As a result, the proposed benchmark includes 1,200 spontaneously
uploaded images that hold a lot of meaning for the participants and
their related annotations: positive/negative (see Table 2 for further
details). The images are personal (i.e., family, friends etc.) or just
images participants really like/dislike. The motivations for
labeling a picture as favorite are multiple and include social and
affective aspects like, e.g., positive memories related to the content and
bonds with the people that have posted the picture. Moreover, they
are provided with a set of TAGS describing the content of each of
them.</p>
      <p>Finally, many other users’ preference information are provided.
Table 2 lists the raw data provided with the dataset, such as users’
past behavior selected from a pre-defined list (e.g., watches movies,
listen songs, read books, travel destinations, etc.), demographic
information (like age, nationality, gender, etc.). Note, all data is
anonymized (i.e., name, surname, private email, etc.), ensuring the
privacy of all participants.</p>
      <p>For further analyses related to the adverts’ quality, this
benchmark also provides the entire set of 300 rated advertisements (500
x 500 pixels) in PNG format.
2.1</p>
    </sec>
    <sec id="sec-3">
      <title>Participant Recruitment</title>
      <p>The subjects involved in the data collection, performed all the
steps of the following protocol:</p>
      <p>- Step 1: All participants have filled in a form providing,
anonymously, several information about their preferences (e.g.,
demographic information, personal preferences).</p>
      <p>
        - Step 2: All participants have filled the Big Five Inventory-10 to
measure personality traits [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ].
      </p>
      <p>- Step 3: The participants voted each advert according with if
they would or not click on the recommended ad. Ads have been
displayed in the same order to all the participants.</p>
      <p>- Step 4: The participants submitted some images that they like
(Positives) and some others that disgust or repulse them
(Negatives). Once they have uploaded their images, they also added some
TAGS that describe the content of each image.
2.2</p>
    </sec>
    <sec id="sec-4">
      <title>The Subjects</title>
      <p>This corpus involves 120 English native speakers between 18
and 68. The median of the participants age is 28 ( =31.7, =12.1).
Most of the participants have a university education. In terms of
gender, 77 are females and 43 males. The percentage distribution
of household income within the sample is: 23% less or equal to
11K USD per year, 48% from 11K to 50K USD, 21% from 50K
to 85K USD, and 8% more than 85K USD. The median income is
between 11K and 50K USD.</p>
      <p>In analyzing this complex data, one can observe that users’
preferences are not independent of each other, they are likely to be
co-expressed. Hence, it is of great significance to study groups of
preferences rather than to perform a single analysis. This fact is
A
A
N
0
E
0
E
O</p>
      <p>C
C
A
A
5
3.8
2.5
1.3
5
3.8
2.5
1.3
O</p>
      <p>
        C
C
5
3.8
2.5
1.3
5
3.8
2.5
1.3
(Cluster 1 - M: 50%, F:50%)
(Cluster 2 - M: 35.7%, F:64.3%)
(Cluster 3 - M: 100%, F:0%)
(Cluster 4 - M: 0%, F:100%)
(Cluster 5 - M: 0%, F:100%)
(Cluster 6 - M: 11.1%, F:88.9%)
(Cluster 7 - M: 75%, F:25%)
(Cluster 8 - M: 0%, F:100%)
also true for personality factors, analyzing subsets of data yields
crucial information about patterns inside the data. Thus, clustering
users’ preferences can provide insights into personality of
individuals which share the same preferences. We performed a statistical
analysis of personality and users’ preferences, linking the 5
personality factors and the most favorite users’ product categories (i.e.,
most clicked) by means of the affinity propagation (AP) clustering
algorithm [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
      <p>AP is an algorithm that takes as input measures of similarity
between pairs of data points and simultaneously considers all data
points as potential exemplars. We calculated a similarity input
matrix between each individual ui considering as feature vectors vi a
binary sequence of click/no-click (i.e., vi is 1 300). AP exchanges
real-valued messages between data points until a high-quality set of
exemplars and corresponding clusters gradually emerges. Hence,
the number of clusters is automatically detected, and when applied
on ADS data, AP grouped the data into 8 different clusters.</p>
      <p>Figure 2 illustrates 8 spider-diagrams, one for each cluster. Each
diagram shows the average of the big-five factors regarding the
subjects within the group (reported in figure as O-C-E-A-N).</p>
      <p>Then, we ranked the most clicked categories according with
samples within the group in order to compare these two variables by
means of correlation obtaining interesting clues.</p>
      <p>For instance, let us consider the cluster number 6 where 88.9%
of the members are females, and 11.1% males and the average of
the group members age is 28. The first 5 most clicked categories
are Baby, followed by Consumer Electronics, Stationery &amp; Office
Supplies, Home, and Jewelery &amp; Watches. This group is
characterized by high neuroticism (see the diagram in Figure 2.(Cluster 6)),
those who score high in neuroticism are often emotionally reactive
and vulnerable to stress, high neuroticism causes a reactive and
excitable personality, often very dynamic individuals. This group also
share the highest levels of extroversion, high extraversion is often
perceived as attention-seeking, and domineering.</p>
      <p>Cluster 5 shows a subset of individuals which scores low for all
the types (see the plot in Figure 2.(Cluster 5)). For instance, those
with low openness seek to gain fulfillment through perseverance,
and are characterized as pragmatic sometimes even perceived to
be dogmatic. Some disagreement remains about how to interpret
and contextualize the openness factor. The first 5 most clicked
categories are Clothing &amp; Shoes, Health &amp; Beauty, Jewelery &amp;
Watches, Outdoor Living, and then Consumer Electronics. In this
case the average of the group members age is 68, and the cluster
contains 100% females.</p>
      <p>Cluster 7 is characterized by good levels of conscientiousness
that is the tendency to be organized and dependable, aim for
achievement, and prefer planned rather than spontaneous behavior. This
cluster scores low in agreeableness, which is related to
personalities often competitive or challenging people. The openness
factor (&gt;2.5) reflects the degree of intellectual curiosity, creativity and
a preference for novelty and variety a person has. Interestingly,
among the most preferred categories there are Console &amp; Video
Games, Consumer Electronics, Grocery and Computer Software.</p>
    </sec>
    <sec id="sec-5">
      <title>EVALUATION METHODOLOGY</title>
      <p>Research in the ARS field requires quality measures and
evaluation metrics to know the quality of the techniques, methods, and
algorithms for predictions and recommendations. In this section
we review the process of evaluating an ARS on two main tasks:
(i) measuring the accuracy of rating predictions, and (ii) measuring
the accuracy of click predictions.</p>
      <p>In most online advertising platforms the allocation of ads is
dynamic, tailored to user interests based on their observed feedback.
In this first scenario, we want to predict the feedback a user would
give to an advert (e.g. 1-star through 5-stars). In such a case, we
want to measure the accuracy of the system’s predicted ratings.</p>
      <sec id="sec-5-1">
        <title>Root Mean Squared Error (RMSE) is perhaps the most popu</title>
        <p>lar metric used in evaluating the accuracy of predicted ratings. The
system generates predicted ratings r^u;a for a test set T of
useradvert pairs (u,a) for which the true ratings ru;a are known. The
RMSE between the predicted and actual ratings is given by:</p>
        <p>Mean square error (MSE) is an alternative version of RMSE,
the main difference between these two estimators is that RMSE
penalizes more large errors, and MSE has the same units of
measurement as the square of the quantity being estimated, while RMSE
has the same units as the quantity being estimated. Therefore, MSE
is given by</p>
        <p>Mean Absolute Error (MAE) is a popular alternative, given by
M SE =
M AE =
1</p>
        <p>X
jT j (u;a)2T
s 1</p>
        <p>X
jT j (u;a)2T
(r^u;a</p>
        <p>ru;a)2:
jr^u;a
ru;aj:
As the name suggests, the MAE is an average of the absolute errors
erru;a = jr^u;a ru;aj, where r^u;a is the prediction and ru;a the
true value. The MAE is on same scale of data being measured.
3.2</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Scenario 2: Ad Click Prediction</title>
      <p>In many applications the recommendation system tries to
recommend adverts to users in which they may be interested. For
example, when items are added to the queue, Amazon suggests a
set of adverts on which the user would most probably click. In this
case, we are not interested in whether the system properly predicts
the ratings of these adverts but rather whether the system properly
predicts that the user will click on them (e.g. they perform a
conversion). Therefore, we then have four possible outcomes for a
recommended advertisement, as shown in Table 4.</p>
      <p>Clicked
Not clicked</p>
      <p>Recommended
True-Positive (tp)
False-Positive (fp)</p>
      <p>Not recommended
False-Negative (fn)
True-Negative (tn)</p>
      <p>We can count the number of examples that fall into each cell in
the table and compute the following quantities:
where true negative rate is also called Specificity. We can expect
a trade-off between these quantities; while allowing longer
recommendation lists typically improves recall, it is also likely to reduce
the precision. We can compute curves comparing precision to
recall, or true positive rate to false positive rate. Curves of the former
type are known simply as precision-recall curves, while those of
the latter type are known as a Receiver Operating Characteristic
or ROC curves. A widely used measurement that summarizes the</p>
      <sec id="sec-6-1">
        <title>ROC curve is the Area Under the ROC Curve (AUC) [1] which</title>
        <p>is useful for comparing algorithms independently of application.</p>
        <p>
          When evaluating precision-recall (or ROC curves) for multiple
test users, a number of strategies can be employed in aggregating
the results, depending on the application at hand. The usual
manner in which precision-recall curves are computed in the
information retrieval community [
          <xref ref-type="bibr" rid="ref13 ref27 ref31 ref32">13, 27, 31, 32</xref>
          ] is to average the
resulting curves over users. Such a curve can be used to understand the
trade-off between precision and recall (or false positives and false
negatives) a typical user would face.
4.
        </p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>EXPERIMENTS AND RESULTS</title>
      <p>In this section we show results obtained for the two types of
scenarios introduced in Sec. 3. We conduct prediction experiments to
explore the strengths and weakness of using personality traits as
features for recommendation.
4.1</p>
    </sec>
    <sec id="sec-8">
      <title>Evaluated Algorithms</title>
      <p>
        Since a prediction engine lies at the basis of the most
recommender systems, we selected some of the most widely used
techniques for recommendations and predictions [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], such as Logistic
Regression (LR) [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], Support Vector Regression with radial basis
function (SVR-rbf) [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], and L2-regularized L2-loss Support Vector
Regression (L2-SVR) [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. These methods have often been based
on a set of sparse binary features converted from the original
categorical features via one-hot encoding [
        <xref ref-type="bibr" rid="ref17 ref26">17, 26</xref>
        ]. These engines may
predict user opinions to adverts (e.g., a user’s positive or negative
feedback to an ad) or the probability that a user clicks or performs
a conversion (e.g., an in-store purchase) when they see an ad. In
Section 4, we evaluate these methods while feeding them with and
without features coming from the psychometric traits.
4.2
      </p>
    </sec>
    <sec id="sec-9">
      <title>Experimental Protocol</title>
      <p>Let us say X = fx1; :::; xN g is the set of observations, where
the vectors xi correspond to features coming only from the group
“users’ preferences” as described in Table 2 and N = 120 stands
for the number of users involved in the experiment.</p>
      <p>A feature is the user’s selection from a pre-defined list of choices,
hence, for each feature vector one element is 1 and the others are
0. Then, each column vector xi is obtained by stacking the features
on top of one another.</p>
      <p>Regression is performed over the 20 product categories. The
prediction problem is solved using LR, L2-SVR, and SVR-rbf, while
feeding them with and without features coming from “personality
traits”. All experiments were performed using a k-fold approach (k
= 10). In k-fold cross-validation, X is randomly partitioned into
k’s equal sized subsamples (the folds are the maintained the same
for each algorithm in comparison). Of the k subsamples, a single
subsample is retained as the validation data for testing the model,
and the remaining k - 1 subsamples are used as training data. The
cross-validation process is then repeated k times, with each of the
k subsamples used only once as the validation data. The k results
from the folds can then be averaged to produce a single estimation.</p>
      <p>
        Our experimental protocol includes feature selection, which
represents an important pre-processing step given the sparse nature of
the input data. It allows to remove many redundant features by
reducing the dimensionality of the problem at hand. Hence, the
representation above serves as a basis for the feature ranking and
selection strategy. Ranking features allow us to detect a subset of
cues which is not redundant. Accordingly, we use the training data
obtained after the split as input of the infinite feature selection
(InfFS) [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ] algorithm. By construction, the Inf-FS is a graph-based
method which exploits the convergence properties of the power
series of matrices to evaluate the relevance of a feature with respect
to all the other ones taken together. Indeed, in the Inf-FS
formulation, each feature is mapped on an affinity graph, where nodes
represent features, and weighted edges the relationships between
them. In particular, the graph is weighted according to a function
which takes into account both correlations and standard deviations
between feature distributions. Each path of a certain length l over
the graph is seen as a possible selection of features. Therefore,
varying these paths and letting them tend to an infinite number
permits the investigation of the importance of each possible subset of
features.
      </p>
      <p>Finally, the Inf-FS assigns a score to each feature of the initial
set; where the score is related to how much the given feature is a
good candidate regarding the regression task. Therefore, ranking
the outcome of the Inf-FS in descendant order allows us to perform
the subset feature selection throughout a model selection stage. In
this way, we reduce the amount of features, by selecting 75% of the
total. The selected features are: the number of favorite websites,
T.V. programmes, sports, past times, the most watched movies and
most visited websites, where we add the big-five personality traits.
4.3</p>
    </sec>
    <sec id="sec-10">
      <title>Exp. 1: Ad Rating Prediction</title>
      <p>
        In this section we report results for rating prediction showing
that traces of user’s personality can improve the prediction
performance of the evaluated methods significantly. Statistical evaluation
of experimental results has been considered an essential part of
val1
0.9
0.8
idation of machine learning methods. Given the user ui, labels are
assigned to each category by averaging the votes they gave to the
category items such as ui = fy1; :::; y20g; y 2 [
        <xref ref-type="bibr" rid="ref15">1 5</xref>
        ].
      </p>
      <p>Figure 3 illustrates prediction results in term of RMSE, MSE
and MAE plots across the categories. This first analysis shows how
personality traits affect prediction performance. In order to assess
if the difference in performance is statistically significant, t-tests
have been used for comparing the accuracies. This statistical test
is used to determine if the accuracies obtained with and without
B5 are significantly different from each other (whereas both the
distribution of values were normal). The test for assessing whether
the data come from normal distributions with unknown, but equal,
variances is the Lilliefors test.</p>
      <p>Results show a statistical significant effect of personality traits
while using L2-SVR (p-value &lt; 0.05, Lilliefors Test H=0) and LR
(p-value &lt; 0.01, Lilliefors Test H=0).</p>
      <p>As for the SVR-rbf, even if improvements in terms of prediction
are not significant (B5 against no-B5), it is still interesting to
notice the performance loss on categories 6 and 8, where errors go
high significantly. In such a case, the B5 features do not seem to
have much predictive power, however, they seem to play the role
of a reliable stabilizer, but also that of an independent mediator and
supporter of the regression process.
4.4</p>
    </sec>
    <sec id="sec-11">
      <title>Exp. 2: Ad Click Prediction</title>
      <p>This section shows an offline evaluation of click prediction. Along
the lines of the previous experiment, a k-fold cross-validation is
used. The experiment is performed at the category level, in order to</p>
      <p>In this paper, we conducted a within-subject user study to
investigate on the relations between users’ personality related to their
buying behavior and preferred item categories. A deeper analysis
may involve the use of bi-clustering methods. Comparing to
traditional clustering methods biclustering is not a blackbox technique.
Comprehensibility is one of its main advantages, i.e. it is possible
to understand why objects ended up in the same cluster.</p>
      <p>
        It is worth noting that the goal of these experiments is to show
how personality traits affect the prediction. In order to improve
prediction accuracy, specific feature designing processes are needed so
as to represent personality data and to standardize their definitions
to be used as input recommender data towards to improve
recommendations. In our experiments, we used a set of sparse binary
features converted from the original categorical features.
Moreover, many other algorithms may be used for this tasks, like the one
proposed in [
        <xref ref-type="bibr" rid="ref15 ref24 ref6">6, 15, 24</xref>
        ].
      </p>
      <p>
        For instance, the personality diagnosis [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] system is a
collaborative filtering algorithm, which can be thought of as a hybrid
between existing memory- and model-based algorithms. PD is fairly
straightforward, maintains all data, and does not require a
compilation step to incorporate new data. It is based on a simple and
reasonable probabilistic model of how people rate titles.
      </p>
      <p>Most of these recommender systems use to split each test user
profile into sets of observed items and hidden items. The former
is used as input for each recommender, the latter for performance
evaluation. In our experiments, we did not use any information
about the previous users’ clicks, which turns out to be a more
difficult task. We decided on this solution to move the focus of attention
on personality data and not on other features like previous clicked
ads.
5.</p>
    </sec>
    <sec id="sec-12">
      <title>CONCLUDING REMARKS</title>
      <p>In this paper, we presented the ADS Dataset, a collection of 300
real advertisements rated by 120 unacquainted participants. We
conducted a within-subject user study to investigate potential user
issues of the personality on their buying behavior and preferred
item categories.</p>
      <p>The corpus has been collected with the main goal of studying
the possible achievable benefits of employing personality traits in
modern recommender systems. To obtain stronger and more
relevant results for this community, appropriate and high-level features
needed to be designed that carry important information for
inference. In this paper, we only use raw data as sparse binary features
converted from the original categorical features. We used standard
techniques for recommending ads in order to show how personality
traits affect the prediction, and, at the same time, set a baseline for
future work.</p>
      <p>We then reviewed a large set of properties, and explain how to
evaluate systems given relevant properties. We discuss how to
compare ARS based on a set of properties that are relevant for the
application. Therefore, we review two main types of experiments in
an offline setting, where recommendation approaches are compared
with different selections of features (i.e., with and without
personality traits) accordingly with our goal. We also discuss how to draw
trustworthy conclusions from the conducted experiments.</p>
      <p>Future work includes, but is not necessarily limited to, (1)
feature engineering and designing for ARSs, represent personality data
and standardize their definitions to be used as input recommender
data towards to improve recommendations; (2) inference of
personality traits and novel approaches for mapping pictures tagged as
favorite into personality traits; and (3) identification of the
underlying dimensions of consumer shopping motivations and personality
factors.</p>
      <p>We hope that this work motivates researchers to take into
account the use of personality factors as an integral part of their future
work, since there is a high potential that incorporating these kind
of users’ characteristics into ARS could enhance recommendation
quality and user experience.
6.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>D.</given-names>
            <surname>Bamber</surname>
          </string-name>
          .
          <article-title>The area above the ordinal dominance graph and the area below the receiver operating characteristic graph</article-title>
          .
          <source>Journal of Mathematical Psychology</source>
          ,
          <year>1975</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Bosnjak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Galesic</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Tuten</surname>
          </string-name>
          .
          <article-title>Personality determinants of online shopping: Explaining online purchase intentions using a hierarchical approach</article-title>
          .
          <source>Journal of Business Research</source>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>C.-C.</given-names>
            <surname>Chang</surname>
          </string-name>
          and
          <string-name>
            <given-names>C.-J.</given-names>
            <surname>Lin</surname>
          </string-name>
          .
          <article-title>Libsvm: A library for support vector machines</article-title>
          .
          <source>ACM Trans. Intell. Syst. Technol.</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J. V.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <surname>B. chiuan Su</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A. E.</given-names>
            <surname>Widjaja</surname>
          </string-name>
          .
          <article-title>Facebook c2c social commerce: A study of online impulse buying</article-title>
          .
          <source>Decision Support Systems</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>K.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Yoo</surname>
          </string-name>
          , G. Kim, and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Suh</surname>
          </string-name>
          .
          <article-title>A hybrid online-product recommendation system: Combining implicit rating-based collaborative filtering and sequential pattern analysis</article-title>
          .
          <source>Electronic Commerce Research and Applications</source>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>D.</given-names>
            <surname>Cosley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. K.</given-names>
            <surname>Lam</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Albert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Konstan</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Riedl</surname>
          </string-name>
          .
          <article-title>Is seeing believing?: How recommender system interfaces affect users' opinions</article-title>
          .
          <source>In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems. ACM</source>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M.</given-names>
            <surname>Cristani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Vinciarelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Segalin</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Perina</surname>
          </string-name>
          .
          <article-title>Unveiling the multimedia unconscious: Implicit cognitive processes and multimedia content analysis</article-title>
          .
          <source>In Proceedings of the 21st ACM international conference on Multimedia</source>
          , pages
          <fpage>213</fpage>
          -
          <lpage>222</lpage>
          . ACM,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>R.-E.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.-W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.-J. Hsieh</surname>
            ,
            <given-names>X.-R.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
            , and
            <given-names>C.-J.</given-names>
          </string-name>
          <string-name>
            <surname>Lin</surname>
          </string-name>
          .
          <article-title>LIBLINEAR: A library for large linear classification</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>B. M.</given-names>
            <surname>Fennis</surname>
          </string-name>
          and
          <string-name>
            <given-names>A. T.</given-names>
            <surname>Pruyn</surname>
          </string-name>
          .
          <article-title>You are what you wear: Brand personality influences on consumer impression formation</article-title>
          .
          <source>Journal of Business Research</source>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Forrester</surname>
          </string-name>
          .
          <article-title>Online retail industry in the us will be worth $279 billion in 2015</article-title>
          . TechCrunch, February
          <volume>28</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>B. J.</given-names>
            <surname>Frey</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.</given-names>
            <surname>Dueck</surname>
          </string-name>
          .
          <article-title>Clustering by passing messages between data points</article-title>
          .
          <source>Science</source>
          ,
          <volume>315</volume>
          :
          <fpage>972</fpage>
          -
          <lpage>976</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>D.</given-names>
            <surname>Funder</surname>
          </string-name>
          . Personality.
          <source>Annual Reviews of Psychology</source>
          ,
          <volume>52</volume>
          :
          <fpage>197</fpage>
          -
          <lpage>221</lpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>D.</given-names>
            <surname>Harman</surname>
          </string-name>
          .
          <article-title>Overview of the trec 2002 novelty track</article-title>
          .
          <source>In Text REtrieval Conference (TREC</source>
          <year>2002</year>
          ),
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>X.</given-names>
            <surname>He</surname>
          </string-name>
          . et al.
          <article-title>practical lessons from predicting clicks on ads at facebook</article-title>
          .
          <source>In Data Mining for Online Advertising</source>
          , New York, NY, USA,
          <year>2014</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>R.</given-names>
            <surname>Hu</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Pu</surname>
          </string-name>
          .
          <article-title>A Study on User Perception of Personality-Based Recommender Systems</article-title>
          . In a. u. l. De,
          <string-name>
            <surname>Bra</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Kobsa</surname>
          </string-name>
          , and D. Chin, editors,
          <source>User Modeling, Adaptation, and Personalization</source>
          , volume
          <volume>6075</volume>
          of Lecture Notes in Computer Science. Springer Berlin / Heidelberg, Berlin, Heidelberg,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>C.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kwon</surname>
          </string-name>
          , and
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          .
          <article-title>How to measure the effectiveness of online advertising in online marketplaces</article-title>
          .
          <source>Expert Syst. Appl.</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>K</surname>
          </string-name>
          .
          <article-title>-c.</article-title>
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Orten</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Dasdan</surname>
            , and
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
          </string-name>
          .
          <article-title>Estimating conversion rate in display advertising from past erformance data</article-title>
          .
          <source>In Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</source>
          , New York, NY, USA,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>S. K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y. H.</given-names>
            <surname>Cho</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S. H.</given-names>
            <surname>Kim</surname>
          </string-name>
          .
          <article-title>Collaborative filtering with ordinal scale-based implicit ratings for mobile music recommendations</article-title>
          .
          <source>Information Sciences</source>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>J. C.</given-names>
            <surname>Mowen</surname>
          </string-name>
          .
          <article-title>The 3M Model of Motivation and Personality: Theory and Empirical Applications to Consumer Behavior</article-title>
          . Springer US, Boston, MA,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>N. nez</given-names>
            <surname>Valdéz</surname>
          </string-name>
          . et al.
          <article-title>implicit feedback techniques on recommender systems applied to electronic books</article-title>
          .
          <source>Comput. Hum. Behav</source>
          .,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>A.</given-names>
            <surname>Odic</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. Tkalcˇicˇ</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Košir</surname>
            , and
            <given-names>J. F.</given-names>
          </string-name>
          <string-name>
            <surname>Tasicˇ</surname>
          </string-name>
          . A.:
          <article-title>Relevant context in a movie recommender system: UsersâA˘ Z´ opinion vs. statistical detection</article-title>
          .
          <source>In In: Proc. of the 4th Workshop on Context-Aware Recommender Systems</source>
          (
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>D. L.</given-names>
            <surname>Olson</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.</given-names>
            <surname>Delen</surname>
          </string-name>
          .
          <source>Advanced Data Mining Techniques. Springer Publishing Company, Incorporated, 1st edition</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>A. C. P.</surname>
          </string-name>
          and
          <string-name>
            <surname>V. M. S.</surname>
          </string-name>
          <article-title>Click through rate prediction for display advertisement</article-title>
          .
          <source>International Journal of Computer Applications</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <surname>D. M. Pennock</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Horvitz</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Lawrence</surname>
            , and
            <given-names>C. L.</given-names>
          </string-name>
          <string-name>
            <surname>Giles</surname>
          </string-name>
          .
          <article-title>Collaborative filtering by personality diagnosis: A hybrid memory- and model-based approach</article-title>
          .
          <source>In Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence, UAI'00</source>
          , pages
          <fpage>473</fpage>
          -
          <lpage>480</lpage>
          , San Francisco, CA, USA,
          <year>2000</year>
          . Morgan Kaufmann Publishers Inc.
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>B.</given-names>
            <surname>Rammstedt</surname>
          </string-name>
          and
          <string-name>
            <surname>O. P. John.</surname>
          </string-name>
          <article-title>Measuring personality in one minute or less: A 10-item short version of the Big Five Inventory in English and German</article-title>
          . Journal of Research in Personality,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>M.</given-names>
            <surname>Richardson</surname>
          </string-name>
          .
          <article-title>Predicting clicks: Estimating the click-through rate for new ads</article-title>
          .
          <source>In International World Wide Web Conference</source>
          . ACM Press,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>G.</given-names>
            <surname>Roffo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Cristani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Bazzani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. Q.</given-names>
            <surname>Minh</surname>
          </string-name>
          , and
          <string-name>
            <given-names>V.</given-names>
            <surname>Murino</surname>
          </string-name>
          .
          <article-title>Trusting skype: Learning the way people chat for fast user recognition and verification</article-title>
          .
          <source>In Computer Vision Workshops (ICCVW)</source>
          ,
          <year>2013</year>
          IEEE International Conference on, pages
          <fpage>748</fpage>
          -
          <lpage>754</lpage>
          ,
          <year>Dec 2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>G.</given-names>
            <surname>Roffo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Giorgetta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ferrario</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Cristani</surname>
          </string-name>
          .
          <article-title>Just the Way You Chat: Linking Personality, Style and</article-title>
          Recognizability in Chats, pages
          <fpage>30</fpage>
          -
          <lpage>41</lpage>
          . Springer International Publishing,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>G.</given-names>
            <surname>Roffo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Giorgetta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ferrario</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Riviera</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Cristani</surname>
          </string-name>
          .
          <article-title>Statistical analysis of personality and identity in chats using a keylogging platform</article-title>
          .
          <source>In International Conference on Multimodal Interaction. ACM</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>G.</given-names>
            <surname>Roffo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Melzi</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Cristani</surname>
          </string-name>
          .
          <article-title>Infinite feature selection</article-title>
          .
          <source>In IEEE International Conference on Computer Vision</source>
          (ICCV),
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <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>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Riedl</surname>
          </string-name>
          .
          <article-title>Analysis of recommendation algorithms for e-commerce</article-title>
          .
          <source>In ACM Conference on Electronic Commerce. ACM</source>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>A. I.</given-names>
            <surname>Schein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Popescul</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. H.</given-names>
            <surname>Ungar</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D. M.</given-names>
            <surname>Pennock</surname>
          </string-name>
          .
          <article-title>Methods and metrics for cold-start recommendations</article-title>
          .
          <source>In International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <surname>M. Tkalcˇicˇ</surname>
          </string-name>
          , U. Burnik,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Košir</surname>
          </string-name>
          .
          <article-title>Using affective parameters in a content-based recommender system for images. User Modeling</article-title>
          and
          <string-name>
            <surname>User-Adapted</surname>
            <given-names>Interaction</given-names>
          </string-name>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <given-names>M.</given-names>
            <surname>Tkalcic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Odic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kosir</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Tasic</surname>
          </string-name>
          .
          <article-title>Affective labeling in a content-based recommender system for images</article-title>
          .
          <source>IEEE Transactions on Multimedia</source>
          ,
          <volume>15</volume>
          (
          <issue>2</issue>
          ):
          <fpage>391</fpage>
          -
          <lpage>400</lpage>
          ,
          <year>Feb 2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>C. A.</given-names>
            <surname>Turkyilmaz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Erdem</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Uslu</surname>
          </string-name>
          .
          <article-title>The effects of personality traits and website quality on online impulse buying</article-title>
          .
          <year>2015</year>
          . International Conference on Strategic Innovative Marketing.
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <given-names>A.</given-names>
            <surname>Vinciarelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pantic</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H.</given-names>
            <surname>Bourlard</surname>
          </string-name>
          .
          <article-title>Social signal processing: Survey of an emerging domain</article-title>
          .
          <source>Image and Vision Computing</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [37]
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Cui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Mao</surname>
          </string-name>
          .
          <article-title>Click-through rate estimation for rare events in online advertising</article-title>
          .
          <source>Online Multimedia Advertising: Techniques and Technologies</source>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>