?
Modeling preferences over attribute sets in formal concept analysis
P. 227-243.
Obiedkov S.
In this paper, we consider two types of preferences from preference logic and propose their interpretation in terms of formal concept analysis. We are concerned only with preferences between sets of attributes, or, viewed logically, between conjunctions of atomic formulas. We provide inference systems for the two types of preferences and study their relation to implications.
In book
Domenach F., Ignatov D. I., Poelmans J. Vol. 7278. , Berlin, Heidelberg : Springer, 2012
Obiedkov S., , in : Formal Concept Analysis. Vol. 7880.: Berlin, Heidelberg : Springer, 2013. P. 188-202.
We present a context-based semantics for parameterized ceteris paribus preferences over attributes subsets. Such preferences are only required to hold when the alternatives being compared agree on a specified subset of attributes. We show that ceteris paribus preferences valid in a preference context correspond to implications of a special formal context derived from the original ...
Added: October 26, 2013
Obiedkov S., Lecture Notes in Computer Science 2012 Vol. 7278 P. 227-243
In this paper, we consider two types of preferences from preference logic and propose their interpretation in terms of formal concept analysis. We are concerned only with preferences between sets of attributes, or, viewed logically, between conjunctions of atomic formulas. We provide inference systems for the two types of preferences and study their relation to ...
Added: January 28, 2013
Yarullin R., Obiedkov S., International Journal of Approximate Reasoning 2020 Vol. 127 P. 1-16
In Angluin's exact-learning framework, equivalence queries can be simulated by stochastic equivalence testing to achieve a probably approximately correct identification of an unknown concept. We present an analysis of the number of samples that need to be generated in the process leading to a theoretical improvement on an earlier approach. We apply this modification to ...
Added: October 6, 2020
Bazhanov K., Obiedkov S., , in : CLA 2011: Proceedings of the Eighth International Conference on Concept Lattices and Their Applications. : Nancy : INRIA Nancy Grand Est and LORIA, 2011. P. 43-57.
In this paper, we take a look at algorithms involved in the computation of the Duquenne–Guigues basis of implications. The most widely used algorithm for constructing the basis is Ganter’s Next Closure, designed for generating closed sets of an arbitrary closure system. We show that, for the purpose of generating the basis, the algorithm can ...
Added: January 27, 2013
Konstantin Bazhanov, Obiedkov S., Annals of Mathematics and Artificial Intelligence 2014 Vol. 70 No. 1-2 P. 5-24
In this paper, we consider algorithms involved in the computation of the Duquenne–Guigues basis of implications. The most widely used algorithm for constructing the basis is Ganter’s Next Closure, designed for generating closed sets of an arbitrary closure system. We show that, for the purpose of generating the basis, the algorithm can be optimized. We ...
Added: October 26, 2013
Obiedkov S., Theoretical Computer Science 2017 Vol. 658 No. Part B P. 375-390
We consider a propositional language for describing parameterized ceteris paribus preferences over atomic conjunctions. Such preferences are only required to hold when the alternatives being compared agree on a specified subset of propositional variables. Regarding the expressivity of the language in question, we show that a parameterized preference statement is equivalent to a conjunction of ...
Added: April 2, 2016
Alexander Karpov, , in : Data Analysis and Optimization. In Honor of Boris Mirkin's 80th Birthday. : Springer, 2023. P. 169-178.
Added: September 25, 2023
Ignatov D. I., Kuznetsov S., Zhukov L. E., , in : Rough Sets, Fuzzy Sets, Data Mining and Granular Computing: 13th International Conference, RSFDGrC 2011, Moscow, Russia, June 25-27, 2011. Proceedings. Vol. 6743.: Berlin, Heidelberg : Springer, 2011. P. 257-264.
A novel approach to triclustering of a three-way binary data is proposed. Tricluster is defined in terms of Triadic Formal Concept Analysis as a dense triset of a binary relation Y , describing relationship between objects, attributes and conditions. This definition is a relaxation of a triconcept notion and makes it possible to find all ...
Added: December 3, 2012
terskikh M., , in : The global reset: insights from regions. : M. : Advanced Solutions, 2022. P. 88-97.
The chapter analyses Russia’s position on the Indo-Pacifi c region, its perception in the Russian expert and political communities, as well as its impact on Russia’s interests. The paper offers insights into Russia’s expert assessments of the Indo-Pacifi c region, presents mainstream points of view from a political and security perspective. The authors trace Russia’s ...
Added: June 11, 2023
[б.и.], 2020
Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is ...
Added: October 29, 2020
Tretyakov S. V., Russian Law Journal 2013 No. 1 P. 26-38
In the present paper we have hypothesized an explanation for the fact that the evaluation
of the social impact of law is modeled predominantly by the economic efficiency concept.
Considering the early stages of the concept’s development, we try to make it more
intelligible to the European lawyers. ...
Added: October 9, 2014
Efremova N. N., Иностранные языки в школе 2014 № 3 С. 51-57
В статье рассматриваются особенности устной части международного экзамена по французскому языку DELF B2.Опираясь на опыт работы в качестве экзаменатора Нижегородской культурно-просветительской общественной организации "Альянс Франсез", автор рассматривает требования, предъявляемые к говорению, знакомит читателей с шкалой оценивания, проблематикой текстовых документов, анализирует трудности. ...
Added: December 24, 2013
Moulin H., Bogomolnaia A., Aziz H., , in : Proceeding of the ACM Conference EC19. : Association for Computing Machinery (ACM), 2019. P. 753-781.
We consider a setting in which agents vote to choose a fair mixture of public outcomes. The agents have dichotomous preferences: each outcome is liked or disliked by an agent. We discuss three outstanding voting rules. The Conditional Utilitarian rule, a variant of the random dictator, is strategyproof and guarantees to any group of like-minded ...
Added: October 23, 2019
Springer, 2017
The book studies the existing and potential connections between Social Network Analysis (SNA) and Formal Concept Analysis (FCA) by showing how standard SNA techniques, usually based on graph theory, can be supplemented by FCA methods, which rely on lattice theory.
The book presents contributions to the following areas: acquisition of terminological knowledge from social networks, knowledge ...
Added: December 17, 2017
Cham : Springer, 2017
This book constitutes the proceedings of the 14th International Conference on Formal Concept Analysis, ICFCA 2017, held in Rennes, France, in June 2017. The 13 full papers presented in this volume were carefully reviewed and selected from 37 submissions. The book also contains an invited contribution and a historical paper translated from German and originally ...
Added: June 25, 2017
Sirotkina N. G., Вестник Российской таможенной академии 2015 № 4 С. 118-124
The work is devoted to the mechanisms of preference policy in public procurement system in Russia. The paper discusses the technologies and risks of the preference policy of government in the public contracting and justify the need for the balance between preferential support and open competition. ...
Added: February 15, 2016
Ozhegova A., Ozhegov E. M., Экономический анализ: теория и практика 2016 Т. 10 № 457 С. 168-182
Objective: the main objective of the paper is to systemize the approaches to reveal consumer preferences in the market if performing arts. We focus on the data used in empirical studies, main variables and their measures to determine the preferences and econometric methods of preferences identification.
Methodology: we use metaanalysis of recent papers on the estimation ...
Added: September 21, 2016
Buzmakov A. V., Egho E., Jay N. et al., , in : Proceedings of the International Workshop "What can FCA do for Artificial Intelligence?" (FCA4AI at IJCAI 2013). Issue 1058.: Beijing : CEUR Workshop Proceedings, 2013. P. 7-14.
In this paper, we are interested in the analysis of sequential data and we propose an original framework based on Formal Concept Analysis (FCA). For that, we introduce sequential pattern structures, an original specification of pattern structures for dealing with sequential data. Pattern structures are used in FCA for dealing with complex data such as ...
Added: October 23, 2015
Lang J., CEUR-WS, 2020
The 9th European Starting AI Researchers’ Symposium (STAIRS) is an international meeting intended to support Starting Researchers (those that have not been awarded a doctoral degree but also researchers with not more than three years of experience after getting their PhD). STAIRS is collocated with the ECAI2020 tutorials and workshops and has an independent program committee. In this edition, ...
Added: October 30, 2020
Савватеев А. В., Филатов А. Ю., Shvarts D., Известия Дальневосточного федерального университета. Экономика и управление 2018 № 4 (88) С. 5-22
The paper investigates problems arising from necessityto make joint group decision on the base of heterogeneous individual preferences. It is shown that the problem illustrated on a set of beautiful paradoxes is deeper than that of bad mechanisms of the collective choice, instead arising from incompatibility of democracy with the basic principles of any reasonable ...
Added: November 30, 2018
Borchmann D., Hanika T., Obiedkov S., , in : Formal Concept Analysis: 14th International Conference, ICFCA 2017, Rennes, France, June 13-16, 2017, Proceedings. Vol. 10308.: Cham : Springer, 2017. P. 72-88.
We revisit the notion of probably approximately correct implication bases from the literature and present a first formulation in the language of formal concept analysis, with the goal to investigate whether such bases represent a suitable substitute for exact implication bases in practical use cases. To this end, we quantitatively examine the behavior of probably approximately correct ...
Added: June 25, 2017
Kuznetsov S., Demko C., Bertet K. et al., , in : Electronic Procedings Theoretical Computer Science. Vol. 845.: [б.и.], 2020. P. 1-20.
In this article, we present a new data type agnostic algorithm calculating a concept lattice from heterogeneous and complex data. Our NextPriorityConcept algorithm is first introduced and proved in the binary case as an extension of Bordat's algorithm with the notion of strategies to select only some predecessors of each concept, avoiding the generation of ...
Added: October 29, 2020
Ozhegov E. M., Прикладная эконометрика 2017 Т. 45 № 1 С. 93-115
This paper analyzes the mortgage borrowing process from a Russian state-owned supplier of residential housing mortgages concentrating on the estimation of demand function with heterogeneous borrowers’ preferences. Analysis takes into account the underwriting process and the choice of contract terms of all loans originated from 2008 to 2012. Our dataset contains demographic and financial characteristics ...
Added: December 23, 2016