用简单可解释的表示法近似表达主题词的含义

IF 0.8 Q2 MATHEMATICS
R. V. Sulzhenko, B. V. Dobrov
{"title":"用简单可解释的表示法近似表达主题词的含义","authors":"R. V. Sulzhenko, B. V. Dobrov","doi":"10.1134/s1995080224600778","DOIUrl":null,"url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>The paper studies methods for approximating a user labeled topics by simple representations in a text classification problem. It is assumed that in real information systems the meaning of thematic categories can be approximated by a fairly simple interpreted expression. An algorithm for constructing formulas is considered, which constructs a representation of a text topic in the form of a Boolean formula—in fact, a request to a full-text information system. The algorithm is based on an optimized selection of various logical predicates with words and terms from the thesaurus. The presented algorithm has been compared with modern machine learning techniques on real collections with noisy expert markup. The described method can be used for text classification, expert evaluation of the content of the heading, assessment of the complexity of the description of the topic, and correcting the markup.</p>","PeriodicalId":46135,"journal":{"name":"Lobachevskii Journal of Mathematics","volume":null,"pages":null},"PeriodicalIF":0.8000,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Approximation of the Meaning for Thematic Subject Headings by Simple Interpretable Representations\",\"authors\":\"R. V. Sulzhenko, B. V. Dobrov\",\"doi\":\"10.1134/s1995080224600778\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<h3 data-test=\\\"abstract-sub-heading\\\">Abstract</h3><p>The paper studies methods for approximating a user labeled topics by simple representations in a text classification problem. It is assumed that in real information systems the meaning of thematic categories can be approximated by a fairly simple interpreted expression. An algorithm for constructing formulas is considered, which constructs a representation of a text topic in the form of a Boolean formula—in fact, a request to a full-text information system. The algorithm is based on an optimized selection of various logical predicates with words and terms from the thesaurus. The presented algorithm has been compared with modern machine learning techniques on real collections with noisy expert markup. The described method can be used for text classification, expert evaluation of the content of the heading, assessment of the complexity of the description of the topic, and correcting the markup.</p>\",\"PeriodicalId\":46135,\"journal\":{\"name\":\"Lobachevskii Journal of Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2024-07-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Lobachevskii Journal of Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1134/s1995080224600778\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Lobachevskii Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1134/s1995080224600778","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

摘要 本文研究了在文本分类问题中用简单表示法近似用户标注主题的方法。假设在实际信息系统中,主题类别的含义可以用相当简单的解释表达式来近似表示。我们考虑了一种构建公式的算法,它以布尔公式的形式构建文本主题的表示,实际上就是向全文信息系统提出请求。该算法基于从词库中优化选择各种逻辑谓词和词汇。所介绍的算法与现代机器学习技术在带有嘈杂专家标记的真实文集上进行了比较。所描述的方法可用于文本分类、标题内容的专家评估、主题描述复杂性评估以及修正标记。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Approximation of the Meaning for Thematic Subject Headings by Simple Interpretable Representations

Approximation of the Meaning for Thematic Subject Headings by Simple Interpretable Representations

Abstract

The paper studies methods for approximating a user labeled topics by simple representations in a text classification problem. It is assumed that in real information systems the meaning of thematic categories can be approximated by a fairly simple interpreted expression. An algorithm for constructing formulas is considered, which constructs a representation of a text topic in the form of a Boolean formula—in fact, a request to a full-text information system. The algorithm is based on an optimized selection of various logical predicates with words and terms from the thesaurus. The presented algorithm has been compared with modern machine learning techniques on real collections with noisy expert markup. The described method can be used for text classification, expert evaluation of the content of the heading, assessment of the complexity of the description of the topic, and correcting the markup.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.50
自引率
42.90%
发文量
127
期刊介绍: Lobachevskii Journal of Mathematics is an international peer reviewed journal published in collaboration with the Russian Academy of Sciences and Kazan Federal University. The journal covers mathematical topics associated with the name of famous Russian mathematician Nikolai Lobachevsky (Lobachevskii). The journal publishes research articles on geometry and topology, algebra, complex analysis, functional analysis, differential equations and mathematical physics, probability theory and stochastic processes, computational mathematics, mathematical modeling, numerical methods and program complexes, computer science, optimal control, and theory of algorithms as well as applied mathematics. The journal welcomes manuscripts from all countries in the English language.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信