<!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>Workshops,
Los Angeles, USA, March</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Recommending Web Advertisements based on Long-Short Term User Interest</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Panote Siriaraya</string-name>
          <email>spanote@gmail.com</email>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yoichi Inagaki</string-name>
          <email>inagaki@kizasi.jp</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yuriko Yamaguchi</string-name>
          <email>i1658164@cc.kyoto-su.ac.jp</email>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Reyn Nakamoto</string-name>
          <email>reyn@kizasi.jp</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Shinsuke Nakajima</string-name>
          <email>nakajima@cc.kyoto-su.ac.jp</email>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mimpei Morishita</string-name>
          <email>mimpei@kizasi.jp</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jianwei Zhang</string-name>
          <email>zhang@iwate-u.ac.jp</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Iwate University</institution>
          ,
          <addr-line>Iwate</addr-line>
          ,
          <country country="JP">Japan</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Kizasi Company, Inc</institution>
          ,
          <addr-line>Tokyo</addr-line>
          ,
          <country country="JP">Japan</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Kizasi Company, Inc.</institution>
          ,
          <addr-line>Tokyo</addr-line>
          ,
          <country country="JP">Japan</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Kyoto Sangyo University</institution>
          ,
          <addr-line>Kyoto</addr-line>
          ,
          <country country="JP">Japan</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2019</year>
      </pub-date>
      <volume>20</volume>
      <issue>2019</issue>
      <abstract>
        <p>This paper reports the results of a study carried out to develop a system to recommend web advertisements to users based on their latent interests in an online real time bidding environment. As part of this work, we describe an approach which could be used to help predict the latent interest of users by analyzing their long and short term interests based on a large dataset of user web browsing histories. The proposed approach was tested in an experiment study with 32 diferent websites. Overall, this approach, which separated the user browsing history into sections representing their long and short term interests resulted in significantly higher predictive performance than when a singular section of user browsing history was used to represent the overall interests of users. In addition, we examined the efect of using diferent category levels as features to represent long and short term interest.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>CCS CONCEPTS</title>
      <p>• Information systems → Content match advertising;
• Computing methodologies → Supervised learning by
classification .
IUI Workshops’19, March 20, 2019, Los Angeles, USA
© 2019 for the individual papers by the papers’ authors. Copying permitted
for private and academic purposes. This volume is published and
copyrighted by its editors.</p>
    </sec>
    <sec id="sec-2">
      <title>1 INTRODUCTION</title>
      <p>
        The introduction of Real-time bidding (RTB) to the online
