<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">kaz29</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник Казахстанско-Британского технического университета</journal-title><trans-title-group xml:lang="en"><trans-title>Herald of the Kazakh-British Technical University</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1998-6688</issn><issn pub-type="epub">2959-8109</issn><publisher><publisher-name>Казахстанско-Британский Технический Университет</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.55452/1998-6688-2021-18-3-36-41</article-id><article-id custom-type="elpub" pub-id-type="custom">kaz29-99</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>ФИЗИКО-МАТЕМАТИЧЕСКИЕ И ТЕХНИЧЕСКИЕ НАУКИ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>PHYSICAL, MATHEMATICAL AND TECHNICAL SCIENCES</subject></subj-group></article-categories><title-group><article-title>ПРОГНОЗИРОВАНИЕ СПРОСА В РЕСТОРАННОМ БИЗНЕСЕ С ИСПОЛЬЗОВАНИЕМ МЕТОДОВ МАШИННОГО ОБУЧЕНИЯ</article-title><trans-title-group xml:lang="en"><trans-title>PREDICTING FUTURE VISITORS IN THE RESTAURANT BUSINESS USING MACHINE LEARNING</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Бортан</surname><given-names>А. Е.</given-names></name><name name-style="western" xml:lang="en"><surname>Bortan</surname><given-names>A. Y.</given-names></name></name-alternatives><bio xml:lang="ru"><p>05000, Алматы</p></bio><bio xml:lang="en"><p>Bortan Aygerim Yesengeldikyzy - Master's student of the Faculty of Information Technology</p><p>050000, Almaty</p></bio><email xlink:type="simple">aigerim.bortan@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Байсаков</surname><given-names>Б. М.</given-names></name><name name-style="western" xml:lang="en"><surname>Baisakov</surname><given-names>B. M.</given-names></name></name-alternatives><bio xml:lang="ru"><p>05000, Алматы</p></bio><bio xml:lang="en"><p>Baisakov Beisenbek Miyatbekovich - Ph.D., professor</p><p>050000, Almaty</p></bio><email xlink:type="simple">beysenbek@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru">Казахстанско-Британский технический университет<country>Казахстан</country></aff><aff xml:lang="en">Kazakh-British Technical university<country>Kazakhstan</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2021</year></pub-date><pub-date pub-type="epub"><day>05</day><month>11</month><year>2021</year></pub-date><volume>18</volume><issue>3</issue><fpage>36</fpage><lpage>41</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Бортан А.Е., Байсаков Б.М., 2021</copyright-statement><copyright-year>2021</copyright-year><copyright-holder xml:lang="ru">Бортан А.Е., Байсаков Б.М.</copyright-holder><copyright-holder xml:lang="en">Bortan A.Y., Baisakov B.M.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://vestnik.kbtu.edu.kz/jour/article/view/99">https://vestnik.kbtu.edu.kz/jour/article/view/99</self-uri><abstract><p>Для экономичной и продуктивной работы, а также для улучшения обслуживания ресторана владельцам ресторана необходимо точно оценивать посетителей ресторана. Хороший прогноз необходим, чтобы избежать потерь и улучшить обслуживание и оптимизацию бизнеса. Есть много методов машинного обучения (МО), которые можно использовать в этих прогнозах; однако каждый посетитель индивидуален. Поэтому в этой работе, используя большие данные и контролируемое обучение, мы хотим предсказать, сколько посетителей ресторан может ожидать в будущем. Три различных метода машинного обучения были применены к реальному набору данных из контролируемого обучения, мы хотим предсказать, сколько посетителей в наборе данных «Прогнозирование посетителей ресторана»: XGBoost, регрессор случайного леса и нейронная сеть. После моделирования прогнозируемые значения сравнивались с реальными данными. В целом, все применяемые алгоритмы достигли средних ошибок ниже 9,5278, но регрессор случайного леса превзошел их со средними ошибками 9,2902.</p></abstract><trans-abstract xml:lang="en"><p>Restaurant owners must reliably assess restaurant customers in order to function effectively and productively to enhance the restaurant's service. It is important to have a successful forecast in order to prevent losses and boost service and market optimization. There are a variety of machine learning (ML) approaches that can be used to make these predictions, but each visitor is unique and will act in a unique way. As a result, we want to estimate how many guests a restaurant may expect in the future using big data and supervised training in this study. We used three different machine learning methods in a real dataset from supervised training to predict how many visitors a restaurant dataset "Recruit restaurant visitor forecasting" will receive: Neural Network, XGBoost and Random Forest regressor. The predicted values were compared to the real data after the simulation. Basically, algorithms used had mean errors of less than 9.5278, but the Random Forest regressor exceeded, with mean errors of 9.2902.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>прогноз</kwd><kwd>машинное обучение</kwd><kwd>большие данные</kwd><kwd>контролируемое обучение</kwd><kwd>набор данных</kwd><kwd>XGBoost</kwd><kwd>регрессор случайного леса</kwd><kwd>нейронная сеть</kwd></kwd-group><kwd-group xml:lang="en"><kwd>prediction</kwd><kwd>machine learning</kwd><kwd>big data</kwd><kwd>supervised training</kwd><kwd>dataset</kwd><kwd>XGBoost</kwd><kwd>Random Forest regressor</kwd><kwd>Neural Network</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Xin Yang, Bing Pan, A. James, Evans, and Lv. Benfu, ”Forecasting Chinese tourist volume with search engine data”, Tourism Management, Vol 46, pp. 386-397, 2015.</mixed-citation><mixed-citation xml:lang="en">Xin Yang, Bing Pan, A. James, Evans, and Lv. Benfu, ”Forecasting Chinese tourist volume with search engine data”, Tourism Management, Vol 46, pp. 386-397, 2015.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Yang Yang, Bing Pan, and Haiyan Song, ”Predicting hotel demand using destination marketing organizations web traffic data”, Journal of Travel Research, Vol 53, no. 4, pp. 433-447, 2014.</mixed-citation><mixed-citation xml:lang="en">Yang Yang, Bing Pan, and Haiyan Song, ”Predicting hotel demand using destination marketing organizations web traffic data”, Journal of Travel Research, Vol 53, no. 4, pp. 433-447, 2014.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Cho.Vincent, ”A comparison of three different approaches to tourist arrival forecasting”, Tourism management, Vol 24, no. 3, pp. 323-330, 2003.</mixed-citation><mixed-citation xml:lang="en">Cho.Vincent, ”A comparison of three different approaches to tourist arrival forecasting”, Tourism management, Vol 24, no. 3, pp. 323-330, 2003.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Usep Suhud, and Arifin Wibowo, ”Predicting Customers Intention to Revisit A Vintage-Concept Restaurant”, Journal of Consumer Sciences, Vol 1, no. 2 (2016).</mixed-citation><mixed-citation xml:lang="en">Usep Suhud, and Arifin Wibowo, ”Predicting Customers Intention to Revisit A Vintage-Concept Restaurant”, Journal of Consumer Sciences, Vol 1, no. 2 (2016).</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Shanshan Feng, Gao Cong, Bo An, and Yeow Meng Chee, ”POI2Vec: Geographical Latent Representation for Predicting Future Visitors”, In AAAI, pp. 102-108, 2017.</mixed-citation><mixed-citation xml:lang="en">Shanshan Feng, Gao Cong, Bo An, and Yeow Meng Chee, ”POI2Vec: Geographical Latent Representation for Predicting Future Visitors”, In AAAI, pp. 102-108, 2017.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Corinna Cortes, and Vladimir Vapnik, ”Support-vector networks”, Machine learning, Vol 20, no. 3, pp. 273-297, 1995.</mixed-citation><mixed-citation xml:lang="en">Corinna Cortes, and Vladimir Vapnik, ”Support-vector networks”, Machine learning, Vol 20, no. 3, pp. 273-297, 1995.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Leo Breiman, ”Random forests”, Machine learning, Vol 45, no. 1, pp. 5-32, 2001.</mixed-citation><mixed-citation xml:lang="en">Leo Breiman, ”Random forests”, Machine learning, Vol 45, no. 1, pp. 5-32, 2001.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Yann LeCun, Yoshua Bengio, and Geoffrey Hinton, ”Deep learning”, nature, Vol 521, no. 7553, pp. 436, 2015.</mixed-citation><mixed-citation xml:lang="en">Yann LeCun, Yoshua Bengio, and Geoffrey Hinton, ”Deep learning”, nature, Vol 521, no. 7553, pp. 436, 2015.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Tianqi Chen, and Carlos Guestrin, ”Xgboost: A scalable tree boosting system”, In Proceedings of the 22nd acm sigkdd international conference on knowledge discovery and data mining, pp. 785-794. ACM, 2016.</mixed-citation><mixed-citation xml:lang="en">Tianqi Chen, and Carlos Guestrin, ”Xgboost: A scalable tree boosting system”, In Proceedings of the 22nd acm sigkdd international conference on knowledge discovery and data mining, pp. 785-794. ACM, 2016.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">XGBoost Documentation</mixed-citation><mixed-citation xml:lang="en">XGBoost Documentation</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">https://xgboost.readthedocs.io/en/latest/</mixed-citation><mixed-citation xml:lang="en">https://xgboost.readthedocs.io/en/latest/</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">MICROSOFT, Machine Learning studio. https://docs.microsoft.com/en-us/azure/machinelearning/studio-module-reference/decision-forest-regression. last accessed 2019/10/12.</mixed-citation><mixed-citation xml:lang="en">MICROSOFT, Machine Learning studio. https://docs.microsoft.com/en-us/azure/machinelearning/studio-module-reference/decision-forest-regression. last accessed 2019/10/12.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">MICROSOFT, Machine Learning studio. https://docs.microsoft.com/en-us/azure/machinelearning/studio-module-reference/neural-network-regression. last accessed 2019/10/12</mixed-citation><mixed-citation xml:lang="en">MICROSOFT, Machine Learning studio. https://docs.microsoft.com/en-us/azure/machinelearning/studio-module-reference/neural-network-regression. last accessed 2019/10/12</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">SKYMIND website. last accessed 2019/10/12.</mixed-citation><mixed-citation xml:lang="en">SKYMIND website. last accessed 2019/10/12.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">AirREGI. https://air-regi.com/</mixed-citation><mixed-citation xml:lang="en">AirREGI. https://air-regi.com/</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
