<?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-2017-6-772-787</article-id><article-id custom-type="elpub" pub-id-type="custom">mais-614</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>Articles</subject></subj-group></article-categories><title-group><article-title>Анализ использования различных типов связей между терминами тезауруса, сгенерированного с помощью гибридных методов, в задачах классификации текстов</article-title><trans-title-group xml:lang="en"><trans-title>Analysis of Influence of Different Relations Types on the Quality of Thesaurus Application to Text Classification Problems</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-0002-6137-8643</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>Lagutina</surname><given-names>Nadezhda S.</given-names></name></name-alternatives><bio xml:lang="ru"><p>канд. физ.-мат. наук, доцент</p></bio><bio xml:lang="en"><p>PhD, associate professor</p></bio><email xlink:type="simple">lagutinans@rambler.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-0002-1742-3240</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>Lagutina</surname><given-names>Ksenia V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>студент</p></bio><bio xml:lang="en"><p>student</p></bio><email xlink:type="simple">lagutinakv@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-0002-5027-5024</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>Shchitov</surname><given-names>Ivan A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>аспирант</p></bio><bio xml:lang="en"><p>graduate student</p></bio><email xlink:type="simple">ivan.shchitov@e-werest.org</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-3984-8423</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>Paramonov</surname><given-names>Ilya V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>канд. физ.-мат. наук, доцент</p></bio><bio xml:lang="en"><p>PhD, associate professor</p></bio><email xlink:type="simple">Ilya.Paramonov@fruct.org</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>P.G. Demidov Yaroslavl State University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2017</year></pub-date><pub-date pub-type="epub"><day>18</day><month>12</month><year>2017</year></pub-date><volume>24</volume><issue>6</issue><fpage>772</fpage><lpage>787</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Лагутина Н.С., Лагутина К.В., Щитов И.А., Парамонов И.В., 2017</copyright-statement><copyright-year>2017</copyright-year><copyright-holder xml:lang="ru">Лагутина Н.С., Лагутина К.В., Щитов И.А., Парамонов И.В.</copyright-holder><copyright-holder xml:lang="en">Lagutina N.S., Lagutina K.V., Shchitov I.A., Paramonov I.V.</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/614">https://www.mais-journal.ru/jour/article/view/614</self-uri><abstract><p>Цель данной статьи — проанализировать, насколько эффективно могут применяться различные типы тезаурусных связей в задачах классификации текстов. Основой исследования является автоматически сгенерированный тезаурус предметной области, содержащий три типа связей: синонимические, иерархические и ассоциативные. Для генерации тезауруса используется гибридный метод, основанный на нескольких лингвистических и статистических алгоритмах выделения семантических связей и позволяющий создать тезаурус с достаточно большим числом терминов и связей между ними. Авторы рассматривают две задачи: тематическая классификация текстов и классификация больших новостных статей по тональности. Для решения каждой из них авторами были использованы два подхода, каждый из которых дополняет стандартные алгоритмы процедурой, применяющей связи тезауруса для определения семантических особенностей текстов. Подход к тематической классификации включает в себя стандартный алгоритм BM25 вида «обучение без учителя» и процедуру, использующую синонимические и иерархические связи тезауруса предметной области. Подход к классификации по тональности состоит из двух шагов. На первом шаге создается тезаурус, тональные веса терминов которого считаются в зависимости от частоты встречаемости в обучаемой выборке или от веса соседей по тезаурусу. На втором шаге тезаурус применяется для вычисления признаков слов из текстов и классификации текстов методом опорных векторов или наивным байесовским классификатором. В экспериментах с корпусами BBCSport, Reuters, PubMed и корпусом статей об американских иммигрантах авторы варьировали типы связей, которые участвуют в классификации, и степень их использования. Результаты экспериментов позволяют оценить эффективность применения тезаурусных связей для классификации текстов на естественном языке и определить, при каких условиях те или иные связи имеют большую значимость. В частности, наиболее полезными тезаурусными связями оказались синонимические и иерархические, так как они обеспечивает лучшее качество классификации.</p><p> </p></abstract><trans-abstract xml:lang="en"><p>The main purpose of the article is to analyze how effectively different types of thesaurus relations can be used for solutions of text classification tasks. The basis of the study is an automatically generated thesaurus of a subject area, that contains three types of relations: synonymous, hierarchical and associative. To generate the thesaurus the authors use a hybrid method based on several linguistic and statistical algorithms for extraction of semantic relations. The method allows to create a thesaurus with a sufficiently large number of terms and relations among them. The authors consider two problems: topical text classification and sentiment classification of large newspaper articles. To solve them, the authors developed two approaches that complement standard algorithms with a procedure that take into account thesaurus relations to determine semantic features of texts. The approach to topical classification includes the standard unsupervised BM25 algorithm and the procedure, that take into account synonymous and hierarchical relations of the thesaurus of the subject area. The approach to sentiment classification consists of two steps. At the first step, a thesaurus is created, whose terms weight polarities are calculated depending on the term occurrences in the training set or on the weights of related thesaurus terms. At the second step, the thesaurus is used to compute the features of words from texts and to classify texts by the algorithm SVM or Naive Bayes. In experiments with text corpora BBCSport, Reuters, PubMed and the corpus of articles about American immigrants, the authors varied the types of thesaurus relations that are involved in the classification and the degree of their use. The results of the experiments make it possible to evaluate the efficiency of the application of thesaurus relations for classification of raw texts and to determine under what conditions certain relationships affect more or less. In particular, the most useful thesaurus connections are synonymous and hierarchical, as they provide a better quality of classification.</p><p> </p></trans-abstract><kwd-group xml:lang="ru"><kwd>тезаурус</kwd><kwd>семантические отношения</kwd><kwd>тезаурусные связи</kwd><kwd>тематическая классификация</kwd><kwd>классификация по тональности</kwd></kwd-group><kwd-group xml:lang="en"><kwd>thesaurus</kwd><kwd>semantic relations</kwd><kwd>thesaurus relations</kwd><kwd>topical classification</kwd><kwd>sentiment classification</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">Masterman M., “Semantic message detection for machine translation, using an interlingua”, Proc. 1961 International Conf. on Machine Translation, 1961, 438–475.</mixed-citation><mixed-citation xml:lang="en">Masterman M., “Semantic message detection for machine translation, using an interlingua”, Proc. 1961 International Conf. on Machine Translation, 1961, 438–475.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Loukachevitch N., Dobrov B., “The Sociopolitical Thesaurus as a resource for automatic document processing in Russian”, Terminology, 21:2 (2015), 237–262.</mixed-citation><mixed-citation xml:lang="en">Loukachevitch N., Dobrov B., “The Sociopolitical Thesaurus as a resource for automatic document processing in Russian”, Terminology, 21:2 (2015), 237–262.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Aitchison J., Clarke S.D., “The thesaurus: a historical viewpoint, with a look to the future”, Cataloging and classification quarterly, 37:3–4 (2004), 5–21.</mixed-citation><mixed-citation xml:lang="en">Aitchison J., Clarke S.D., “The thesaurus: a historical viewpoint, with a look to the future”, Cataloging and classification quarterly, 37:3–4 (2004), 5–21.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Лукашевич Н. В., Тезаурусы в задачах информационного поиска, Издательство МГУ, М., 2011, 512 с.</mixed-citation><mixed-citation xml:lang="en">Lukashevich N. V., Tezaurusy v zadachah informacionnogo poiska, Izdatelstvo MGU, Moskow, 2011, 512 pp., (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Willis C., Losee R., “A random walk on an ontology: Using thesaurus structure for automatic subject indexing”, Journal of the American Society for Information Science and Technology, 64:7 (2013), 1330–1344.</mixed-citation><mixed-citation xml:lang="en">Willis C., Losee R., “A random walk on an ontology: Using thesaurus structure for automatic subject indexing”, Journal of the American Society for Information Science and Technology, 64:7 (2013), 1330–1344.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">V´allez M., Pedraza-Jim´enez R., Codina L., Blanco S., Rovira C, “A semi-automatic indexing system based on embedded information in HTML documents”, Library Hi Tech, 33:2 (2015), 195–210.</mixed-citation><mixed-citation xml:lang="en">V´allez M., Pedraza-Jim´enez R., Codina L., Blanco S., Rovira C, “A semi-automatic indexing system based on embedded information in HTML documents”, Library Hi Tech, 33:2 (2015), 195–210.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Loukachevitch N., Nokel M., Ivanov K., Combining Thesaurus Knowledge and Probabilistic Topic Models, 2017, https://arxiv.org/abs/1707.09816.</mixed-citation><mixed-citation xml:lang="en">Loukachevitch N., Nokel M., Ivanov K., Combining Thesaurus Knowledge and Probabilistic Topic Models, 2017, https://arxiv.org/abs/1707.09816.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Sanchez-Pi N., Mart´ı L. Garcia A. C. B., “Improving ontology-based text classification: An occupational health and security application”, Journal of Applied Logic, 17 (2016), 48–58.</mixed-citation><mixed-citation xml:lang="en">Sanchez-Pi N., Mart´ı L. Garcia A. C. B., “Improving ontology-based text classification: An occupational health and security application”, Journal of Applied Logic, 17 (2016), 48–58.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Bollegala D., Weir D., Carroll J., “Cross-domain sentiment classification using a sentiment sensitive thesaurus”, IEEE transactions on knowledge and data engineering, 25:8 (2013), 1719–1731.</mixed-citation><mixed-citation xml:lang="en">Bollegala D., Weir D., Carroll J., “Cross-domain sentiment classification using a sentiment sensitive thesaurus”, IEEE transactions on knowledge and data engineering, 25:8 (2013), 1719–1731.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Sparck Jones K., Walker S., Robertson S.E., “A probabilistic model of information retrieval: development and comparative experiments: Part 2”, Information Processing and Management, 36:6 (2000), 809–840.</mixed-citation><mixed-citation xml:lang="en">Sparck Jones K., Walker S., Robertson S.E., “A probabilistic model of information retrieval: development and comparative experiments: Part 2”, Information Processing and Management, 36:6 (2000), 809–840.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Лагутина Н. С., Лагутина К. В., Мамедов Э. И., Парамонов И. В., “Методические аспекты выделения семантических отношений для автоматической генерации специализированных тезаурусов и их оценки”, Моделирование и анализ информационных систем, 23:6 (2016), 826–840</mixed-citation><mixed-citation xml:lang="en">Lagutina N. S., Lagutina K. V., Mamedov E. I., Paramonov I. V., “Methodological aspects of semantic relationship extraction for automatic thesaurus generation”, Modeling and Analysis of Information Systems, 23:6 (2016), 826–840, (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Mihalcea R., Tarau P., “TextRank: Bringing order into texts”, Proceedings of Empirical Methods in Natural Language Processing – EMNLP, ACL, Barcelona, Spain, 2004, 404– 411.</mixed-citation><mixed-citation xml:lang="en">Mihalcea R., Tarau P., “TextRank: Bringing order into texts”, Proceedings of Empirical Methods in Natural Language Processing – EMNLP, ACL, Barcelona, Spain, 2004, 404– 411.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Trieschnigg D., Pezik P., Lee V., De Jong F., Kraaij W., Rebholz-Schuhmann D., “MeSH Up: effective MeSH text classification for improved document retrieval”, Bioinformatics, 25:11 (2009), 1412–1418.</mixed-citation><mixed-citation xml:lang="en">Trieschnigg D., Pezik P., Lee V., De Jong F., Kraaij W., Rebholz-Schuhmann D., “MeSH Up: effective MeSH text classification for improved document retrieval”, Bioinformatics, 25:11 (2009), 1412–1418.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Aggarwal C., Zhai C., “A survey of text classification algorithms”, Mining text data, Springer-Verlag, New York, 2012, 163–222.</mixed-citation><mixed-citation xml:lang="en">Aggarwal C., Zhai C., “A survey of text classification algorithms”, Mining text data, Springer-Verlag, New York, 2012, 163–222.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Grimmer J., Stewart B., “Text as data: The promise and pitfalls of automatic content analysis methods for political texts”, Political analysis, 21:3 (2013), 267–297.</mixed-citation><mixed-citation xml:lang="en">Grimmer J., Stewart B., “Text as data: The promise and pitfalls of automatic content analysis methods for political texts”, Political analysis, 21:3 (2013), 267–297.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Ravi K., Ravi V., “A survey on opinion mining and sentiment analysis: tasks, approaches and applications”, Knowledge-Based Systems, 89 (2015), 14–46.</mixed-citation><mixed-citation xml:lang="en">Ravi K., Ravi V., “A survey on opinion mining and sentiment analysis: tasks, approaches and applications”, Knowledge-Based Systems, 89 (2015), 14–46.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Junker M., Hoch R., Dengel A., “On the evaluation of document analysis components by recall, precision, and accuracy”, Proceedings of the Fifth International Conference on Document Analysis and Recognition, IEEE, 1999, 713–716.</mixed-citation><mixed-citation xml:lang="en">Junker M., Hoch R., Dengel A., “On the evaluation of document analysis components by recall, precision, and accuracy”, Proceedings of the Fifth International Conference on Document Analysis and Recognition, IEEE, 1999, 713–716.</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>
