<?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 custom-type="elpub" pub-id-type="custom">kaz29-161</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>CHEMICAL, TECHNOLOGICAL AND ENVIRONMENTAL SCIENCES</subject></subj-group></article-categories><title-group><article-title>СИСТЕМА ПЕРСОНАЛЬНЫХ РЕКОМЕНДАЦИЙ ТРЕНИРОВОК, ОСНОВАННАЯ НА КОЛЛАБОРАТИВНОЙ ФИЛЬТРАЦИИ</article-title><trans-title-group xml:lang="en"><trans-title>PERSONALIZED TRAINING RECOMMENDATION SYSTEM BASED ON COLLABORATIVE FILTERING</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>Toremuratuly</surname><given-names>А.</given-names></name></name-alternatives><bio xml:lang="ru"><p>магистрант</p></bio><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>M. M.</given-names></name><name name-style="western" xml:lang="en"><surname>Zhailkhan</surname><given-names>M. M.</given-names></name></name-alternatives><bio xml:lang="ru"><p>магистрант</p></bio><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>Urpekova</surname><given-names>A. Z</given-names></name></name-alternatives><bio xml:lang="ru"><p>магистрант</p></bio><xref ref-type="aff" rid="aff-2"/></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><aff-alternatives id="aff-2"><aff xml:lang="ru">Международный университет информационных технологий<country>Казахстан</country></aff><aff xml:lang="en">International University of Information Technologies<country>Kazakhstan</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2020</year></pub-date><pub-date pub-type="epub"><day>07</day><month>11</month><year>2021</year></pub-date><volume>17</volume><issue>2</issue><fpage>147</fpage><lpage>151</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Торемуратулы А., Жаилхан M.M., Урпекова А.Ж., 2021</copyright-statement><copyright-year>2021</copyright-year><copyright-holder xml:lang="ru">Торемуратулы А., Жаилхан M.M., Урпекова А.Ж.</copyright-holder><copyright-holder xml:lang="en">Toremuratuly А., Zhailkhan M.M., Urpekova A.Z.</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/161">https://vestnik.kbtu.edu.kz/jour/article/view/161</self-uri><abstract><p>В данной статье выборочно рассматриваются несколько подходов реализации персональной системы рекомендаций тренировок с помощью коллаборативной фильтрации. Главным направлением была выбрана фильтрация, основанная на работе с памятью, где авторы напрямую работают с данными и пытаются вычленить нужные связи, производя статистические методы на всем датасете целикомВ список рассмотренных алгоритмов входят такие как метод косинусного сходства и метод корреляции Пирсона. В первом случае мы рассматриваем каждого пользователя как N-мерный вектор, где N – это количество рассматриваемых тренировок. Далее мы считаем сходство между двумя конкретными пользователями как косинус угла между двумя их векторами. Данный подход дал достаточно хорошие результаты, однако пустые клетки разряженной матрицы сильно повлияли на результат, так как этот метод плохо работает. В случае же Корреляции Пирсона пытаемся найти позитивные или негативные тренды между юзерами и считаем коэффициент корреляции, который далее будет использован при прогнозе значений для пустых ячеек.Конечный результат статьи – сравнить все вышеперечисленные методы и рассказать о плюсах и минусах каждого. Сравнения произведены с помощью подсчета таких метрик как RMSE и MAE.</p></abstract><trans-abstract xml:lang="en"><p>In this article we have covered many approaches of implementing personalized training recommendation system based on collaborative filtering. These techniques are consist of memory based methods, where we apply our statistical methods to the entire dataset to make predictions. We have considered such algorithms as cosine similarity and Pearson correlation. For cosine similarity we consider users data as vector of some collaborations in N dimensional space, where N is number of items. Then we calculate similarity of any two users as cosine of an angle between their vectors. This technique end up with good results, but anyway there is a problem, because of the matrix sparsity (empty interactions). Considering them as 0, impacts results even if we remove mean from each existing collaboration. Therefore, we also considered Pearson correlation which operates better with empty spaces in our data matrix. Here we try to find positive or negative trends between users and get correlation coefficient to predict rating.At the end of article we have compared all techniques based on such approaches as measuring RMSE and MAE</p></trans-abstract><kwd-group xml:lang="ru"><kwd>системы рекомендации</kwd><kwd>коллаборативная фильтрация</kwd><kwd>метод косинусного сходства</kwd><kwd>метод корреляции Пирсона</kwd><kwd>спортзал</kwd><kwd>тренировка</kwd><kwd>спорт</kwd></kwd-group><kwd-group xml:lang="en"><kwd>recommendation systems</kwd><kwd>collaborative filtering</kwd><kwd>cosine similarity</kwd><kwd>Pearson correlation</kwd><kwd>gym</kwd><kwd>trainings</kwd><kwd>sport</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">Francesco Ricci and Lior Rokach and Bracha Shapira (2011), Introduction to Recommender Systems Handbook, 1-35</mixed-citation><mixed-citation xml:lang="en">Francesco Ricci and Lior Rokach and Bracha Shapira (2011), Introduction to Recommender Systems Handbook, 1-35</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Ferrari Dacrema, Maurizio; Cremonesi, Paolo; Jannach, Dietmar (2019), Are We Really Making Much Progress? A Worrying Analysis of Recent Neural Recommendation Approaches, 101–109</mixed-citation><mixed-citation xml:lang="en">Ferrari Dacrema, Maurizio; Cremonesi, Paolo; Jannach, Dietmar (2019), Are We Really Making Much Progress? A Worrying Analysis of Recent Neural Recommendation Approaches, 101–109</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">He, Xiangnan; Liao, Lizi; Zhang, Hanwang; Nie, Liqiang; Hu, Xia; Chua, Tat-Seng (2017), Neural Collaborative Filtering,173–182</mixed-citation><mixed-citation xml:lang="en">He, Xiangnan; Liao, Lizi; Zhang, Hanwang; Nie, Liqiang; Hu, Xia; Chua, Tat-Seng (2017), Neural Collaborative Filtering,173–182</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Fleder, Daniel; Hosanagar, Kartik (2009), Blockbuster Culture’s Next Rise or Fall: The Impact of Recommender Systems on Sales Diversity, 697–712.</mixed-citation><mixed-citation xml:lang="en">Fleder, Daniel; Hosanagar, Kartik (2009), Blockbuster Culture’s Next Rise or Fall: The Impact of Recommender Systems on Sales Diversity, 697–712.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Shi, Yue; Larson, Martha; Hanjalic, Alan (2014), Collaborative filtering beyond the user-item matrix: A survey of the state of the art and future challenges, 1–45</mixed-citation><mixed-citation xml:lang="en">Shi, Yue; Larson, Martha; Hanjalic, Alan (2014), Collaborative filtering beyond the user-item matrix: A survey of the state of the art and future challenges, 1–45</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>
