Modeling preferences over attribute sets in formal concept analysis

Authors:
Sergei Obiedkov
Affiliations:
Higher School of Economics, National Research University, Moscow, Russia
Venue:
ICFCA'12 Proceedings of the 10th international conference on Formal Concept Analysis
Year:
2012

Citing 8
Cited 1

Attribute exploration with background knowledge

Theoretical Computer Science
Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Queries and Concept Learning

Machine Learning
Queries and Concept Learning

Machine Learning
Some decision and counting problems of the Duquenne-Guigues basis of implications

Discrete Applied Mathematics
A proposal for combining formal concept analysis and description logics for mining relational data

ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
The Description Logic Handbook: Theory, Implementation and Applications

The Description Logic Handbook: Theory, Implementation and Applications
On the complexity of enumerating pseudo-intents

Discrete Applied Mathematics

Exploring Users' Preferences in a Fuzzy Setting

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.