ICFCA 2012: Formal Concept Analysis pp 227-243 | Cite as
Modeling Preferences over Attribute Sets in Formal Concept Analysis
Conference paper
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.
Keywords
implications formal concept analysis preference logic preferencesPreview
Unable to display preview. Download preview PDF.
References
- 1.Angluin, D.: Queries and concept learning. Machine Learning 2, 319–342 (1988)Google Scholar
- 2.Armstrong, W.W.: Dependency structure of data base relationships. In: Proc. IFIP Congress, pp. 580–583 (1974)Google Scholar
- 3.Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F.: The Description Logic Handbook: Theory, Implementation and Applications, 2nd edn. Cambridge University Press, New York (2010)MATHGoogle Scholar
- 4.van Benthem, J.: Modal Logic for Open Minds. CSLI lecture notes, Center for the Study of Language and Information (2010)Google Scholar
- 5.Distel, F., Sertkaya, B.: On the complexity of enumerating pseudo-intents. Discrete Applied Mathematics 159(6), 450–466 (2011)MathSciNetMATHCrossRefGoogle Scholar
- 6.Ganter, B.: Attribute exploration with background knowledge. Theoretical Computer Science 217(2), 215–233 (1999)MathSciNetMATHCrossRefGoogle Scholar
- 7.Ganter, B., Obiedkov, S.: Implications in Triadic Formal Contexts. In: Wolff, K.E., Pfeiffer, H.D., Delugach, H.S. (eds.) ICCS 2004. LNCS (LNAI), vol. 3127, pp. 186–195. Springer, Heidelberg (2004)CrossRefGoogle Scholar
- 8.Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)MATHCrossRefGoogle Scholar
- 9.Guigues, J.-L., Duquenne, V.: Famille minimale d’implications informatives résultant d’un tableau de données binaires. Mathématiques et Sciences Humaines 24(95), 5–18 (1986)MathSciNetGoogle Scholar
- 10.Kuznetsov, S.O., Obiedkov, S.: Some decision and counting problems of the Duquenne–Guigues basis of implications. Discrete Applied Mathematics 156(11), 1994–2003 (2008)MathSciNetMATHCrossRefGoogle Scholar
- 11.Liu, F.: Changing for the Better. Preference Dynamics and Agent Diversity. Ph.D. thesis, Universiteit van Amsterdam (2008)Google Scholar
- 12.Rouane Hacene, M., Huchard, M., Napoli, A., Valtchev, P.: A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data. In: Kuznetsov, S.O., Schmidt, S. (eds.) ICFCA 2007. LNCS (LNAI), vol. 4390, pp. 51–65. Springer, Heidelberg (2007)CrossRefGoogle Scholar
- 13.von Wright, G.H.: The Logic of Preference. Edinburgh University Press (1963)Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2012