<?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-2023-20-2-92-102</article-id><article-id custom-type="elpub" pub-id-type="custom">kaz29-710</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>COMPUTER SCIENCE</subject></subj-group></article-categories><title-group><article-title>ПРОГНОЗ СВЯЗИ С ИСПОЛЬЗОВАНИЕМ ТЕНЗОРНОЙ ДЕКОМПОЗИЦИИ</article-title><trans-title-group xml:lang="en"><trans-title>LINK PREDICTION USING TENSOR DECOMPOSITION</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0009-0002-6758-5608</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Алитурлиева</surname><given-names>А. Е.</given-names></name><name name-style="western" xml:lang="en"><surname>Aliturliyeva</surname><given-names>A. E.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Алитурлиева Альбина Ерболатовна,  Магистр наук о данных</p><p>ул. Толе би, 59, 050000, г. Алматы</p></bio><bio xml:lang="en"><p>Aliturliyeva Albina Erbolatovna, Master’s student in Data Science</p><p>59, Tole bi street, Almaty, 050000</p></bio><email xlink:type="simple">a_aliturliyeva@kbtu.kz</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru">Казахстанско-Британский технический университет<country>Казахстан</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2023</year></pub-date><pub-date pub-type="epub"><day>02</day><month>07</month><year>2023</year></pub-date><volume>20</volume><issue>2</issue><fpage>92</fpage><lpage>102</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Алитурлиева А.Е., 2023</copyright-statement><copyright-year>2023</copyright-year><copyright-holder xml:lang="ru">Алитурлиева А.Е.</copyright-holder><copyright-holder xml:lang="en">Aliturliyeva A.E.</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/710">https://vestnik.kbtu.edu.kz/jour/article/view/710</self-uri><abstract><p>В последние годы тензорная декомпозиция вызывает все больший интерес в области прогнозирования связей, целью которого является оценка вероятности образования новых соединений между узлами в сети. Это исследование подчеркивает потенциал Канонической Полиадической тензорной декомпозиции для улучшения предсказания связей в сложных сетях. В процессе тензорной декомпозиции исходный тензор разлагается на двумерные тензоры, также известные как матрицы факторов, представляющие различные режимы данных. Эти факторные матрицы фиксируют базовые закономерности или отношения внутри сети, обеспечивая понимание структуры и динамики сети. В нем предлагаются эффективные алгоритмы тензорной декомпозиции, которые учитывают не только структурные характеристики сети, но и ее временную эволюцию. Для оценки мы изучаем набор данных, полученный на WSDM. После предварительной обработки данные представляются в виде многоуровневого тензора, причем каждый режим представляет различные аспекты, такие как пользователи, элементы и время. Наша основная цель – сделать точные прогнозы относительно связей между пользователями и товарами в течение определенных периодов времени. Экспериментальные результаты демонстрируют, что наш подход значительно повышает точность прогнозирования для развивающихся сетей, измеряемую AUC.</p></abstract><trans-abstract xml:lang="en"><p>In recent years, tensor decomposition has gained increasing interest in the field of link prediction, which aims to estimate the likelihood of new connections forming between nodes in a network. This study highlights the potential of the Canonical Polyadic tensor decomposition in enhancing link prediction in complex networks. It suggests effective tensor decomposition algorithms that not only take into account the structural characteristics of the network but also its temporal evolution. During the process of tensor decomposition, the initial tensor is decomposed into two-way tensors, also known as factor matrices, representing different modes of the data. These factor matrices capture the underlying patterns or relationships within the network, providing insights into the structure and dynamics of the network. For evaluation, we examine a dataset derived from the WSDM. After preprocessing, the data is represented as a multi-way tensor, with each mode representing different aspects such as users, items, and time. Our primary objective is to make precise predictions about the links between users and items within specific time periods. The experimental results demonstrate that our approach significantly improves prediction accuracy for evolving networks, as measured by the AUC.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>предсказание связи</kwd><kwd>CP-декомпозиция</kwd><kwd>алгоритм Генриха</kwd><kwd>алгоритм ALS</kwd><kwd>экспоненциальное сглаживание</kwd><kwd>BiLSTM</kwd></kwd-group><kwd-group xml:lang="en"><kwd>link prediction</kwd><kwd>CP decomposition</kwd><kwd>Jennrich’s algorithm</kwd><kwd>ALS algorithm</kwd><kwd>exponential smoothing</kwd><kwd>BiLSTM</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">Hitchcock Frank L. (1927) The expression of a tensor or a polyadic as a sum of products, Journal of Mathematics and Physics, 6.1-4, pp. 164–189.</mixed-citation><mixed-citation xml:lang="en">Hitchcock Frank L. (1927) The expression of a tensor or a polyadic as a sum of products, Journal of Mathematics and Physics, 6.1-4, pp. 164–189.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Sidiropoulos Nicholas D. et al. (2017) Tensor decomposition for signal processing and machine learning, IEEE Transactions on Signal Processing, 65.13, pp. 3551–3582.</mixed-citation><mixed-citation xml:lang="en">Sidiropoulos Nicholas D. et al. (2017) Tensor decomposition for signal processing and machine learning, IEEE Transactions on Signal Processing, 65.13, pp. 3551–3582.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Kolda Tamara G. and Brett W. Bader (2009) Tensor decompositions and applications, SIAM review, 51.3, pp. 455–500.</mixed-citation><mixed-citation xml:lang="en">Kolda Tamara G. and Brett W. Bader (2009) Tensor decompositions and applications, SIAM review, 51.3, pp. 455–500.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Tucker, Ledyard R. (1966) Some mathematical notes on three-mode factor analysis, Psychometrika, 31.3: 279–311.</mixed-citation><mixed-citation xml:lang="en">Tucker, Ledyard R. (1966) Some mathematical notes on three-mode factor analysis, Psychometrika, 31.3: 279–311.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Carroll, J. Douglas and Jih-Jie Chang (1970) Analysis of individual differences in multidimensional scaling via an N-way generalization of “Eckart-Young” decomposition, Psychometrika 35.3, pp. 283–319.</mixed-citation><mixed-citation xml:lang="en">Carroll, J. Douglas and Jih-Jie Chang (1970) Analysis of individual differences in multidimensional scaling via an N-way generalization of “Eckart-Young” decomposition, Psychometrika 35.3, pp. 283–319.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Harshman, Richard A. (1970) Foundations of the PARAFAC procedure: Models and conditions for an" explanatory" multimodal factor analysis, pp. 1–84.</mixed-citation><mixed-citation xml:lang="en">Harshman, Richard A. (1970) Foundations of the PARAFAC procedure: Models and conditions for an" explanatory" multimodal factor analysis, pp. 1–84.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Bader, Brett W., Richard A. Harshman and Tamara G. Kolda. Temporal analysis of semantic graphs using ASALSAN, Seventh IEEE international conference on data mining (ICDM 2007).</mixed-citation><mixed-citation xml:lang="en">Bader, Brett W., Richard A. Harshman and Tamara G. Kolda. Temporal analysis of semantic graphs using ASALSAN, Seventh IEEE international conference on data mining (ICDM 2007).</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Nickel, Maximilian, Lorenzo Rosasco and Tomaso Poggio. (2016) Holographic embeddings of knowledge graphs, Proceedings of the AAAI Conference on Artificial Intelligence, vol. 30, no. 1.</mixed-citation><mixed-citation xml:lang="en">Nickel, Maximilian, Lorenzo Rosasco and Tomaso Poggio. (2016) Holographic embeddings of knowledge graphs, Proceedings of the AAAI Conference on Artificial Intelligence, vol. 30, no. 1.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Ma, Yunpu, Volker Tresp and Erik A. Daxberger. (2019) Embedding models for episodic knowledge graphs, Journal of Web Semantics 59: 100490.</mixed-citation><mixed-citation xml:lang="en">Ma, Yunpu, Volker Tresp and Erik A. Daxberger. (2019) Embedding models for episodic knowledge graphs, Journal of Web Semantics 59: 100490.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Acar E., Dunlavy D.M., Kolda T.G. (2009) Link prediction on evolving data using matrix and tensor factorizations, IEEE International conference on data mining workshops, pp. 262–269.</mixed-citation><mixed-citation xml:lang="en">Acar E., Dunlavy D.M., Kolda T.G. (2009) Link prediction on evolving data using matrix and tensor factorizations, IEEE International conference on data mining workshops, pp. 262–269.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Ermiş, Beyza, Evrim Acar and A. Taylan Cemgil. (2015) Link prediction in heterogeneous data via generalized coupled tensor factorization, Data Mining and Knowledge Discovery, 29, pp. 203–236.</mixed-citation><mixed-citation xml:lang="en">Ermiş, Beyza, Evrim Acar and A. Taylan Cemgil. (2015) Link prediction in heterogeneous data via generalized coupled tensor factorization, Data Mining and Knowledge Discovery, 29, pp. 203–236.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Xiong, Liang et al. (2010) Temporal collaborative filtering with Bayesian probabilistic tensor factorization, Proceedings of the 2010 SIAM international conference on data mining, Society for Industrial and Applied Mathematics.</mixed-citation><mixed-citation xml:lang="en">Xiong, Liang et al. (2010) Temporal collaborative filtering with Bayesian probabilistic tensor factorization, Proceedings of the 2010 SIAM international conference on data mining, Society for Industrial and Applied Mathematics.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Gao S., Denoyer L., Gallinari P. (2010) Tensor decomposition model for link prediction in multi-relational networks, 2nd IEEE International Conference on Network Infrastructure and Digital Content, IEEE, pp. 298–302.</mixed-citation><mixed-citation xml:lang="en">Gao S., Denoyer L., Gallinari P. (2010) Tensor decomposition model for link prediction in multi-relational networks, 2nd IEEE International Conference on Network Infrastructure and Digital Content, IEEE, pp. 298–302.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Chi, Eric C. and Tamara G. Kolda. (2012) On tensors, sparsity, and nonnegative factorizations, SIAM Journal on Matrix Analysis and Applications, 33.4, pp. 1272–1299.</mixed-citation><mixed-citation xml:lang="en">Chi, Eric C. and Tamara G. Kolda. (2012) On tensors, sparsity, and nonnegative factorizations, SIAM Journal on Matrix Analysis and Applications, 33.4, pp. 1272–1299.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">de Araujo, Miguel Ramos, Pedro Manuel Pinto Ribeiro and Christos Faloutsos. Tensorcast: Forecasting with context using coupled tensors (best paper award), 2017 IEEE International Conference on Data Mining (ICDM).</mixed-citation><mixed-citation xml:lang="en">de Araujo, Miguel Ramos, Pedro Manuel Pinto Ribeiro and Christos Faloutsos. Tensorcast: Forecasting with context using coupled tensors (best paper award), 2017 IEEE International Conference on Data Mining (ICDM).</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>
