?
Бикластеризация объектно-признаковых данных на основе решеток замкнутых множеств
С. 175–182.
Parkhomenko V., Kulikova S., Buzmakov A. V., Lobachevskii Journal of Mathematics 2026 Vol. 47 No. 6 P. 2979–2992
The stability of formal concepts and its generalization as robustness are considered in the paper. We use an approximation of stability in the form of Δ-measure for fast calculations. A computationally efficient method for calculating robustness based on subcontexts is presented. We also present a new method to analytically evaluate the number of preimages for ...
Added: October 14, 2026
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
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
Dudyrev E., Kuznetsov S., , in: Proceedings of the 9th International Workshop "What can FCA do for Artificial Intelligence?" (FCA4AI 2021)Vol. 2972.: CEUR-WS, 2021. Ch. 9 P. 99–104.
Ensembles of decision trees, like Random Forests are efficient machine learning models with state-of-the-art prediction quality. However, their predictions are much less transparent than those of a single decision tree. In this paper, we describe a prediction model based on a single decision tree in terms of Formal Concept Analysis. We define a differential way ...
Added: December 8, 2021
Buzmakov A. V., Kuznetsov S., Makhalova T. et al., , in: Proceedings of the 9th International Workshop "What can FCA do for Artificial Intelligence?" (FCA4AI 2021)Vol. 2972.: CEUR-WS, 2021. Ch. 2 P. 19–26.
Added: December 7, 2021
Jyoti -., Buzmakov Aleksey, Kailasam S., , in: The 15th International Conference on Concept Lattices and Their Applications CLA2020Issue 2668.: CEUR-WS, 2020. P. 287–292.
Added: July 10, 2021
Springer, 2021.
This book constitutes the proceedings of the 16th International Conference on Formal Concept Analysis, ICFCA 2021, held in Strasbourg, France, in June/July 2021.
The 14 full papers and 5 short papers presented in this volume were carefully reviewed and selected from 32 submissions. The book also contains four invited contributions in full paper length.
The research part ...
Added: July 10, 2021
CEUR-WS.org, 2020.
The CLA conference is an international forum for researchers, practitioners and students dedicated to the practice of Formal Concept Analysis (FCA) and areas closely related to it, including data analysis and mining, information retrieval, knowledge management, knowledge engineering, logic, algebra and lattice theory.
The 15th of CLA, CLA 2020, was going to be held in Tallinn, Estonia ...
Added: October 30, 2020
Ryzhova D., СПб.: Алетейя, 2020.
Лексическая типология – область лингвистики, которая занимается сопоставительным анализом значений слов в разных языках, – на сегодняшний день добилась больших успехов: разработаны методики сбора и анализа материала, описан целый ряд семантических полей. Однако некоторые методологические ограничения по-прежнему не преодолены: процесс сбора данных очень трудоемок, что сказывается либо на объемах и представительности языковых выборок, либо на ...
Added: June 2, 2020
Ignatov D. I., Иванова П., Замалетдинова А., , in: Network Algorithms, Data Mining, and Applications. Springer Proceedings in Mathematics & StatisticsVol. 315.: Springer, 2020. Ch. 2 P. 19–35.
This paper is related to the problem of finding the maximal quasi-bicliques in a bipartite graph (bigraph). A quasi-biclique in the bigraph is its “almost” complete subgraph. The relaxation of completeness can be understood variously; here, we assume that the subgraph is a \(\gamma \)-quasi-biclique if it lacks a certain number of edges to form ...
Added: February 22, 2020
Springer, 2017.
The proceedings contain 94 papers. The special focus in this conference is on Rough Sets. The topics include: Approximations from anywhere and general rough sets; generalized ideals and co-granular rough sets; certainty-based rough sets; the rough membership function on one type of covering-based rough sets and its applications; mereogeometry based approach for behavioral robotics; similarity ...
Added: February 9, 2020
Ayzenberg A., / Series arXiv "math". 2019.
The general goal of this paper is to gather and review several methods from homotopy and combinatorial topology and formal concepts analysis (FCA) and analyze their connections. FCA appears naturally in the problem of combinatorial simplification of simplicial complexes and allows to see a certain duality on a class of simplicial complexes. This duality generalizes ...
Added: November 15, 2019
Ignatov D. I., Ivanova P., Zamaletdinova A. et al., , in: Supplementary Proceedings ICFCA 2019 Conference and WorkshopsVol. 2378.: CEUR Workshop Proceedings, 2019. P. 28–32.
This short paper is related to the problem of finding maximum quasi-bicliques in a bipartite graph (bigraph). A quasi-biclique in a bigraph is its “almost” complete subgraph; here, we assume that the subgraph is a quasi-biclique if it lacks γ · 100% of the edges to become a biclique. The problem of finding the maximal ...
Added: October 31, 2019
Ignatov D. I., Egurnov D., Точилкин Д. С., , in: Supplementary Proceedings ICFCA 2019 Conference and WorkshopsVol. 2378.: CEUR Workshop Proceedings, 2019. P. 137–151.
This paper presents further development of distributed multimodal clustering. We introduce a new version of multimodal clustering algorithm for distributed processing in Apache Hadoop on computer clusters. Its implementation allows a user to conduct clustering on data with modality greater than two. We provide time and space complexity of the algorithm and justify its relevance. ...
Added: October 31, 2019
CEUR Workshop Proceedings, 2019.
Added: October 31, 2019
Metric Generalization and Modification of Classification Algorithms Based on Formal Concept Analysis
Evgeny Kolmakov, , in: Proceedings of the International Workshop "What can FCA do for Artificial Intelligence?" (FCA4AI at ECAI 2014)Vol. 1257.: Prague: CEUR Workshop Proceedings, 2014. P. 43–50.
Added: December 5, 2018
Metric Generalization and Modification of Classification Algorithms Based on Formal Concept Analysis
Kolmakov E.A., Computational Mathematics and Modeling 2015 Vol. 26 No. 4 P. 566–576
Added: December 5, 2018