<?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">mais</journal-id><journal-title-group><journal-title xml:lang="ru">Моделирование и анализ информационных систем</journal-title><trans-title-group xml:lang="en"><trans-title>Modeling and Analysis of Information Systems</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1818-1015</issn><issn pub-type="epub">2313-5417</issn><publisher><publisher-name>Yaroslavl State University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.18255/1818-1015-2024-3-280-293</article-id><article-id custom-type="elpub" pub-id-type="custom">mais-1878</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>Computing Methodologies and Applications</subject></subj-group></article-categories><title-group><article-title>Матрично-кубитный алгоритм семантического анализа вероятностных данных</article-title><trans-title-group xml:lang="en"><trans-title>Matrix-qubit algorithm for semantic analysis of probabilistic data</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-5690-7507</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>Surov</surname><given-names>Ilya A.</given-names></name></name-alternatives><email xlink:type="simple">ilya.a.surov@itmo.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Университет ИТМО</institution><country>Россия</country></aff><aff xml:lang="en"><institution>ITMO University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2024</year></pub-date><pub-date pub-type="epub"><day>13</day><month>09</month><year>2024</year></pub-date><volume>31</volume><issue>3</issue><fpage>280</fpage><lpage>293</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Суров И.А., 2024</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="ru">Суров И.А.</copyright-holder><copyright-holder xml:lang="en">Surov I.A.</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://www.mais-journal.ru/jour/article/view/1878">https://www.mais-journal.ru/jour/article/view/1878</self-uri><abstract><p>В статье представлен метод семантического анализа данных посредством комплекснозначного матричного разложения. Метод основан на квантовой модели контекстно-чувствительных решений, согласно которой наблюдаемые вероятности порождаются кубитными состояниями, представляющими субъективный смысл контекстов для базисного решения. В простейшем трёхконтекстом случае один из кубитов раскладывается в суперпозицию оставшихся двух, математически представляющую смысловые отношения между контекстами. Для использования в задаче анализа данных эта модель представлена в матричной форме так, что строки и столбцы соответствуют контекстам и постановкам эксперимента. При этом наблюдаемые действительные данные порождаются матрицей комплекснозначных амплитуд, раскладываемой на произведение действительной матрицы базисных векторов и комплекснозначной матрицы коэффициентов суперпозиции. Это разложение выявляет устойчивые процессно-смысловые соотношения контекстов, не обнаруживаемые другими методами. В результате данные воспроизводятся более точно и с меньшим числом параметров, чем при использовании сингулярного и неотрицательного матричных разложений той же размерности. Модель успешно испытана в описательном и предсказательном режимах. Результат открывает возможности для разработки природоподобных вычислительных архитектур на новых логических принципах.</p></abstract><trans-abstract xml:lang="en"><p>The paper presents a method for semantic data analysis by means of complex-valued matrix decomposition. The method is based on the quantum model of contextual decision-making, according to which observable probabilities are generated by qubit states, representing subjective meaning of the contexts relative to the basis decision. In the simplest three-context case, one of these qubits is decomposed to superposition of the remaining two, mathematically encoding semantic relations between the three contexts. For use in data analysis this model is translated to the matrix form, in which rows and columns correspond to the contexts and instances of experiment. The observable real-valued data then emerge from a complex-valued amplitude matrix, decomposed to a product of a real basis matrix and complex-valued matrix of superposition coefficients. This decomposition reveals stable process-semantic relations between the considered contexts, not captured by other methods of analysis. As a result, the data are approximated with higher precision and fewer parameters than singular and non-negative matrix decompositions, truncated to the same dimension. The model is experimentally approved in descriptive and prognostic regimes. The result opens prospects for development of nature-like computational architectures on novel logical grounds.</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>semantic analysis</kwd><kwd>behavioral modeling</kwd><kwd>matrix decomposition</kwd><kwd>context</kwd><kwd>quantum probability</kwd><kwd>quantum logic</kwd><kwd>qubit</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">РНФ, проект No 23-71-01046.</funding-statement><funding-statement xml:lang="en">Russian Science Foundation, project No. 23-71-01046.</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">S. D. Larson, P. Gleeson, and A. E. X. Brown, “Connectome to Behaviour: Modelling Caenorhabditis Elegans at Cellular Resolution,” Philosophical Transactions of the Royal Society B: Biological Sciences, vol. 373, no. 1758, p. 20170366, 2018, doi: 10.1098/rstb.2017.0366.</mixed-citation><mixed-citation xml:lang="en">S. D. Larson, P. Gleeson, and A. E. X. Brown, “Connectome to Behaviour: Modelling Caenorhabditis Elegans at Cellular Resolution,” Philosophical Transactions of the Royal Society B: Biological Sciences, vol. 373, no. 1758, p. 20170366, 2018, doi: 10.1098/rstb.2017.0366.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">O. P. Kuznetsov, “Nonclassical Paradigms in the Artificial Intelligence,” Teoriya i Sistemy Upravleniya, no. 5, pp. 3–23, 1995.</mixed-citation><mixed-citation xml:lang="en">O. P. Kuznetsov, “Nonclassical Paradigms in the Artificial Intelligence,” Teoriya i Sistemy Upravleniya, no. 5, pp. 3–23, 1995.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">A. Pavlov, “Fourier Holography Techniques for Artificial Intelligence,” in Advances in Information Optics and Photonics, 2010, pp. 251–269.</mixed-citation><mixed-citation xml:lang="en">A. Pavlov, “Fourier Holography Techniques for Artificial Intelligence,” in Advances in Information Optics and Photonics, 2010, pp. 251–269.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">D. Widdows, K. Kitto, and T. Cohen, “Quantum Mathematics in Artificial Intelligence,” Journal of Artificial Intelligence Research, vol. 72, pp. 1307–1341, 2021, doi: 10.1613/jair.1.12702.</mixed-citation><mixed-citation xml:lang="en">D. Widdows, K. Kitto, and T. Cohen, “Quantum Mathematics in Artificial Intelligence,” Journal of Artificial Intelligence Research, vol. 72, pp. 1307–1341, 2021, doi: 10.1613/jair.1.12702.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">A. Melnikov, M. Kordzanganeh, A. Alodjants, and R.-K. Lee, “Quantum Machine Learning: From Physics to Software Engineering,” Advances in Physics: X, vol. 8, no. 1, 2023, doi: 10.1080/23746149.2023.2165452.</mixed-citation><mixed-citation xml:lang="en">A. Melnikov, M. Kordzanganeh, A. Alodjants, and R.-K. Lee, “Quantum Machine Learning: From Physics to Software Engineering,” Advances in Physics: X, vol. 8, no. 1, 2023, doi: 10.1080/23746149.2023.2165452.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">A. Y. Khrennikov, Ubiquitous Quantum Structure: From Psychology to Finance. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010.</mixed-citation><mixed-citation xml:lang="en">A. Y. Khrennikov, Ubiquitous Quantum Structure: From Psychology to Finance. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">I. A. Surov, “Logic of Sets and Logic of Waves in Cognitive-Behavioral Modeling,” Information and Mathematical Technologies in Science and Management, vol. 32, no. 4, pp. 51–66, 2023, doi: 10.25729/ESI.2023.32.4.005.</mixed-citation><mixed-citation xml:lang="en">I. A. Surov, “Logic of Sets and Logic of Waves in Cognitive-Behavioral Modeling,” Information and Mathematical Technologies in Science and Management, vol. 32, no. 4, pp. 51–66, 2023, doi: 10.25729/ESI.2023.32.4.005.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">A. K. Guts, Fundamentals of Quantum Cybernetics. KAN, 2008.</mixed-citation><mixed-citation xml:lang="en">A. K. Guts, Fundamentals of Quantum Cybernetics. KAN, 2008.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">A. Hirose, Ed., Complex-Valued Neural Networks. Theories and Applications. World Scientific, 2003.</mixed-citation><mixed-citation xml:lang="en">A. Hirose, Ed., Complex-Valued Neural Networks. Theories and Applications. World Scientific, 2003.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">J. J. Denimal and S. Camiz, “Complex Principal Component Analysis: Theory and Geometrical Aspects,” Journal of Classification, vol. 39, no. 2, pp. 376–408, 2022, doi: 10.1007/s00357-022-09412-0.</mixed-citation><mixed-citation xml:lang="en">J. J. Denimal and S. Camiz, “Complex Principal Component Analysis: Theory and Geometrical Aspects,” Journal of Classification, vol. 39, no. 2, pp. 376–408, 2022, doi: 10.1007/s00357-022-09412-0.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">S. Kozhisseri and I. A. Surov, “Quantum-Probabilistic SVD: Complex-Valued Factorization of Matrix Data,” Scientific and Technical Journal of Information Technologies, Mechanics and Optics, vol. 22, no. 3, pp. 567–573, 2022, doi: 10.17586/2226-1494-2022-22-3-567-573.</mixed-citation><mixed-citation xml:lang="en">S. Kozhisseri and I. A. Surov, “Quantum-Probabilistic SVD: Complex-Valued Factorization of Matrix Data,” Scientific and Technical Journal of Information Technologies, Mechanics and Optics, vol. 22, no. 3, pp. 567–573, 2022, doi: 10.17586/2226-1494-2022-22-3-567-573.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">B. Wang, Q. Li, M. Melucci, and D. Song, “Semantic Hilbert Space for Text Representation Learning,” in Proceedings of the World Wide Web Conference, 2019, pp. 3293–3299, doi: 10.1145/3308558.3313516.</mixed-citation><mixed-citation xml:lang="en">B. Wang, Q. Li, M. Melucci, and D. Song, “Semantic Hilbert Space for Text Representation Learning,” in Proceedings of the World Wide Web Conference, 2019, pp. 3293–3299, doi: 10.1145/3308558.3313516.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">D. D. Lee and H. S. Seung, “Learning the Parts of Objects by Non-Negative Matrix Factorization,” Nature, vol. 401, no. 6755, pp. 788–791, 1999, doi: 10.1038/44565.</mixed-citation><mixed-citation xml:lang="en">D. D. Lee and H. S. Seung, “Learning the Parts of Objects by Non-Negative Matrix Factorization,” Nature, vol. 401, no. 6755, pp. 788–791, 1999, doi: 10.1038/44565.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">I. A. Surov, “Natural Code of Subjective Experience,” Biosemiotics, vol. 15, no. 1, pp. 109–139, 2022, doi: 10.1007/s12304-022-09487-7.</mixed-citation><mixed-citation xml:lang="en">I. A. Surov, “Natural Code of Subjective Experience,” Biosemiotics, vol. 15, no. 1, pp. 109–139, 2022, doi: 10.1007/s12304-022-09487-7.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">I. A. Surov, “What Is the Difference? Pragmatic Formalization of Meaning,” Artificial intelligence and decision making, no. 1, pp. 78–89, 2023, doi: 10.14357/20718594230108.</mixed-citation><mixed-citation xml:lang="en">I. A. Surov, “What Is the Difference? Pragmatic Formalization of Meaning,” Artificial intelligence and decision making, no. 1, pp. 78–89, 2023, doi: 10.14357/20718594230108.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">A. Tversky and E. Shafir, “The Disjunction Effect in Choice Under Uncertainty,” Psychological Science, vol. 3, no. 5, pp. 305–309, 1992, doi: 10.1111/j.1467-9280.1992.tb00678.x.</mixed-citation><mixed-citation xml:lang="en">A. Tversky and E. Shafir, “The Disjunction Effect in Choice Under Uncertainty,” Psychological Science, vol. 3, no. 5, pp. 305–309, 1992, doi: 10.1111/j.1467-9280.1992.tb00678.x.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">I. A. Surov, “Quantum Cognitive Triad: Semantic Geometry of Context Representation,” Foundations of Science, vol. 26, no. 4, pp. 947–975, 2021, doi: 10.1007/s10699-020-09712-x.</mixed-citation><mixed-citation xml:lang="en">I. A. Surov, “Quantum Cognitive Triad: Semantic Geometry of Context Representation,” Foundations of Science, vol. 26, no. 4, pp. 947–975, 2021, doi: 10.1007/s10699-020-09712-x.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">I. A. Surov, “Probabilistic Prediction of ‘Irrational’ Decisions from Semantic Composition of Contexts,” Journal of Applied Informatics, vol. 19, no. 1, pp. 125–143, 2024, doi: 10.37791/2687-0649-2024-19-1-125-143.</mixed-citation><mixed-citation xml:lang="en">I. A. Surov, “Probabilistic Prediction of ‘Irrational’ Decisions from Semantic Composition of Contexts,” Journal of Applied Informatics, vol. 19, no. 1, pp. 125–143, 2024, doi: 10.37791/2687-0649-2024-19-1-125-143.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">N. Gillis, Nonnegative Matrix Factorization. Society for Industrial and Applied Mathematics, 2020.</mixed-citation><mixed-citation xml:lang="en">N. Gillis, Nonnegative Matrix Factorization. Society for Industrial and Applied Mathematics, 2020.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">I. A. Surov, “Life Cycle: Semantic Matrix of Process Modeling,” Ontology of designing, vol. 12, no. 4, pp. 430–453, 2022, doi: 10.18287/2223-9537-2022-12-4-430-453x.</mixed-citation><mixed-citation xml:lang="en">I. A. Surov, “Life Cycle: Semantic Matrix of Process Modeling,” Ontology of designing, vol. 12, no. 4, pp. 430–453, 2022, doi: 10.18287/2223-9537-2022-12-4-430-453x.</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">C. Zhu, R. H. Byrd, P. Lu, and J. Nocedal, “Algorithm 778: L-BFGS-B: Fortran Subroutines for Large-Scale Bound- Constrained Optimization,” ACM Transactions on Mathematical Software, vol. 23, no. 4, pp. 550–560, 1997, doi: 10.1145/279232.279236.</mixed-citation><mixed-citation xml:lang="en">C. Zhu, R. H. Byrd, P. Lu, and J. Nocedal, “Algorithm 778: L-BFGS-B: Fortran Subroutines for Large-Scale Bound- Constrained Optimization,” ACM Transactions on Mathematical Software, vol. 23, no. 4, pp. 550–560, 1997, doi: 10.1145/279232.279236.</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>
