<?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">sibsutis</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник СибГУТИ</journal-title><trans-title-group xml:lang="en"><trans-title>The Herald of the Siberian State University of Telecommunications and Information Science</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1998-6920</issn><publisher><publisher-name>СибГУТИ</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.55648/1998-6920-2025-19-3-122-138</article-id><article-id custom-type="elpub" pub-id-type="custom">sibsutis-987</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></article-categories><title-group><article-title>Решение задачи классификации слухов в интернет-новостях</article-title><trans-title-group xml:lang="en"><trans-title>Solving the problem of rumors classification in online news</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-0004-5786-8107</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>Khudobin</surname><given-names>Alexander Dmitrievich</given-names></name></name-alternatives><bio xml:lang="ru"><p>Студент 2 курса магистратуры Воронежского государственного университета, факультет — Прикладной математики, информатики и механики, направление — прикладная информатика</p></bio><bio xml:lang="en"><p>A second-year master's student at Voronezh State University, Faculty of Applied Mathematics, Informatics and Mechanics, majoring in Applied Informatics</p></bio><email xlink:type="simple">2001kad@mail.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-0040-5764</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>Voronina</surname><given-names>Irina Evgenievna</given-names></name></name-alternatives><bio xml:lang="ru"><p>д-р. техн. наук, доц., профессор кафедры программного обеспечения и администрирования информационных систем Воронежского государственного университета</p></bio><bio xml:lang="en"/><email xlink:type="simple">irina.voronina@gmail.com</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>Voronezh State University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2025</year></pub-date><pub-date pub-type="epub"><day>30</day><month>09</month><year>2025</year></pub-date><volume>19</volume><issue>3</issue><issue-title>Вестник СибГУТИ</issue-title><fpage>122</fpage><lpage>138</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Худобин А.Д., Воронина И.Е., 2025</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="ru">Худобин А.Д., Воронина И.Е.</copyright-holder><copyright-holder xml:lang="en">Khudobin A.D., Voronina I.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.sibsutis.ru/jour/article/view/987">https://vestnik.sibsutis.ru/jour/article/view/987</self-uri><abstract><p>Рассматривается подход к решению задачи классификации слухов в новостях на основе продукционных правил. Непроверенная информация, появляющаяся на новостных сайтах, имеет характер информационного мусора и способна в отдельных случаях нанести существенный вред потребителям. Решаемая задача носит нетривиальный характер, актуальна и не имеет стандартного решения.</p></abstract><trans-abstract xml:lang="en"><p>The article considers an approach to solving the problem of classifying rumors in thenews based on production rules. Unverified information appearing on news sites has the natureof information garbage and is capable of causing significant harm to consumers in some cases.The problem being solved is non-trivial, relevant and has no standard solution.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>слухи</kwd><kwd>классификация</kwd><kwd>LLM</kwd><kwd>машинное обучение</kwd><kwd>нейронные сети</kwd><kwd>TF-IDF</kwd><kwd>Bag-of-words</kwd><kwd>Word2Vec</kwd><kwd>N-граммы</kwd><kwd>продукционные правила</kwd><kwd>DeepSeek-R1</kwd><kwd>e5-large</kwd></kwd-group><kwd-group xml:lang="en"><kwd>rumors</kwd><kwd>classification</kwd><kwd>LLM</kwd><kwd>machine learning</kwd><kwd>neural networks</kwd><kwd>TF-IDF</kwd><kwd>Bag-of-words</kwd><kwd>Word2Vec</kwd><kwd>N-grams</kwd><kwd>production rules</kwd><kwd>DeepSeek-R1</kwd><kwd>e5-large</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">Лингвистическая экспертиза в трудах Воронежской ассоциации экспертов-лингвистов : монография / Ж. В. Грачева [и др.] ; под ред. М. Е. Новичихиной, А. В. Рудаковой. – Воронеж : Издательский дом ВГУ, 2023. – 357 с.</mixed-citation><mixed-citation xml:lang="en">Gracheva Zh. V. Lingvisticheskaja jekspertiza v trudah Voronezhskoj associacii jekspertov-lingvistov : monografija [Linguistic expertise in the works of the Voronezh Association of Linguistic Experts: monograph]. Voronezh, Izdatel'skij dom Voronezhskogo gosudarstvennogo universiteta, 2023. 357 p.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Худобин А. Д. TF-IDF, Bag-of-words, Word2Vec и N-граммы для решения задачи классификации слухов в новостях / А. Д. Худобин, И. Е. Воронина // Информатика: проблемы, методы, технологии. – 2024. – С. 1285–1294.</mixed-citation><mixed-citation xml:lang="en">Khudobin A. D., Voronina I. E. TF-IDF, Bag-of-words, Word2Vec i N-grammy dlja reshenija zadachi klassifikacii sluhov v novostjah [TF-IDF, Bag-of-words, Word2Vec and N-grams for News Rumors Classification Problem]. Informatika: problemy, metody, tehnologii, 2024, pp. 1285–1294.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Осетрова Е. В. Слухи в парадигме лингвистической генристики / Е. В. Осетрова // Жанры речи. – 2015. – Т. 12, № 2. – С. 80–89.</mixed-citation><mixed-citation xml:lang="en">Osetrova E. V. Rumors in the paradigm of linguistic genristics. International Journal “Speech Genres”, 2015, vol. 12, no. 2, pp. 80–89.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Osetrova E. V. Rumours as a Subject of Scientific Analysis: Social Psychology, History, Philology / E. V. Osetrova // Journal of Siberian Federal University. Humanities &amp; Social Sciences. – 2013. – № 9. – С. 1265–1280.</mixed-citation><mixed-citation xml:lang="en">Osetrova E. V. Rumours as a Subject of Scientific Analysis: Social Psychology, History, Philology. Journal of Siberian Federal University. Humanities &amp; Social Sciences, 2013, no. 9, pp. 1265–1280.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Русакова И. Б. Концепт слух и его репрезентация в русских и английских пословицах / И. Б. Русакова // Международный аспирантский вестник. Русский язык за рубежом. – 2024. – № 1. – С. 60–67.</mixed-citation><mixed-citation xml:lang="en">Rusakova I. B. Koncept sluh i ego reprezentacija v russkih i anglijskih poslovicah [The concept of hearing and its representation in Russian and English proverbs]. Mezhdunarodnyj aspirantskij vestnik. Russkij jazyk za rubezhom, 2024, no. 1, pp. 60–67.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Иванова С. В. Жанр светских слухов в дискурсе англоязычных массмедиа / С. В. Иванова, Г. Ш Хакимова // Russian Journal of Linguistics. – 2020. – Т. 24, № 2. – С. 386–418.</mixed-citation><mixed-citation xml:lang="en">Ivanova S. V, Khakimova G. Celebrity gossip as a genre in English‐language mass media discourse. Russian Journal of Linguistics, 2020, vol. 24, no. 2, pp. 386–418.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Khakimova G. Rumour Text Constructing Techniques In Media Discourse: Case Study Of Gossip Columns / The European Proceedings of Social and Behavioural Sciences. – 2019. – С. 346–357.</mixed-citation><mixed-citation xml:lang="en">Khakimova G. Rumour Text Constructing Techniques In Media Discourse: Case Study Of Gossip Columns. The European Proceedings of Social and Behavioural Sciences, 2019, pp. 346–357.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Хакимова Г. Ш. Концепт «слух» в фокусе лексикографического анализа. Часть 1 / Г. Ш. Хакимова // Вестник ЮУрГУ. Серия «Лингвистика». – 2016. – № 2. – С. 29–36.</mixed-citation><mixed-citation xml:lang="en">Khakimova G. CONCEPT “RUMOUR” IN TERMS OF LEXICOGRAPHIC ANALYSIS. PART 1. Bulletin of the South Ural State University series Linguistics, 2016, vol. 13, no. 2, pp, 29–36</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Хакимова Г. Ш. Концепт «слух» в фокусе лексикографического анализа. Часть 2 / Г. Ш. Хакимова // Вестник ЮУрГУ. Серия «Лингвистика». – 2016. – № 3. – С. 38–46.</mixed-citation><mixed-citation xml:lang="en">Khakimova G. CONCEPT “RUMOUR” IN TERMS OF LEXICOGRAPHIC ANALYSIS. PART 2. Bulletin of the South Ural State University series Linguistics, 2016, vol. 13, no. 3, pp, 38–46</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Li X. Dice Loss for Data-imbalanced NLP Tasks / X. Li [и др.] // Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics. – 2020. – С. 465–476.</mixed-citation><mixed-citation xml:lang="en">Pastrevich M. K., Voronina I. E. Avtomaticheskaja klassifikacija rechevoj agressii [Automatic classification of speech aggression]. Aktual'nye problemy prikladnoj matematiki, informatiki i mehaniki, 2023, pp. 1359–1365.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Duncan J. The Sensitivity of Word Embeddings-based Author Detection Models to Semantic-preserving Adversarial Perturbations / J. Duncan [и др.] // arXiv preprint arXiv:2102.11917. – 2021. – 22 с.</mixed-citation><mixed-citation xml:lang="en">Roumeliotis K. I., Tselika N. D., Nasiopoulos D. K. Next-Generation Spam Filtering: Comparative Fine-Tuning of LLMs, NLPs, and CNN Models for Email Spam Classification. Electronics, 2024. vol. 13, no. 11, pp. 2034–2058.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Хобсон Л. Обработка естественного языка в действии / Л. Хобсон, Х. Хапке, К. Ховард. – СПб.: Питер, 2020. – 576 с.</mixed-citation><mixed-citation xml:lang="en">Li X. et. al. Dice Loss for Data-imbalanced NLP Tasks. Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, 2020, pp. 465–476.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Mohare R. V. ‘Bag of Words’ to ‘Bag of Concepts’: Improving Text Categorization using SVM / R. V. Mohare [и др.] // Nanotechnology Perceptions. – 2024. – № S6. – С. 419–426.</mixed-citation><mixed-citation xml:lang="en">Khudobin A. D., Voronina I. E. Podhod k resheniju zadachi klassifikacii sluhov v internet-novostjah [An approach to solving the problem of rumors classification in online news]. Aktual'nye problemy prikladnoj matematiki, informatiki i mehaniki, 2024, pp. 334–340.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Suhasini V. A Hybrid TF-IDF and N-Grams Based Feature Extraction Approach for Accurate Detection of Fake News on Twitter Data / V. Suhasini, Dr. N. Vimala // Turkish Journal of Computer and Mathematics Education. – 2021. – vol. 12, no. 06. – С. 5710–5723.</mixed-citation><mixed-citation xml:lang="en">Duncan J. et. al. The Sensitivity of Word Embeddings-based Author Detection Models to Semantic-preserving Adversarial Perturbations. 2021, 22 p., available at: https://arxiv.org/pdf/2102.11917 (accessed 13.04.2025).</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Cahyani D. E. Performance comparison of TF-IDF and Word2Vec models for emotion text classification / D. E. Cahyani, I. Patasik // Bulletin of Electrical Engineering and Informatics. – 2021. – № 5 – С. 2780–2788.</mixed-citation><mixed-citation xml:lang="en">Policyna, E. V., Policyn S. A., Porechnyj A. S., Rykunov A. N. Analiz kachestva raboty i rasshirenie vozmozhnostej instrumentov morfologicheskogo analiza tekstov na russkom jazyke [Analysis of the quality of work and expansion of the capabilities of tools for morphological analysis of texts in Russian]. Vestnik Voronezhskogo gosudarstvennogo universiteta. Serija: Sistemnyj analiz i informacionnye tehnologii, 2023, no. 2, pp. 171–180.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Abubakar H. D. Sentiment Classification: Review of Text Vectorization Methods: Bag of Words, Tf-Idf, Word2vec and Doc2vec / H. D. Abubakar, M. Umar, M. A. Bakale // Sule Lamido University Journal of Science &amp; Technology. – 2022. – № 1 &amp; 2. – С. 27–33.</mixed-citation><mixed-citation xml:lang="en">Hobson L., Hapke H., Hovard K. Obrabotka estestvennogo jazyka v dejstvii [Natural Language Processing in Action]. Saint Petersburg, Piter, 2020, 576 p.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Линькова Г. В. Сравнение методов векторных представлений текстов в задачах классификации вакансий / Г. В. Линькова, Д. С. Ботов // Научное сообщество студентов XXI столетия. Технические науки. – 2018. – № 6 – С. 96–113.</mixed-citation><mixed-citation xml:lang="en">Mohare R. V. et. al. ‘Bag of Words’ to ‘Bag of Concepts’: Improving Text Categorization using SVM. Nanotechnology Perceptions, no. S6, pp.419–426.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Santos R. F. Long Term-short Memory Neural Networks and Word2vec for Self-admitted Technical Debt Detection / R. F. Santos [и др.] // Proceedings of the 22nd International Conference on Enterprise Information Systems. – 2020. – С. 157–165.</mixed-citation><mixed-citation xml:lang="en">Suhasini V., Vimala Dr. N. A Hybrid TF-IDF and N-Grams Based Feature Extraction Approach for Accurate Detection of Fake News on Twitter Data. Turkish Journal of Computer and Mathematics Education, 2021, vol. 12, no. 06, pp. 5710–5723.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Devlin J. BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding / J. Devlin [и др.] // Proceedings of NAACL-HLT. – 2019. С. 4171–4186.</mixed-citation><mixed-citation xml:lang="en">Cahyani D. E., Patasik I. Performance comparison of TF-IDF and Word2Vec models for emotion text classification. Bulletin of Electrical Engineering and Informatics, 2021, no. 5, pp. 2780–2788.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Wang L. Multilingual E5 Text Embeddings: A Technical Report / L. Wang [и др.] // arXiv pre-print arXiv:2402.05672. – 2024. – 6 с.</mixed-citation><mixed-citation xml:lang="en">Abubakar H. D., Umar M., Bakale M. A. Sentiment Classification: Review of Text Vectorization Methods: Bag of Words, Tf-Idf, Word2vec and Doc2vec. Sule Lamido University Journal of Science &amp; Technology, 2022, no. 1 &amp; 2, pp. 27–33.</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Bi X. DeepSeek LLM: Scaling Open-Source Language Models with Longtermism / X. Bi [и др.] // arXiv preprint arXiv:2401.02954. – 2024. – 48 с.</mixed-citation><mixed-citation xml:lang="en">Lin'kova G. V., Botov D. S. Sravnenie metodov vektornyh predstavlenij tekstov v zadachah klassifikacii vakansij [Comparison of Text Vector Representation Methods in Job Classification Problems]. Nauchnoe soobshhestvo studentov XXI stoletija. Tehnicheskie nauki, 2018, no. 6, pp. 96–113.</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">Santos R. F. et. al. Long Term-short Memory Neural Networks and Word2vec for Self-admitted Technical Debt Detection. Proceedings of the 22nd International Conference on Enterprise Information Systems, 2020, pp. 157–165.</mixed-citation><mixed-citation xml:lang="en">Santos R. F. et. al. Long Term-short Memory Neural Networks and Word2vec for Self-admitted Technical Debt Detection. Proceedings of the 22nd International Conference on Enterprise Information Systems, 2020, pp. 157–165.</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">Devlin J. et. al. BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding Proceedings of NAACL-HLT, 2019, pp. 4171–4186.</mixed-citation><mixed-citation xml:lang="en">Devlin J. et. al. BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding Proceedings of NAACL-HLT, 2019, pp. 4171–4186.</mixed-citation></citation-alternatives></ref><ref id="cit24"><label>24</label><citation-alternatives><mixed-citation xml:lang="ru">Wang L. et. al. Multilingual E5 Text Embeddings: A Technical Report. 2024, 6 p., available at: https://arxiv.org/pdf/2402.05672 (accessed 13.04.2025).</mixed-citation><mixed-citation xml:lang="en">Wang L. et. al. Multilingual E5 Text Embeddings: A Technical Report. 2024, 6 p., available at: https://arxiv.org/pdf/2402.05672 (accessed 13.04.2025).</mixed-citation></citation-alternatives></ref><ref id="cit25"><label>25</label><citation-alternatives><mixed-citation xml:lang="ru">Bi X. et. al. DeepSeek LLM: Scaling Open-Source Language Models with Longtermism. 2024, 48 p., https://arxiv.org/pdf/2401.02954 (accessed 13.04.2025).</mixed-citation><mixed-citation xml:lang="en">Bi X. et. al. DeepSeek LLM: Scaling Open-Source Language Models with Longtermism. 2024, 48 p., https://arxiv.org/pdf/2401.02954 (accessed 13.04.2025).</mixed-citation></citation-alternatives></ref><ref id="cit26"><label>26</label><citation-alternatives><mixed-citation xml:lang="ru"></mixed-citation><mixed-citation xml:lang="en"></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>
