?
Exploring Pattern Structures of Syntactic Trees for Relation Extraction
P. 153–168.
In this paper we explore the possibility of defining an original pattern structure for managing syntactic trees. More precisely, we are interested in the extraction of relations such as drug-drug interactions (DDIs) in medical texts where sentences are represented as syntactic trees. In this specific pattern structure, called STPS, the similarity operator is based on rooted tree intersection. Moreover, we introduce “Lazy Pattern Structure Classification” (LPSC), which is a symbolic method able to extract and classify DDI sentences w.r.t. STPS. To decrease computation time, a projection and a set of tree-simplification operations are proposed. We evaluated the method by means of a 10-fold cross validation on the corpus of the DDI extraction challenge 2011, and we obtained very encouraging results that are reported at the end of the paper.
In book
Vol. 9113. , Springer, 2015.
П.Е. Белова, А.К. Сафарян, В кн.: Научно-практическая конференция с международным участием "Национальные и международные тенденции и перспективы развития судебной экспертизы". Сборник докладов.: Н. Новгород: Изд-во ННГУ им. Н.И. Лобачевского, 2024.
В данной статье представлено описание системы автоматического поиска и извлечения побуждений из текстов на русском языке FindImper, основанной на поиске глагольных форм и синтаксических связей. Алгоритм реализован на языке программирования Python с использованием библиотек для морфологического и синтаксического анализа и набора правил. Данный инструмент направлен на оптимизацию работы эксперта-лингвиста и доступен к использованию через веб-сайт ...
Added: January 30, 2026
Junyu B., Fei H., Huilin F. et al., International Journal of Approximate Reasoning 2025 Vol. 187 Article 109541
In Formal Concept Analysis (FCA), concept reduction serves as an important means of simplification. The application scenarios of concept reduction cover various aspects such as data mining, knowledge discovery, strategic decision-making, and rule learning. For symmetric formal contexts, a specialized class of concept reduction exists that can fully recover all knowledge. However, most existing concept ...
Added: December 1, 2025
Dudyrev E., Mariia Zueva, Kuznetsov S. et al., , in: FCA4AI 2024: The 12th International Workshop "What can FCA do for Artificial Intelligence?", October 19 2024, Santiago de Compostela, SpainVol. 3911.: CEUR Workshop Proceedings, 2024. P. 47–58.
Clustering aims at finding disjoint groups of similar objects in data and is one major task in Machine Learning. It is also gaining more attention in Formal Concept Analysis community in these last years. This paper proposes an original approach to the clustering of complex data based on Formal Concept Analysis (FCA) and Pattern Structures. ...
Added: April 30, 2025
CEUR Workshop Proceedings, 2024.
The eleven preceding editions of the FCA4AI Workshop showed that many researchers working in Articial Intelligence are deeply interested in a well-founded method for classication and data mining such as Formal Concept Analysis (see https://upriss.github.io/fca/fca.html).
The FCA4AI Workshop Series started with ECAI 2012 (Montpellier) and the last edition was co-located with IJCAI 2023 (Macao, China). The ...
Added: April 29, 2025
Колмогорова П. А., Куликова Е. Р., Человек: образ и сущность. Гуманитарные аспекты 2025 № 2(62) С. 139–155
В статье обсуждается вопрос оценки трудности текстов, сопровождающих виртуальный тур по Главному музейному комплексу Государственного Эрмитажа. Методика оценки трудности, в отличие от сложности как более объективной, поддающейся параметризации характеристики текста, представляется открытым вопросом. В статье описываются результаты пилотного эксперимента, в котором информанты оценивали тексты, выделяя и комментируя фрагменты, вызывающие затруднения. Анализ показал, что наиболее частыми ...
Added: November 8, 2024
Kolmogorova A., Куликова Е. Р., Колмогорова П. А., Текст. Книга. Книгоиздание 2025 № 38 С. 29–54
The article is devoted to the linguistic featuring of the texts of the Virtual visit to the State Hermitage Museum, available on the its official website. The purpose of the study is to analyze the set of lexical, morphological, syntactic and discursive metrics of the linguistic complexity of these texts in comparison with the same ...
Added: November 8, 2024
Sergei O. Kuznetsov, Parakal E. G., Lecture Notes in Networks and Systems 2023 Vol. 776 P. 423–434
Inherently explainable Machine Learning (ML) models are able to provide explanations for their predictions by virtue of their construction. The explanations of a ML model are more comprehensible if they are expressed in terms of its input features. Our paper proposes an inherently explainable pipeline for document classification using pattern structures and Abstract Meaning Representation ...
Added: February 5, 2024
Белова П.Е., Safaryan A., В кн.: Современный медиатекст и судебная экспертиза: междисциплинарные связи и экспертная оценка: сборник научных работ по итогам Международной научно-практической конференции «Современный медиатекст и судебная экспертиза: междисциплинарные связи и экспертная оценка».: М.: ООО «СОЮЗКНИГ», 2023. С. 46–56.
В статье представлено описание системы автоматического поиска и извлечения побуждений из текстов на русском языке FindImper, основанной на поиске глагольных форм, выражающих значение побуждения, и реализованной на языке Python с использованием библиотек для морфологического и синтаксического анализа и набора правил. ...
Added: October 29, 2023
Dudyrev E., Kuznetsov S., Napoli A., , in: FCA4AI 2023 What can FCA do for Artificial Intelligence 2023 Proceedings of the 11th International Workshop "What can FCA do for Artificial Intelligence?" co-located with the 32nd International Joint Conference on Artificial Intelligence (IJCAI 2023) Macao, S.A.R. China; August 20, 2023Vol. 3489.: CEUR-WS.org, 2023. P. 69–80.
Rule Learning and Formal Concept Analysis (FCA) are two fields of science that study similar topic yet speak in a very different terms. This paper describes rule-based machine learning models with FCA-based terminology which results in decision quiver model. A decision quiver, discussed in the paper, is a supervised machine learning model that is based ...
Added: October 4, 2023
Dudyrev E., Kuznetsov S., Napoli A., , in: 17th International Conference, ICFCA 2023, Kassel, Germany, July 17–21, 2023, Proceedings. Formal Concept Analysis, (LNCS, volume 13934).: Switzerland: Springer, 2023. P. 127–142.
In this paper we introduce and study description quivers as compact representations of concept lattices and respective ensembles of decision trees. Formally, description quivers are directed multigraphs where vertices represent concept intents and (multiple) edges represent generators of intents. We study some properties of description quivers and shed light on their use for describing state-of-the-art symbolic machine ...
Added: October 4, 2023
Ignatov D. I., Lobachevskii Journal of Mathematics 2023 No. 44 P. 137–146
We consider two ways how to compute the number of maximal antichains in the Boolean lattice on 𝑛 elements. The first one is based on full direct enumeration, while the second ones relies on concept lattices or Galois lattices (studied in Formal Concept Analysis, an applied branch of lattice theory) and the Dedekind–MacNeille completion of a partial ...
Added: June 13, 2023
Alimova I., Tutubalina E., Nikolenko S. I., IEEE Access 2022 Vol. 10 P. 1432–1439
Relation extraction (RE) aims to extract relational facts from plain text, which is essential to the biomedical research field with the rapid growth of biomedical literature and generally large volumes of biomedicine-related text coming from various sources. Numerous annotated corpora and state-of-the-art models have been introduced in the past five years. However, there are no ...
Added: April 10, 2023
Lukianchenko P., Gromov V., Beschastnov Y. et al., Вестник кибернетики 2022 Т. 4 № 48 С. 37–48
The study analyzes the time series of the number of new cases in the administrative courts
of the Russian Federation using two methods of time series grouping according to the chaotic, stochastic, and
regular structure. The first model is based on the entropy‒complexity plane, the second one is presented by the
attribute‒object graph. As a result, four groups ...
Added: March 20, 2023
Gromov V., Урманцева Н. Р., [б.и.], 2021.
В докладе рассматриваются подходы к прогнозированию на основе кластеризации, опирающиеся на методологию анализа формальных понятий. Методология применяется для кластеризации участков временного ряда с целью выделения характерных участков (мотивов), отвечающих больным с различной степенью засорённости фистулы. ...
Added: January 30, 2023
Ilya Semenkov, Sergei O. Kuznetsov, , in: Proceedings of the 9th International Workshop "What can FCA do for Artificial Intelligence?" (FCA4AI 2021)Vol. 2972.: CEUR-WS, 2021. P. 105–112.
This paper presents different versions of classification ensemble methods based on pattern structures. Each of these methods is described and tested on multiple datasets (including datasets with exclusively numerical and exclusively nominal features). As a baseline model Random Forest generation is used. For some classification tasks the classification algorithms based on pattern structures showed better ...
Added: December 19, 2022
Egurnov D., Точилкин Д. С., Ignatov D. I., , in: Complex Data Analytics with Formal Concept Analysis.: Springer, 2022. P. 239–258.
In this paper, we describe versions of triclustering algorithms adapted for efficient calculations in distributed environments with MapReduce model or parallelisation mechanism provided by modern programming languages. OAC-family of triclustering algorithms shows good parallelisation capabilities due to the independent processing of triples of a triadic formal context. We provide time and space complexity of the ...
Added: November 1, 2022
Springer, 2022.
FCA is an important formalism that is associated with a variety of research areas such as lattice theory, knowledge representation, data mining, machine learning, and semantic Web. It is successfully exploited in an increasing number of application domains such as software engineering, information retrieval, social network analysis, and bioinformatics. Its mathematical power comes from its concept ...
Added: November 1, 2022
Galitsky B., Ilvovsky D., Goncharova E., , in: Proceedings of the 10th International Workshop "What can FCA do for Artificial Intelligence?"Vol. 3233.: CEUR Workshop Proceedings, 2022. P. 75–87.
Supported decision trees that have been first proposed to boost the performance and the explainability of the expert systems built upon the texts can become a great basis for the machine reading comprehension (MRC) systems. The supported decision tree is based on building and combining the corresponding discourse trees for the text passage. In this work, ...
Added: November 1, 2022