?
From preferences over objects to preferences over concepts
.
Obiedkov S.
We present an approach to preference modeling and learning preferences from data based on formal concept analysis. We consider techniques to derive preferences over attribute subsets from preferences over objects, including ceteris paribus preferences.
In book
Montpellier: Montpellier 2 University, 2012.
Ignatov D. I., , in: LNAI 14133: 28th International Conference on Conceptual Structures, ICCS 2023, Berlin, Germany, September 11–13, 2023, Proceedings. Graph-Based Representation and Reasoning.: Berlin: Springer, 2023. P. 56–69.
Set partitions and partition lattices are well-known objects in combinatorics and play an important role as a search space in many applied problems including ensemble clustering. Searching for antichains in such lattices is similar to that of in Boolean lattices. Counting the number of antichains in Boolean lattices is known as the Dedekind problem. In ...
Added: November 23, 2023
CEUR-WS.org, 2023.
Added: September 27, 2023
Switzerland: Springer, 2023.
Added: September 27, 2023
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
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
Kuznetsov S., Makhalova T., Napoli A., , in: Proceedings of the 9th European Starting AI Researchers' Symposium 2020 co-located with 24th European Conference on Artificial Intelligence (ECAI 2020).: CEUR-WS, 2020. P. 1–8.
Added: October 30, 2020
[б.и.], 2020.
The seven preceding editions of the FCA4AI Workshop showed that many researchers working in Artificial Intelligence are deeply interested by a well-founded method for classification and data mining such as Formal Concept Analysis (see https://conceptanalysis. wordpress.com/fca/). FCA4AI was co-located with ECAI 2012 (Montpellier), IJCAI 2013 (Beijing), ECAI 2014 (Prague), IJCAI 2015 (Buenos Aires), ECAI 2016 ...
Added: October 29, 2020
Kuznetsov S., Demko C., Bertet K. et al., , in: Electronic Procedings Theoretical Computer ScienceVol. 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
[б.и.], 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
[б.и.], 2020.
International Journal of General Systems is a periodical devoted primarily to the publication of original research contributions to system science, basic as well as applied. However, relevant survey articles, invited book reviews, bibliographies, and letters to the editor are also published.
The principal aim of the journal is to promote original systems ideas (concepts, principles, methods, theoretical ...
Added: October 29, 2020
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
Ryzhova D., СПб.: Алетейя, 2020.
Лексическая типология – область лингвистики, которая занимается сопоставительным анализом значений слов в разных языках, – на сегодняшний день добилась больших успехов: разработаны методики сбора и анализа материала, описан целый ряд семантических полей. Однако некоторые методологические ограничения по-прежнему не преодолены: процесс сбора данных очень трудоемок, что сказывается либо на объемах и представительности языковых выборок, либо на ...
Added: June 2, 2020
Bazenkov N., Goubko M., , in: Proceedings 16th Russian Conference on Artificial Intelligence (RCAI 2018)Issue 934.: Cham: Springer, 2018.
For modern energy markets it is typical to use dynamic real-time pricing schemes even for residential customers. Such schemes are expected to stimulate rational energy consumption by the end customers, provide peak shaving and overall energy efficiency. But under dynamic pricing planning a household’s energy consumption becomes complicated. So automated planning of household appliances is ...
Added: December 2, 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
Birkhauser/Springer, 2017.
This book constitutes the proceedings of the 23rd International Symposium on Foundations of Intelligent Systems, ISMIS 2017, held in Warsaw, Poland, in June 2017. The 56 regular and 15 short papers presented in this volume were carefully reviewed and selected from 118 submissions. The papers include both theoretical and practical aspects of machine learning, data mining ...
Added: September 18, 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
Bernhard Ganter, Obiedkov S., Berlin, Heidelberg: Springer, 2016.
This is the first textbook on attribute exploration, its theory, its algorithms for applications, and some of its many possible generalizations. Attribute exploration is useful for acquiring structured knowledge through an interactive process, by asking queries to an expert. Generalizations that handle incomplete, faulty, or imprecise data are discussed, but the focus lies on knowledge ...
Added: September 3, 2016
Obiedkov S., Romashkin N. S., , in: RuZA 2015 Workshop. Proceedings of Russian and South African Workshop on Knowledge Discovery Techniques Based on Formal Concept Analysis (RuZA 2015). November 30 - December 5, 2015, Stellenbosch, South AfricaVol. 1552.: Aachen: CEUR Workshop Proceedings, 2015. P. 58–70.
Domain ontologies are essential in disciplines as diverse as software engineering, medicine, or political science to name just a few. This paper describes an ongoing effort to develop a methodology for collaborative ontology construction by geographically spread communities of experts and implement a web-based prototype supporting this methodology. A distinctive feature of the proposed approach ...
Added: June 14, 2016
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