Skip to main content
Log in

MLP modeling for search advertising price prediction

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

Abstract

As the use of online and various smart devices spread, the use of online search engines became more active. As Internet shopping has evolved through online search engines, competition is under way to launch its link at the top of search engines to expose its links to prospective shoppers. This trend has contributed to the increase in advertising costs in the search advertising market. In this case, the value of the search keyword is generally calculated based on the frequency of the search keyword, however the search engine configures the price of the search keyword through the private auction method without disclosing the price in real time. Finally, it is difficult to reach the exact price and position by passive statistical method in order to predict the price of the search keyword. There is a growing demand for automation methodologies to perform this process quickly and efficiently. In this paper, we propose a Multi-Layer Perceptron (MLP) Neural Network modeling method that estimates bid prices of search keywords by collecting search keywords. MLP is used because it uses generalized delta learning rules and easily gets trained in less number of iterations. In this paper, we propose a MLP based prediction modeling to predict optimal bidding price of the keyword in a specific ranking of search engine.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  • Auerbach J, Galenson J, Sundararajan M (2008) In: Proceedings an empirical analysis of return on investment maximization in sponsored search auctions, International workshop data mining audience Intell Ad ADKDD08

  • Brooks N (2004) In: Proceedings The Atlas rank report: how search engine rank impacts traffic. Insights, Atlas Institute Digital Marketing

  • Gopal R, Li X, Sankaranarayanan R (2011) Online keyword based advertising impact of ad impressions on own channel and cross channel click through rates. Decis Support Syst 52:1–31

    Article  Google Scholar 

  • Graepel T, Candela J, Borchert T, Herbrich R (2010) In: Proceedings Web-scale Bayesian click through rate prediction for sponsored search advertising in Microsoft Bing search engine, International Conference on Machine Learning. ICML

  • Hou L (2015) A hierarchical bayesian network-based approach to keyword auction. IEEE Trans Eng Manag 62:217–225

    Article  Google Scholar 

  • Jerath K, Ma L, Park Y, Srinivasan K (2011) A position Paradox in sponsored search auctions. Mark Sci 30:612–627

    Article  Google Scholar 

  • Kingma D, Ba J (2015) In Proceeding ADAM: a method for stochastic optimization, International conference on learning representations. ICLR

  • Lauritzen S (1995) The EM algorithm for graphical association models with missing data. Comput Stat Data Anal 19:191–201

    Article  Google Scholar 

  • Oliver JR, Randolph EB (2011) From generic to branded: a model of spillover in paid search advertising. J Mark Res 48:87–102

    Article  Google Scholar 

  • Shuai Y, Wang J, Zhao X (2013) In: Proceedings Real-time bidding for online advertising: measurement and analysis, International Workshop on Data Mining for Online Advertising. ADKDD13

  • Stepanchuk T (2008) In: Proceedings an empirical examination of the relation between bids and positions of ads in sponsored search, BLED

  • Sur C (2018) DeepSeq: learning browsing log data based personalized security vulnerabilities and counter intelligent measures. J. Ambient Intell Hum Comput 1–30

  • Suto J, Oniga S (2017) Efficiency investigation of artificial neural networks in human activity recognition. J Ambient Intell Hum Comput 9:1049–1060

    Article  Google Scholar 

  • Toshitaka M, Kazuki T, Toshihiko W, Akihisa K, Noboru S (2018) Resource propagation algorithm considering predicates to complement knowledge bases in linked data. Int J Space-Based Situat Comput 8:115–121

    Article  Google Scholar 

  • Xiaohui L, Yang Z, Hongbin D, Jun H (2016) A novel near-parallel version of k-means algorithm for n-dimensional data objects using MPI. Int J Grid Util Comput 7:80–91

    Article  Google Scholar 

  • Yala N, Fergani B, Fleury A (2017) Towards improving feature extraction and classification for activity recognition on streaming data. J Ambient Intell Hum Comput 8:177–189

    Article  Google Scholar 

  • Yu-Cheng W (2018) Prediction of engine failure time using principal component analysis, categorical regression tree, and back propagation network. J. Ambient Intell Hum Comput. 1–9

Download references

Acknowledgements

This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (No. 2017R1C1B5017556).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hyunhee Park.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Park, H. MLP modeling for search advertising price prediction. J Ambient Intell Human Comput 11, 411–417 (2020). https://doi.org/10.1007/s12652-019-01298-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-019-01298-y

Keywords

Navigation