<?xml version="1.0" encoding="UTF-8"?> <!DOCTYPE book PUBLIC "-//NLM//DTD BITS Book Interchange DTD v2.3 20210610//EN" "BITS-book2.3.dtd"> <book xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" book-type="conference-proceedings" dtd-version="2.3" xml:lang="ru"> <front> <book-meta>    <title-group>  <book-title xml:lang="ru">Общество и наука: векторы развития</book-title>   </title-group>  <description xml:lang="ru"> <p>В сборнике представлены статьи участников Всероссийской научно-практической конференции с международным участием, посвященные актуальным вопросам науки и образования. В материалах сборника приведены результаты теоретических и прикладных изысканий представителей научного и образовательного сообщества в данной области.
Статьи представлены в авторской редакции.</p> </description>   <contrib-group>  <contrib contrib-type="editor" id="editor1">    <name-alternatives>  <name name-style="eastern" xml:lang="ru"> <surname>Кожанов</surname> <given-names>Виктор Иванович</given-names> </name>   </name-alternatives>   <email xlink:type="simple">sportkomplex.chgu@yandex.ru</email> </contrib>  <contrib contrib-type="editor" id="editor2">  <contrib-id contrib-id-type="role">executive_editor</contrib-id>    <name-alternatives>  <name name-style="eastern" xml:lang="ru"> <surname>Яковлева</surname> <given-names>Татьяна Валериановна</given-names> </name>   </name-alternatives>   <email xlink:type="simple">info@interactive-plus.ru</email> </contrib>  </contrib-group>   <contrib-group>  <contrib contrib-type="member-of-organizing-committee" id="orgcomm1">    <name-alternatives>  <name name-style="eastern" xml:lang="ru"> <surname>Кожанов</surname> <given-names>Виктор Иванович</given-names> </name>   </name-alternatives>   </contrib>  <contrib contrib-type="member-of-organizing-committee" id="orgcomm2">    <name-alternatives>  <name name-style="eastern" xml:lang="ru"> <surname>Радина</surname> <given-names>Оксана Ивановна</given-names> </name>   </name-alternatives>   </contrib>  <contrib contrib-type="member-of-organizing-committee" id="orgcomm3">    <name-alternatives>  <name name-style="eastern" xml:lang="ru"> <surname>Краснова</surname> <given-names>Светлана Гурьевна</given-names> </name>   </name-alternatives>   </contrib>  <contrib contrib-type="member-of-organizing-committee" id="orgcomm4">    <name-alternatives>  <name name-style="eastern" xml:lang="ru"> <surname>Сорокоумова</surname> <given-names>Галина Вениаминовна</given-names> </name>   </name-alternatives>  <contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-5246-5200</contrib-id> </contrib>  </contrib-group>   <event>  <event-desc xml:lang="ru">Общество и наука: векторы развития</event-desc>   <event-desc xml:lang="en">Society and Science: Future Development</event-desc>   <conf-date> <day>04</day> <month>06</month> <year>2026</year> </conf-date>    <conf-loc xml:lang="ru">Чебоксары</conf-loc>  </event>   <publisher> <publisher-name>Центр научного сотрудничества «Интерактив плюс»</publisher-name> </publisher>    <pub-date date-type="collection" publication-format="electronic" iso-8601-date="1900"> <year>1900</year> </pub-date>    <permissions>   <copyright-statement xml:lang="ru">© 2026 Кузьмин С. Н.</copyright-statement>   <copyright-year>2026</copyright-year>  <copyright-holder xml:lang="ru">Кузьмин С. Н.</copyright-holder>      <license license-type="open-access" xlink:href="https://creativecommons.org/licenses/by/4.0/" xml:lang="ru" xlink:type="simple"> <license-p>Это произведение доступно по лицензии Creative Commons Attribution 4.0 International (CC BY 4.0)</license-p> </license>   </permissions>  </book-meta> <book-part book-part-type="conference-paper"> <book-part-meta>   <book-id custom-type="publisher-id" pub-id-type="custom">598894</book-id> <title-group>  <chapter-title xml:lang="ru">Методы интеллектуального анализа данных: тенденции и векторы роста</chapter-title>   </title-group>  <contrib-group>   <contrib contrib-type="author" id="author1">   <name-alternatives>  <name name-style="eastern" xml:lang="ru"> <surname>Кузьмин</surname> <given-names>Сергей Николаевич</given-names> </name>    </name-alternatives>  <email xlink:type="simple">S.Kuzmin2004@ya.ru</email> <xref ref-type="aff" rid="aff1"/> </contrib>     <contrib id="contrib2"> <contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-8825-0172</contrib-id>  <name-alternatives>  <name name-style="eastern" xml:lang="ru"> <surname>Сластихина</surname> <given-names>Мария Дмитриевна</given-names> </name>    </name-alternatives>   <role xml:lang="ru">Научный руководитель</role>    <email xlink:type="simple">Masha-fat@yandex.ru</email> <xref ref-type="aff" rid="aff1"/> </contrib>    <aff-alternatives id="aff1">   <aff xml:lang="ru">  <institution>ФГБОУ ВО «Саратовский государственный технический университет им. Гагарина Ю.А.»</institution>   <country>Россия</country> </aff>     </aff-alternatives>  </contrib-group>       <abstract xml:lang="ru"> <p>современный мир динамически меняющаяся система, в который данные – критически важный ресурс. Существуют тенденции роста как их количества, так и источников их производящих. Были проведены исследования и сравнения тенденций роста данных, и людей, занимающихся их обработкой. Чтобы минимизировать эффект, на сотрудников, создаются новейшие методы в сфере интеллектуального анализа данных. В данной статье были собраны актуальные тенденции методов интеллектуального анализа данных и графовых нейросетей. На основе собранных данных, были сделаны выводы и заявление о готовящемся вкладе автора в эту отрасль.</p> </abstract>           <kwd-group xml:lang="ru">  <kwd>нейронные сети</kwd>  <kwd>анализ данных</kwd>  <kwd>интеллектуальный анализ данных</kwd>  <kwd>анализ рынка</kwd>  <kwd>методы оптимизации</kwd>  <kwd>методы обработки данных</kwd>  </kwd-group>        </book-part-meta> </book-part> </front>  <back> <ref-list> <title>References</title>  <ref id="ref1"> <label>1</label> <citation-alternatives>  <mixed-citation xml:lang="ru">Statista. Volume of data/information created worldwide from 2010 to 2024. – URL: https://www.statista.com/statistics/871513/worldwide-data-created (дата обращения: 20.10.2025).</mixed-citation>    </citation-alternatives> <element-citation publication-type="web">   <article-title>Statista. Volume of data</article-title>         <ext-link ext-link-type="uri" xlink:href="https://www.statista.com/statistics/871513/worldwide-data-created">https://www.statista.com/statistics/871513/worldwide-data-created</ext-link>      </element-citation> </ref>  <ref id="ref2"> <label>2</label> <citation-alternatives>  <mixed-citation xml:lang="ru">International Data Corporation (IDC). Worldwide Global DataSphere Forecast. – URL: https://my.idc.com/getdoc.jsp?containerId=US53383425 (дата обращения: 20.10.2025).</mixed-citation>    </citation-alternatives> <element-citation publication-type="web">   <article-title>International Data Corporation (IDC). Worldwide Global DataSphere Forecast</article-title>         <ext-link ext-link-type="uri" xlink:href="https://my.idc.com/getdoc.jsp?containerId=US53383425">https://my.idc.com/getdoc.jsp?containerId=US53383425</ext-link>      </element-citation> </ref>  <ref id="ref3"> <label>3</label> <citation-alternatives>  <mixed-citation xml:lang="ru">DemandSage. Big Data Statistics and Trends. – URL: https://www.demandsage.com/big-data-statistics (дата обращения: 21.10.2025).</mixed-citation>    </citation-alternatives> <element-citation publication-type="web">   <article-title>DemandSage. Big Data Statistics and Trends</article-title>         <ext-link ext-link-type="uri" xlink:href="https://www.demandsage.com/big-data-statistics">https://www.demandsage.com/big-data-statistics</ext-link>      </element-citation> </ref>  <ref id="ref4"> <label>4</label> <citation-alternatives>  <mixed-citation xml:lang="ru">Zipdo. Education Report 2025. – URL: https://zipdo.co (дата обращения: 21.10.2025).</mixed-citation>    </citation-alternatives> <element-citation publication-type="web">   <article-title>Zipdo. Education Report 2025</article-title>         <ext-link ext-link-type="uri" xlink:href="https://zipdo.co">https://zipdo.co</ext-link>      </element-citation> </ref>  <ref id="ref5"> <label>5</label> <citation-alternatives>  <mixed-citation xml:lang="ru">Zippia. Job Outlook for Data Analysts in the United States. – URL: https://www.zippia.com/data-analyst-jobs/trends (дата обращения: 22.10.2025).</mixed-citation>    </citation-alternatives> <element-citation publication-type="web">   <article-title>Zippia. Job Outlook for Data Analysts in the United States</article-title>         <ext-link ext-link-type="uri" xlink:href="https://www.zippia.com/data-analyst-jobs/trends">https://www.zippia.com/data-analyst-jobs/trends</ext-link>      </element-citation> </ref>  <ref id="ref6"> <label>6</label> <citation-alternatives>  <mixed-citation xml:lang="ru">Wu Y., Zhang X., Lin J. High-Utility Itemset Mining: A Survey // arXiv preprint arXiv:2204.09888. – 2022 – URL: https://arxiv.org/abs/2204.09888 (дата обращения: 22.10.2025).</mixed-citation>    </citation-alternatives> <element-citation publication-type="web">  <person-group person-group-type="author">  <name> <surname>Wu</surname> <given-names>Y.</given-names> </name>  <name> <surname>Zhang</surname> <given-names>X.</given-names> </name>  <name> <surname>Lin</surname> <given-names>J.</given-names> </name>  </person-group>   <article-title>High-Utility Itemset Mining: A Survey</article-title> <source>arXiv preprint arXiv:2204</source>        <ext-link ext-link-type="uri" xlink:href="https://arxiv.org/abs/2204.09888">https://arxiv.org/abs/2204.09888</ext-link>      </element-citation> </ref>  <ref id="ref7"> <label>7</label> <citation-alternatives>  <mixed-citation xml:lang="ru">Lin J., Gan W., Fournier-Viger P. Advances in High-Utility Pattern Mining // Artificial Intelligence Review. – 2024 – URL: https://link.springer.com/article/10.1007/s10462–024–10726–1 (дата обращения: 22.10.2025).</mixed-citation>    </citation-alternatives> <element-citation publication-type="web">  <person-group person-group-type="author">  <name> <surname>Lin</surname> <given-names>J.</given-names> </name>  <name> <surname>Gan</surname> <given-names>W.</given-names> </name>  <name> <surname>Fournier-Viger</surname> <given-names>P.</given-names> </name>  </person-group>   <article-title>Advances in High-Utility Pattern Mining</article-title> <source>Artificial Intelligence Review</source> <year>2024</year>       <ext-link ext-link-type="uri" xlink:href="https://link.springer.com/article/10.1007/s10462–024–10726–1">https://link.springer.com/article/10.1007/s10462–024–10726–1</ext-link>      </element-citation> </ref>  <ref id="ref8"> <label>8</label> <citation-alternatives>  <mixed-citation xml:lang="ru">Gan W., Lin J., Fournier-Viger P. Top-k High Utility Itemset Mining // arXiv preprint arXiv:2303.14510. – 2023 – URL: https://arxiv.org/abs/2303.14510 (дата обращения: 22.10.2025).</mixed-citation>    </citation-alternatives> <element-citation publication-type="web">  <person-group person-group-type="author">  <name> <surname>Gan</surname> <given-names>W.</given-names> </name>  <name> <surname>Lin</surname> <given-names>J.</given-names> </name>  <name> <surname>Fournier-Viger</surname> <given-names>P.</given-names> </name>  </person-group>   <article-title>Top-k High Utility Itemset Mining</article-title> <source>arXiv preprint arXiv:2303</source>        <ext-link ext-link-type="uri" xlink:href="https://arxiv.org/abs/2303.14510">https://arxiv.org/abs/2303.14510</ext-link>      </element-citation> </ref>  <ref id="ref9"> <label>9</label> <citation-alternatives>  <mixed-citation xml:lang="ru">Zhang Y. et al. Incremental High Average-Utility Itemset Mining // arXiv preprint arXiv:2407.11425. – 2024 – URL: https://arxiv.org/abs/2407.11425 ;</mixed-citation>    </citation-alternatives> <element-citation publication-type="web">  <person-group person-group-type="author">  <name> <surname>Zhang</surname> <given-names>Y.</given-names> </name>  </person-group>   <article-title>et al. Incremental High Average-Utility Itemset Mining</article-title> <source>arXiv preprint arXiv:2407</source>        <ext-link ext-link-type="uri" xlink:href="https://arxiv.org/abs/2407.11425">https://arxiv.org/abs/2407.11425</ext-link>      </element-citation> </ref>  <ref id="ref10"> <label>10</label> <citation-alternatives>  <mixed-citation xml:lang="ru">Scientific Reports. – 2024 – URL: https://www.nature.com/articles/s41598–024–60279–0 ; – 2024 – DOI: 10.1038/s41598–024–60279–0 (дата обращения: 22.10.2025).</mixed-citation>    </citation-alternatives> <element-citation publication-type="web">   <article-title>Scientific Reports</article-title>       <pub-id pub-id-type="doi">10.1038/s41598–024–60279–0</pub-id>  <ext-link ext-link-type="uri" xlink:href="https://www.nature.com/articles/s41598–024–60279–0">https://www.nature.com/articles/s41598–024–60279–0</ext-link>      </element-citation> </ref>  <ref id="ref11"> <label>11</label> <citation-alternatives>  <mixed-citation xml:lang="ru">Lin J., Gan W., Fournier-Viger P. Parallel High-Utility Itemset Mining // IEEE Transactions on Knowledge and Data Engineering. – 2023 – DOI: 10.1109/TKDE.2023.3290371. – URL: https://ieeexplore.ieee.org/document/10167780 (дата обращения: 22.10.2025).</mixed-citation>    </citation-alternatives> <element-citation publication-type="web">  <person-group person-group-type="author">  <name> <surname>Lin</surname> <given-names>J.</given-names> </name>  <name> <surname>Gan</surname> <given-names>W.</given-names> </name>  <name> <surname>Fournier-Viger</surname> <given-names>P.</given-names> </name>  </person-group>   <article-title>Parallel High-Utility Itemset Mining</article-title> <source>IEEE Transactions on Knowledge and Data Engineering</source> <year>2023</year>     <pub-id pub-id-type="doi">10.1109/TKDE.2023.3290371</pub-id>  <ext-link ext-link-type="uri" xlink:href="https://ieeexplore.ieee.org/document/10167780">https://ieeexplore.ieee.org/document/10167780</ext-link>      </element-citation> </ref>  <ref id="ref12"> <label>12</label> <citation-alternatives>  <mixed-citation xml:lang="ru">Ahmed A., Hussein S. High Utility Mining in Dynamic Databases // Iraqi Journal of Intelligent Computing and Informatics. – 2025 – Vol. 4, No. 2. – P. 172–181. – DOI: 10.52940/ijici.v4i2.126 (дата обращения: 22.10.2025).</mixed-citation>    </citation-alternatives> <element-citation publication-type="other">  <person-group person-group-type="author">  <name> <surname>Ahmed</surname> <given-names>A.</given-names> </name>  <name> <surname>Hussein</surname> <given-names>S.</given-names> </name>  </person-group>   <article-title>High Utility Mining in Dynamic Databases</article-title> <source>Iraqi Journal of Intelligent Computing and Informatics</source> <year>2025</year> <volume>4</volume> <issue>2</issue> <fpage>172</fpage> <lpage>181</lpage> <pub-id pub-id-type="doi">10.52940/ijici.v4i2.126</pub-id>        </element-citation> </ref>  <ref id="ref13"> <label>13</label> <citation-alternatives>  <mixed-citation xml:lang="ru">Dong Y. et al. Tutorial on Fairness in Graph Neural Networks // arXiv preprint arXiv:2204.09888. – 2022 – URL: https://arxiv.org/abs/2204.09888 (дата обращения: 22.10.2025).</mixed-citation>    </citation-alternatives> <element-citation publication-type="web">  <person-group person-group-type="author">  <name> <surname>Dong</surname> <given-names>Y.</given-names> </name>  </person-group>   <article-title>et al. Tutorial on Fairness in Graph Neural Networks</article-title> <source>arXiv preprint arXiv:2204</source>        <ext-link ext-link-type="uri" xlink:href="https://arxiv.org/abs/2204.09888">https://arxiv.org/abs/2204.09888</ext-link>      </element-citation> </ref>  <ref id="ref14"> <label>14</label> <citation-alternatives>  <mixed-citation xml:lang="ru">Dong Y. ICDM 2022 Tutorial: Fair Graph Mining [Электронный ресурс]. – URL: https://yushundong.github.io/icdm_tutorial_2022.pdf (дата обращения: 22.10.2025).</mixed-citation>    </citation-alternatives> <element-citation publication-type="web">  <person-group person-group-type="author">  <name> <surname>Dong</surname> <given-names>Y.</given-names> </name>  </person-group>   <article-title>ICDM 2022 Tutorial: Fair Graph Mining</article-title>         <ext-link ext-link-type="uri" xlink:href="https://yushundong.github.io/icdm_tutorial_2022.pdf">https://yushundong.github.io/icdm_tutorial_2022.pdf</ext-link>      </element-citation> </ref>  <ref id="ref15"> <label>15</label> <citation-alternatives>  <mixed-citation xml:lang="ru">Gomes R., Bifet A. Streaming High-Utility Pattern Mining // arXiv preprint arXiv:2204.03719. – 2022 – URL: https://arxiv.org/abs/2204.03719 ;</mixed-citation>    </citation-alternatives> <element-citation publication-type="web">  <person-group person-group-type="author">  <name> <surname>Gomes</surname> <given-names>R.</given-names> </name>  <name> <surname>Bifet</surname> <given-names>A.</given-names> </name>  </person-group>   <article-title>Streaming High-Utility Pattern Mining</article-title> <source>arXiv preprint arXiv:2204</source>        <ext-link ext-link-type="uri" xlink:href="https://arxiv.org/abs/2204.03719">https://arxiv.org/abs/2204.03719</ext-link>      </element-citation> </ref>  <ref id="ref16"> <label>16</label> <citation-alternatives>  <mixed-citation xml:lang="ru">Machine Learning. – 2023 – DOI: 10.1007/s10994–023–06353–6 (дата обращения: 22.10.2025).</mixed-citation>    </citation-alternatives> <element-citation publication-type="other">   <article-title>Machine Learning</article-title>       <pub-id pub-id-type="doi">10.1007/s10994–023–06353–6</pub-id>        </element-citation> </ref>  <ref id="ref17"> <label>17</label> <citation-alternatives>  <mixed-citation xml:lang="ru">Lin J., Gan W., Fournier-Viger P. Scented Utility Miner: Stream High Utility Itemset Mining // International Journal of Data Science and Analytics. – 2023 – URL: https://link.springer.com/article/10.1007/s41019–023–00229–4 ; – 2023 – DOI: 10.1007/s41019–023–00229–4 (дата обращения: 23.10.2025).</mixed-citation>    </citation-alternatives> <element-citation publication-type="web">  <person-group person-group-type="author">  <name> <surname>Lin</surname> <given-names>J.</given-names> </name>  <name> <surname>Gan</surname> <given-names>W.</given-names> </name>  <name> <surname>Fournier-Viger</surname> <given-names>P.</given-names> </name>  </person-group>   <article-title>Scented Utility Miner: Stream High Utility Itemset Mining</article-title> <source>International Journal of Data Science and Analytics</source> <year>2023</year>     <pub-id pub-id-type="doi">10.1007/s41019–023–00229–4</pub-id>  <ext-link ext-link-type="uri" xlink:href="https://link.springer.com/article/10.1007/s41019–023–00229–4">https://link.springer.com/article/10.1007/s41019–023–00229–4</ext-link>      </element-citation> </ref>  <ref id="ref18"> <label>18</label> <citation-alternatives>  <mixed-citation xml:lang="ru">Lin J., Gan W., Fournier-Viger P. Scented Utility Miner // International Journal of Data Science and Analytics. – 2023 – Иллюстрации к экспериментам (рис. 16–17) (дата обращения: 24.10.2025).</mixed-citation>    </citation-alternatives> <element-citation publication-type="other">  <person-group person-group-type="author">  <name> <surname>Lin</surname> <given-names>J.</given-names> </name>  <name> <surname>Gan</surname> <given-names>W.</given-names> </name>  <name> <surname>Fournier-Viger</surname> <given-names>P.</given-names> </name>  </person-group>   <article-title>Scented Utility Miner</article-title> <source>International Journal of Data Science and Analytics</source> <year>2023</year>   <fpage>16</fpage> <lpage>17</lpage>         </element-citation> </ref>  <ref id="ref19"> <label>19</label> <citation-alternatives>  <mixed-citation xml:lang="ru">Lin J., Gan W., Fournier-Viger P. Comparison of SUM and EIHI Algorithms // International Journal of Data Science and Analytics. – 2023 – Иллюстрации (рис. 21–22) (дата обращения: 24.10.2025).</mixed-citation>    </citation-alternatives> <element-citation publication-type="other">  <person-group person-group-type="author">  <name> <surname>Lin</surname> <given-names>J.</given-names> </name>  <name> <surname>Gan</surname> <given-names>W.</given-names> </name>  <name> <surname>Fournier-Viger</surname> <given-names>P.</given-names> </name>  </person-group>   <article-title>Comparison of SUM and EIHI Algorithms</article-title> <source>International Journal of Data Science and Analytics</source> <year>2023</year>   <fpage>21</fpage> <lpage>22</lpage>         </element-citation> </ref>  <ref id="ref20"> <label>20</label> <citation-alternatives>  <mixed-citation xml:lang="ru">Lin J., Gan W., Fournier-Viger P. Sliding Window-Based HUIM Algorithms // International Journal of Data Science and Analytics. – 2023 – Иллюстрации (рис. 23–24) (дата обращения: 24.10.2025).</mixed-citation>    </citation-alternatives> <element-citation publication-type="other">  <person-group person-group-type="author">  <name> <surname>Lin</surname> <given-names>J.</given-names> </name>  <name> <surname>Gan</surname> <given-names>W.</given-names> </name>  <name> <surname>Fournier-Viger</surname> <given-names>P.</given-names> </name>  </person-group>   <article-title>Sliding Window-Based HUIM Algorithms</article-title> <source>International Journal of Data Science and Analytics</source> <year>2023</year>   <fpage>23</fpage> <lpage>24</lpage>         </element-citation> </ref>  <ref id="ref21"> <label>21</label> <citation-alternatives>  <mixed-citation xml:lang="ru">Lin J., Gan W., Fournier-Viger P. Advances in High-Utility Pattern Mining // Artificial Intelligence Review. – 2024 – URL: https://link.springer.com/article/10.1007/s10462–024–10726–1 (дата обращения: 24.10.2025).</mixed-citation>    </citation-alternatives> <element-citation publication-type="web">  <person-group person-group-type="author">  <name> <surname>Lin</surname> <given-names>J.</given-names> </name>  <name> <surname>Gan</surname> <given-names>W.</given-names> </name>  <name> <surname>Fournier-Viger</surname> <given-names>P.</given-names> </name>  </person-group>   <article-title>Advances in High-Utility Pattern Mining</article-title> <source>Artificial Intelligence Review</source> <year>2024</year>       <ext-link ext-link-type="uri" xlink:href="https://link.springer.com/article/10.1007/s10462–024–10726–1">https://link.springer.com/article/10.1007/s10462–024–10726–1</ext-link>      </element-citation> </ref>  </ref-list> </back>  </book>