advertising environment has enabled advertisers to bid for
advertisement space in real-time as soon as they become
available. Instead of having to negotiate and pre-purchase
ad display space from publishers in advance, advertisers are
able to decide how much they are willing to pay to market
their product to each audience based on real-time
information about their characteristics and potential interests. Such
a customized advertisement approach has allowed
companies to market products in a more precise and cost efective
manner [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. As such, it is not surprising that RTB has shown
considerable growth in recent years with a significant
number of advertisers have already adopted this system [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>In regards to the process used in the Real-time bidding, an
ad request call is generally triggered when a user first visits
a website with an ad content (the publisher site). This call is
triggered to the Supply side platform (a platform used by ad
publishers to manage their advertisement inventory) which
then sends a bid request to diferent demand side platforms
(platforms used by buyers of advertisements to manage and
optimize their ad purchases) connected to the system.
Information about the characteristics of users and the publisher
site (such as their IP address, geographic location etc) is also
generally provided to help the demand side platform decide
on the potential value of advertisement space. Afterwards,
each of the demand side platforms would submit a bid back
to the supply side platform indicating how much they would
be willing to pay for that particular advertisement space.
The supply side platform would then determine the
highest bidder and display the advertisement of the winner on
the publisher site. Overall, the key challenge for a demand
side platform system is therefore to determine which
advertisement opportunity would be worth purchasing for each
individual user based on their information which is provided
by the supply side platform. This necessitates the
development of automated systems able to predict user interest in
diferent advertisement contents in near real time.
2</p>
    </sec>
    <sec id="sec-3">
      <title>RELATED WORKS</title>
      <p>
        To date, various research studies have been carried out to
improve diferent aspects of the real-time bidding
ecosystem (see [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]). For example, research has been carried out
to enable advertisers to develop and deploy more efective
bidding strategies in such an environment. One study for
instance, has been carried out to develop an optimal
bidding strategy based on available campaign resources and
auction information [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] etc. Another study has looked to
develop methods to efectively estimate the winning price
of bid requests in a Real-time bidding process [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. In
addition, researchers have also explored topics such as detecting
and preventing fraud in Real-time bidding systems[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and
estimating the cost the advertisement provider pays for each
user based on the information they exposed [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
      </p>
      <p>Few studies however have focused on optimizing the
process of selecting and presenting advertisements so that they
would be appropriate for audiences based on their interests
in a RTB environment. Conventional systems, particularly in
industry, usually rely on techniques such as interest-match
advertising (matching advertisement related keywords with
user characteristics derived from analyzing user browsing
behavior to determine how well an advertisement fits with
a user) or re-targeting (target users who have previously
visited the website of the advertisers) to determine if an
advertisement is worth purchasing. A key disadvantage of
such techniques is that they only emphasize on the current
interests of users and thus, it is dificult for advertisers to
market to users who might have latent (but not apparent)
interest in their products.</p>
      <p>
        Therefore, the overall aim of our research is to develop
a system which could recommend advertisements to users
based on their latent interests. In our initial study, we have
discussed how a classification system could be used to
predict latent user interest by analyzing the browsing history
of the said user in comparison to the browsing history of
users who have and have not previously visited a targeted
website [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Furthermore, we have shown how the predictive
performance of this system could be further improved when
web categories instead of Fully Qualified Domain Names
are used as features [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. In this study, we predict latent user
interests based on the notion of long-short term interest, by
dividing the websites in the browsing history of users into
separate features based on whether they represent the short
or long term interests of the users. Two experiment studies
were carried out showing how this approach improves
predictive performance in comparison to the methods used in
our previous studies [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. An overview of our proposed
system is shown in Figure 1.
3
      </p>
    </sec>
    <sec id="sec-4">
      <title>EXPERIMENT 1: EXAMINING THE</title>
    </sec>
    <sec id="sec-5">
      <title>EFFECTIVENESS OF LONG-SHORT TERM</title>
    </sec>
    <sec id="sec-6">
      <title>INTEREST IN PREDICTING THE LATENT</title>
    </sec>
    <sec id="sec-7">
      <title>INTERESTS OF USERS</title>
      <p>
        In this paper, we describe an approach which aims to improve
the predictive performance of latent user interest based on
the concept of long and short term interest. The browsing
history of users was used to represent their potential interest
in diferent products and services which the advertisements
ofered. In our previous study, we found that using a longer
browsing history acquisition period (7 days vs 1 day etc.)
did not necessarily result in a better prediction of latent user
interests [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. This prompted us to hypothesize that perhaps
user interests could not be adequately represented using a
single section (one week or month etc.) of browsing history.
In reality, the objectives, goals and intentions of users would
lfuctuate and change as time passes. As such, we assumed
that the overall interests of the users might be better reflected
by separating short term and long term interests in the user
model and thus be able to more accurately predict latent
user interests. For example, users who have browsed
websites related to hiking in recent days, while having looked
at websites related to child rearing in the past month might
indicate their interests in family oriented tour providers (as
opposed to general tourism).
      </p>
      <p>
        To examine the efectiveness of using the long and short
term interests of users to predict their latent interests, an
experiment study was carried out using a large dataset of
user browsing history. Logistic regression was used to
predict whether a user might be interested in a given website
(which the user has never visited before) by analyzing their
web browsing history in comparison to the web browsing
history of users who have and have not previously visited
the aforementioned site. Only the website views from the
user browsing history was used in this study due to
limitations in the information available in our data set. Overall,
two diferent classifiers were constructed, one to represent
the new approach (the combined long-short term interest
classifier) and the other to represent our previous best
approach (the single browsing history period classifier) [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The
choice of Logistic regression in this study was mainly due to
practicality. Other approaches which we had experimented
with in our previous study (SVM etc.) had too large of a time
cost while not difering considerably in performance [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>
        In the single browsing history period classifier, we used
the 31 day browsing history of users (Aug 1-31) who have
previously accessed the targeted site as positive data and used
the 31 day browsing history of users who had not previously
visited the targeted site as negative data. For the combined
long-short term interest classifier, the web browsing history
of users who had accessed the targeted site in the short term
(during the previous one day) was used as positive data, while
the web browsing history of users who did not access the
target site during the short term period was used as negative
data (even if they had accessed the site during their long
term period). In this classifier, user interests were separated
into long term and short term interests. A 1 day segment of
browsing history (Aug 31) was used to represent short term
interest (as this was found to result in the best performance
when representing short term interest in our previous study
[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]) and a 30 day segment of browsing history (Aug 1-30)
was used to represent long term interest (30 days before the
start of the short term interest period). Overall, our data set
consisted of user access records of approximately 6.3 million
unique websites with an overall size of around 370 GBs.
      </p>
      <p>
        The categories of the websites within the user browsing
histories were used as predictors (i.e. features) in the
regression model (as our prior experiments had shown that
they resulted in superior performance than using
individual domain names). These were determined by analyzing
the word frequencies contained within the website (see([
        <xref ref-type="bibr" rid="ref3">3</xref>
        ])).
Three diferent levels of categories were obtained for each
site: large (such as "Fashion"), medium (such "Fashion
accessories") and small (such as "Jewelry"). The total number of
large, medium and small categories which were identified
in our study were 23, 274 and 837 respectively. A combined
category level was created by combining the large, medium
and small categories together (resulting in a feature vector
space of 1134, the combination of all three possible category
types). For example, the feature vector for a web browsing
history of a user who had visited a Jewelry store website
twice and a Fast food store website four times would be 2
for the categories "Fashion" (large category), "Fashion
accessories" (medium category) and "Jewelry" (small category), 4
for the categories "Groceries" (large category), "Restaurants"
(medium category) and "Fast food" (small categories) and 0
for all the other categories. This combined category level was
used as the input feature for both classifiers in this
experiment (as this best represents the overall characteristics of the
website, combining the features from all the categories). To
diferentiate the long term interest features from the short
term interest features in the classification process, a sufix
was added to the categories. For example, if a fashion
website was present in the long term browsing history, then the
"fashion_LT" category is used. If the website was present
in the short term browsing history, then the "fashion_ST"
category is adopted instead.
      </p>
      <p>In the experiment, both classifiers were tested against 32
diferent target websites based in Japan. These sites include:
• An information site of a professional baseball team
• A social gaming website
• A news website
• A point redemption website
• A website ofering tourism and living advice for a city
in Japan
• A beauty and fashion information website</p>
      <p>The browsing history data from users who had visited
the site and those who had not were used as positive and
negative training samples. The classifier was trained at a 1:1
sample ratio (The number depended on the number of
samples available in our dataset for each website, but generally
consisted of around 100 or 200 users). When training the
classifier for each target site, browsing history data from 100
users who had previously visited the aforementioned
website and 100 users who had not visited the website were used
as positive and negative samples. The number of samples
used in the test data were also selected to best represent the
real world conditions of the data (in most cases, there are
generally few positive samples when compared to negative
samples). Therefore, the test data consisted of approximately
50 to 100 positive samples not in the training data (the
exact number depending on the user data available for each
website) and 10,000 negative user samples (browsing history
of users who had not visited the website). The experiment
on each target site was repeated 10 times and the average
Area under the curve (AUC) value was used to measure the
performance of the classifier on each target site.</p>
      <p>
        Overall, the results showed that the combined long-short
term interest classifier outperformed the single browsing
history period classifier (our previous best approach [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]).
Figure 2 shows a comparison of the results. The long-short
term interest classifier outperformed the single browsing
history period classifier on 29 out of the 32 sites. Paired T-tests
which were carried out confirmed that average AUC value
for the 32 target sites of the combined long-short term
interest classifier (Mean=0.759, Min=0.602, Max= 0.889 SD=0.004)
was significantly higher than the single browsing history
period classifier (Mean=0.711, Min=0.572, Max=0.872 SD=0.004)
(p&lt;0.001). Websites which showed considerable
improvements in performance when using long-short term interest
include a car information (+0.10) and a travel website (+0.22).
Websites which showed worst performance include a point
redemption site (-0.04) and a game news site (-0.003).
4
      </p>
    </sec>
    <sec id="sec-8">
      <title>EXPERIMENT 2: EXAMINING THE EFFECT OF</title>
    </sec>
    <sec id="sec-9">
      <title>CATEGORY LEVELS IN LATENT INTEREST</title>
    </sec>
    <sec id="sec-10">
      <title>PREDICTION WHEN USING LONG-SHORT</title>
    </sec>
    <sec id="sec-11">
      <title>TERM INTEREST</title>
      <p>In the previous experiment, we had used the combined
category level as the features in our dataset. However, our prior
studies also show that diferent category levels could
influence classifier performance in predicting latent user interest.
As the combined category level contains a combination of
large, medium and small categories, it was not clear how
each category levels contributed to the predictive ability of
our long-short term interest classifier.</p>
      <p>Therefore, we carried out a further experiment study to
examine the predictive performance of using either large,
medium and short categories to represent long and short
term interest. The method used in this experiment was
similar to the previous study, in which 32 diferent target websites
were evaluated and a 1:1 sampling ratio was used to train
the classifier (the testing sample consisted of approximately
50 to 100 positive samples and 10,000 negative ones). A 30
day browsing history period was used to represent long term
interest and a 1 day browsing history period was used to
represent short term interest. In addition, similar to the
previous experiment, each target site was evaluated 10 times
and the average AUC value was used as a measure for
classiifer performance. This performance measure was used (as
opposed to other measures such as the F-score) due to the
low positive to negative sampling ratio of users who visited
each website.</p>
      <p>Figure 3 shows a comparison of the predictive results when
diferent category levels were used to represent long-term
interests for the first 8 websites. A Repeated Measures Anova
test showed that there was a significant diference in
performance between the category levels used to represent long
term interest (F(1.67, 51.96) = 24.50, p &lt; 0.001). Representing
long-term interest using the large category level resulted in
significantly better AUC score (Mean=0.758, SD=0.07) than
using medium categories (Mean=0.743, SD=0.07) (p&lt;0.01)
and small categories (Mean=0.732, SD=0.06) (p&lt;0.01) for
27 out of the 32 websites. Thus, for long-term interest, it
seems that large categories provide a better representation
of long-term interest than medium and small categories.
For short term interests, a Repeated Measures Anova also
showed that there was a significant diference in
performance when the diferent category levels were used (F(1.70,
52.75) = 13.78, p &lt; 0.001). On average, using small categories
to represent short term interest resulted in the best
performance (Mean=0.725, SD=0.06) when compared to using
medium (Mean=0.722, SD=0.06) (p&lt;0.01) and large categories
(Mean=0.707, SD=0.07) (p&lt;0.01) (see Figure 4).</p>
    </sec>
    <sec id="sec-12">
      <title>5 CONCLUSION</title>
      <p>In this paper, we discuss our work to develop a system which
could recommend advertisements to users based on their
latent interests in a RTB environment. In particular, we
describe an approach which utilizes a user’s long and short term
interest to predict their latent interest in a target website. We
outline the results of an experiment study, showing how this
approach results in better predictive performance than when
a single browsing history period is used to represent user
interests. In addition, we carried out further experimental
studies showing that using large category levels to represent
long term interest and small category levels to represent
short term interest resulted in the best performance. In our
future work, we would expand our method and experiment
with diferent classification algorithms (Random Forest,
xgboost) and diferent time-series approaches (RNN, LSTM) to
investigate their performance in predicting latent user
interest. In addition, we would further examine how additional
real-data usage data (ad click through rates etc.) and website
features could be used as features to improve advertisement
recommendation. Finally, we would experiment with
diferent time periods for short term (2-3 days) and long term
interest (45, 60 days etc.).</p>
    </sec>
    <sec id="sec-13">
      <title>ACKNOWLEDGMENT</title>
      <p>The work carried out in this paper is supported by the JSPS
KAKENHI research grant (Grants number 17H01822).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Han</given-names>
            <surname>Cai</surname>
          </string-name>
          , Kan Ren, Weinan Zhang, Kleanthis Malialis, Jun Wang,
          <string-name>
            <surname>Yong Yu</surname>
            , and
            <given-names>Defeng</given-names>
          </string-name>
          <string-name>
            <surname>Guo</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Real-Time Bidding by Reinforcement Learning in Display Advertising</article-title>
          .
          <source>In Proceedings of the Tenth ACM International Conference on Web Search and Data Mining. ACM</source>
          ,
          <volume>661</volume>
          -
          <fpage>670</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Brendan</given-names>
            <surname>Kitts</surname>
          </string-name>
          , Jing Ying Zhang, Gang Wu, Wesley Brandi, Julien Beasley, Kieran Morrill, John Ettedgui, Sid Siddhartha, Hong Yuan,
          <string-name>
            <given-names>Feng</given-names>
            <surname>Gao</surname>
          </string-name>
          , et al.
          <year>2015</year>
          .
          <article-title>Click fraud detection: adversarial pattern recognition over 5 years at Microsoft</article-title>
          .
          <source>In Real World Data Mining Applications</source>
          . Springer,
          <fpage>181</fpage>
          -
          <lpage>201</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Siriaraya</given-names>
            <surname>Panote</surname>
          </string-name>
          , Yuriko Yamaguchi, Mimpei Morishita, Youichi Inagaki, Reyn Nakamoto, Jianwei Zhang, Junichi Aoi, and
          <string-name>
            <given-names>Shinsuke</given-names>
            <surname>Nakajima</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Using categorized web browsing history to estimate the user's latent interests for web advertisement recommendation</article-title>
          .
          <source>In Workshop on Human-Machine Collaboration in BigData</source>
          ,
          <source>2017 IEEE International Conference on Big Data. IEEE.</source>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Panagiotis</given-names>
            <surname>Papadopoulos</surname>
          </string-name>
          , Pablo Rodriguez Rodriguez, Nicolas Kourtellis, and
          <string-name>
            <given-names>Nikolaos</given-names>
            <surname>Laoutaris</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>If you are not paying for it, you are the product: How much do advertisers pay to reach you?</article-title>
          .
          <source>In Proceedings of the 2017 Internet Measurement Conference. ACM</source>
          ,
          <volume>142</volume>
          -
          <fpage>156</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Yuriko</given-names>
            <surname>Yamaguchi</surname>
          </string-name>
          , Mimpei Morishita, Youichi Inagaki, Reyn Nakamoto, Jianwei Zhang, Junichi Aoi, and
          <string-name>
            <given-names>Shinsuke</given-names>
            <surname>Nakajima</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Web Advertising Recommender System Based on Estimating Users' Latent Interests</article-title>
          .
          <source>In Proceedings of the 18th International Conference on Information Integration and Web-based Applications and Services (iiWAS '16)</source>
          . ACM, New York, NY, USA,
          <fpage>42</fpage>
          -
          <lpage>49</lpage>
          . https://doi.org/10.1145/3011141.3011180
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Shuai</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Jun</given-names>
            <surname>Wang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Xiaoxue</given-names>
            <surname>Zhao</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Real-time bidding for online advertising: measurement and analysis</article-title>
          .
          <source>In Proceedings of the Seventh International Workshop on Data Mining for Online Advertising. ACM</source>
          ,
          <volume>3</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Yong</given-names>
            <surname>Yuan</surname>
          </string-name>
          , Feiyue Wang,
          <string-name>
            <given-names>Juanjuan</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and Rui</given-names>
            <surname>Qin</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>A survey on real time bidding advertising</article-title>
          .
          <source>In Service Operations and Logistics, and Informatics (SOLI)</source>
          ,
          <source>2014 IEEE International Conference on. IEEE</source>
          ,
          <fpage>418</fpage>
          -
          <lpage>423</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>W.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Shih</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Peng</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Huang</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>A gamma-based regression for winning price estimation in real-time bidding advertising</article-title>
          .
          <source>In 2017 IEEE International Conference on Big Data (Big Data)</source>
          .
          <fpage>1610</fpage>
          -
          <lpage>1619</lpage>
          . https://doi.org/10.1109/BigData.
          <year>2017</year>
          .8258095
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>