{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T14:48:01Z","timestamp":1774277281345,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T00:00:00Z","timestamp":1555286400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s12652-019-01298-y","type":"journal-article","created":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T02:03:31Z","timestamp":1555293811000},"page":"411-417","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["MLP modeling for search advertising price prediction"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3810-7367","authenticated-orcid":false,"given":"Hyunhee","family":"Park","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,15]]},"reference":[{"key":"1298_CR1","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1145\/1517472.1517473"},{"key":"1298_CR2","unstructured":"Brooks N (2004) In: Proceedings The Atlas rank report: how search engine rank impacts traffic. Insights, Atlas Institute Digital Marketing"},{"key":"1298_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dss.2011.04.002","volume":"52","author":"R Gopal","year":"2011","unstructured":"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\u201331","journal-title":"Decis Support Syst"},{"key":"1298_CR4","unstructured":"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"},{"key":"1298_CR5","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1109\/TEM.2015.2390772","volume":"62","author":"L Hou","year":"2015","unstructured":"Hou L (2015) A hierarchical bayesian network-based approach to keyword auction. IEEE Trans Eng Manag 62:217\u2013225","journal-title":"IEEE Trans Eng Manag"},{"key":"1298_CR6","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1287\/mksc.1110.0645","volume":"30","author":"K Jerath","year":"2011","unstructured":"Jerath K, Ma L, Park Y, Srinivasan K (2011) A position Paradox in sponsored search auctions. Mark Sci 30:612\u2013627","journal-title":"Mark Sci"},{"key":"1298_CR7","unstructured":"Kingma D, Ba J (2015) In Proceeding ADAM: a method for stochastic optimization, International conference on learning representations. ICLR"},{"key":"1298_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0167-9473(93)E0056-A","volume":"19","author":"S Lauritzen","year":"1995","unstructured":"Lauritzen S (1995) The EM algorithm for graphical association models with missing data. Comput Stat Data Anal 19:191\u2013201","journal-title":"Comput Stat Data Anal"},{"key":"1298_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1509\/jmkr.48.1.87","volume":"48","author":"JR Oliver","year":"2011","unstructured":"Oliver JR, Randolph EB (2011) From generic to branded: a model of spillover in paid search advertising. J Mark Res 48:87\u2013102","journal-title":"J Mark Res"},{"key":"1298_CR10","unstructured":"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"},{"key":"1298_CR11","unstructured":"Stepanchuk T (2008) In: Proceedings an empirical examination of the relation between bids and positions of ads in sponsored search, BLED"},{"key":"1298_CR12","unstructured":"Sur C (2018) DeepSeq: learning browsing log data based personalized security vulnerabilities and counter intelligent measures. J. Ambient Intell Hum Comput 1\u201330"},{"key":"1298_CR13","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1007\/s12652-017-0513-5","volume":"9","author":"J Suto","year":"2017","unstructured":"Suto J, Oniga S (2017) Efficiency investigation of artificial neural networks in human activity recognition. J Ambient Intell Hum Comput 9:1049\u20131060","journal-title":"J Ambient Intell Hum Comput"},{"key":"1298_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1504\/IJSSC.2018.094495","volume":"8","author":"M Toshitaka","year":"2018","unstructured":"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\u2013121","journal-title":"Int J Space-Based Situat Comput"},{"key":"1298_CR15","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1504\/IJGUC.2016.077487","volume":"7","author":"L Xiaohui","year":"2016","unstructured":"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\u201391","journal-title":"Int J Grid Util Comput"},{"key":"1298_CR16","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s12652-016-0412-1","volume":"8","author":"N Yala","year":"2017","unstructured":"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\u2013189","journal-title":"J Ambient Intell Hum Comput"},{"key":"1298_CR17","unstructured":"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\u20139"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-019-01298-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12652-019-01298-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-019-01298-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,13]],"date-time":"2020-04-13T23:09:14Z","timestamp":1586819354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12652-019-01298-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,15]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["1298"],"URL":"https:\/\/doi.org\/10.1007\/s12652-019-01298-y","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"value":"1868-5137","type":"print"},{"value":"1868-5145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,15]]},"assertion":[{"value":"19 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}