Matches in UGent Biblio for { <https://biblio.ugent.be/publication/1108124#aggregation> ?p ?o. }
Showing items 1 to 33 of
33
with 100 items per page.
- aggregation classification "P1".
- aggregation creator B107275.
- aggregation creator B107276.
- aggregation creator B107277.
- aggregation creator B107278.
- aggregation creator person.
- aggregation date "2010".
- aggregation format "application/pdf".
- aggregation hasFormat 1108124.bibtex.
- aggregation hasFormat 1108124.csv.
- aggregation hasFormat 1108124.dc.
- aggregation hasFormat 1108124.didl.
- aggregation hasFormat 1108124.doc.
- aggregation hasFormat 1108124.json.
- aggregation hasFormat 1108124.mets.
- aggregation hasFormat 1108124.mods.
- aggregation hasFormat 1108124.rdf.
- aggregation hasFormat 1108124.ris.
- aggregation hasFormat 1108124.txt.
- aggregation hasFormat 1108124.xls.
- aggregation hasFormat 1108124.yaml.
- aggregation isPartOf urn:isbn:9781424481262.
- aggregation language "eng".
- aggregation publisher "IEEE".
- aggregation rights "I have transferred the copyright for this publication to the publisher".
- aggregation subject "Mathematics and Statistics".
- aggregation title "Born to trade: a genetically evolved keyword bidder for sponsored search".
- aggregation abstract "In sponsored search auctions, advertisers choose a set of keywords based on products they wish to market. They bid for advertising slots that will be displayed on the search results page when a user submits a query containing the keywords that the advertiser selected. Deciding how much to bid is a real challenge: if the bid is too low with respect to the bids of other advertisers, the ad might not get displayed in a favorable position; a bid that is too high on the other hand might not be profitable either, since the attracted number of conversions might not be enough to compensate for the high cost per click. In this paper we propose a genetically evolved keyword bidding strategy that decides how much to bid for each query based on historical data such as the position obtained on the previous day. In light of the fact that our approach does not implement any particular expert knowledge on keyword auctions, it did remarkably well in the Trading Agent Competition at IJCAI2009.".
- aggregation authorList BK274729.
- aggregation aggregates 1108160.
- aggregation isDescribedBy 1108124.
- aggregation similarTo CEC.2010.5585963.
- aggregation similarTo LU-1108124.