{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:47:20Z","timestamp":1777704440404,"version":"3.51.4"},"reference-count":33,"publisher":"SAGE Publications","issue":"5","license":[{"start":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T00:00:00Z","timestamp":1597104000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2020,11,19]]},"abstract":"<jats:p>Within the most productive route, online travel agencies (OTAs) intend to use advanced digital media ads to expand their piece of the industry as a whole. The metasearch engine platforms are among the most consistently used digital media environments by OTAs. Most OTAs offer day by day deals in metasearch engine platforms that are paying per click for each hotel to get reservations. The administration of offering methodologies is critical along these lines to reduce costs and increase revenue for online travel agencies. In this study, we tried to predict both the number of impressions and the regular Click-Through-Rate (CTR) level of hotel advertising for each hotel and the daily sales amount. A significant commitment of our research is to use an extended dataset generated by integrating the most informative features implemented in various related studies as the rolling average for a different amount of day and shifted values for use in the proposed test stage for CTR, impression and sales prediction. The data is created in this study by one of Turkey\u2019s largest OTA, and we are giving OTA\u2019s a genuine application. The results at each prediction stage show that enriching the training data with the OTA-specific additional features, which are the most insightful and sliding window techniques, improves the prediction models \u2019 generalization capability, and tree-based boosting algorithms carry out the greatest results on this problem. Clustering the dataset according to its specifications also improves the results of the predictions.<\/jats:p>","DOI":"10.3233\/jifs-189123","type":"journal-article","created":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T17:46:15Z","timestamp":1597167975000},"page":"6619-6627","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":1,"title":["Click and sales prediction for OTAs\u2019 digital advertisements: Fuzzy clustering based approach"],"prefix":"10.1177","volume":"39","author":[{"given":"Ahmet Tezcan","family":"Tekin","sequence":"first","affiliation":[{"name":"Istanbul Technical University Management Engineering Department, Besiktas, Istanbul, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ferhan","family":"\u00c7ebi","sequence":"additional","affiliation":[{"name":"Istanbul Technical University Management Engineering Department, Besiktas, Istanbul, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2020,8,11]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"crossref","unstructured":"TekinA. and \u00c7ebiF. Click and Sales Prediction for Digital Advertisements: Real-World Application for OTAs. In Proceedings of the Infus 2019 Conference pp. 205\u2013212 Springer (2019).","DOI":"10.1007\/978-3-030-23756-1_26"},{"key":"e_1_3_1_3_2","doi-asserted-by":"crossref","unstructured":"Adam-BourdariosC. CowanG. Germain-RenaudC. GuyonI. K'eglB. and RousseauD. The higgsmachine learning challenge In Journal of Physics:Conference Series 567 pp. 072015. IOP Publishing. (2015).","DOI":"10.1088\/1742-6596\/664\/7\/072015"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.3390\/molecules21080983"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0119301"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"e_1_3_1_7_2","doi-asserted-by":"crossref","unstructured":"ChenT. and GuestrinC. Xgboost: A scalable tree boosting system. In Proceedings of the 22nd Acm Sigkdd International Conference on Knowledge Discovery and Data Mining (2016) 785\u2013794. ACM.","DOI":"10.1145\/2939672.2939785"},{"key":"e_1_3_1_8_2","unstructured":"ChenT. HeT. BenestyM. et al. Xgboost: extreme Gradient boosting. R package version 0.4-2 (2015) 1\u20134."},{"key":"e_1_3_1_9_2","doi-asserted-by":"crossref","unstructured":"CootesT.F. IonitaM.C. LindnerC. and SauerP. Robust and accurate shapemodel fitting using randomforest regression voting In European Conference on Computer Vision (2012) 278\u2013291. Springer.","DOI":"10.1007\/978-3-642-33786-4_21"},{"key":"e_1_3_1_10_2","doi-asserted-by":"crossref","unstructured":"FriedmanJ.H. Greedy function approximation: a Gradient boosting machine Annals of Statistics (2001) 1189\u20131232.","DOI":"10.1214\/aos\/1013203451"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-6226-1"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0169748"},{"key":"e_1_3_1_13_2","unstructured":"MalaniJ. SinhaN. PrasadN. and LokeshV. Forecasting bike sharing demand."},{"key":"e_1_3_1_14_2","doi-asserted-by":"crossref","unstructured":"MangalA. and KumarN. Using big data to enhance the bosch production line performance: A kaggle challenge. In Big Data (Big Data) 2016 IEEE International Conference on (2016) 2029\u20132035. IEEE.","DOI":"10.1109\/BigData.2016.7840826"},{"key":"e_1_3_1_15_2","unstructured":"Nabi-AbdolyousefiR. Conversion rate prediction in search engine marketing. PhD thesis. (2015)."},{"key":"e_1_3_1_16_2","doi-asserted-by":"crossref","unstructured":"RichardsonM. DominowskaE. and RagnoR. Predicting clicks: Estimating the click-through rate for new ads. In Proceedings of the 16th International Conference on World Wide Web WWW\u201907 pages 521\u2013530 NewYork NY USA. ACM. (2007).","DOI":"10.1145\/1242572.1242643"},{"key":"e_1_3_1_17_2","unstructured":"RidgewayG. MadiganD. and RichardsonT. Boosting methodology for regression problems. In AISTATS. (1999)."},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1021\/ci034160g"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2013.05.103"},{"key":"e_1_3_1_20_2","doi-asserted-by":"crossref","unstructured":"ZhouZ.-H. and FengJ. Deep forest: Towards an alternative to deep neural networks. arXiv preprint arXiv:1702.08835. (2017).","DOI":"10.24963\/ijcai.2017\/497"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-005-6857-3"},{"key":"e_1_3_1_23_2","doi-asserted-by":"crossref","unstructured":"CaiZ. XuL. and ShiY. Using gene clustering to identify discriminatory genes with higher classification accuracy In: Proceedings of the 6th IEEE symposium on bioinformatics and bioengineering (BIBE 2006) Arlington VA 16\u201318 October (2006) pp. 235\u2013242. New York: IEEE.","DOI":"10.1109\/BIBE.2006.253340"},{"key":"e_1_3_1_24_2","doi-asserted-by":"crossref","unstructured":"CaiZ. GoebelR. and SalavatipourM.R. Selecting genes with dissimilar discrimination strength for sample class prediction. In: Proceedings of the Asia-Pacific Bioinformatics Conference (APBC) Hong Kong China 15\u201317 January 2007 pp.81\u201390.","DOI":"10.1142\/9781860947995_0011"},{"key":"e_1_3_1_25_2","doi-asserted-by":"crossref","unstructured":"BezdekJ. Pattern recognition with fuzzy objective function algorithms Plenum Press; New York: 1981.","DOI":"10.1007\/978-1-4757-0450-1"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1080\/01969727308546046"},{"key":"e_1_3_1_27_2","unstructured":"PollardK.S. and Van Der LaanM.J. A Method to Identify Significant Clusters in Gene Expression Data U.C. Berkeley Division of Biostatistics Working Paper Series (2002) 107."},{"key":"e_1_3_1_28_2","doi-asserted-by":"crossref","unstructured":"KaufmanL. and RousseeuwP. Finding Groups in Data: An Introduction to Cluster Analysis NewYork: J. Wiley & Son (1990).","DOI":"10.1002\/9780470316801"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/34.85677"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2020.01.053"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105674"},{"key":"e_1_3_1_32_2","first-page":"24","article-title":"Bagging predictors","volume":"40","author":"Breiman L.","year":"1996","unstructured":"BreimanL., Bagging predictors, Journal of Mach Learn 40 (1996), 24\u2013123.","journal-title":"Journal of Mach Learn"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.apenergy.2018.09.182"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.commatsci.2019.109472"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-189123","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-189123","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-189123","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:41:13Z","timestamp":1777455673000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-189123"}},"subtitle":[],"editor":[{"given":"Cengiz","family":"Kahraman","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2020,8,11]]},"references-count":33,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,11,19]]}},"alternative-id":["10.3233\/JIFS-189123"],"URL":"https:\/\/doi.org\/10.3233\/jifs-189123","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,11]]}}}