Skip to main content
SpringerLink
Log in

Modeling Preferences over Attribute Sets in Formal Concept Analysis

  • Conference paper
Book cover Formal Concept Analysis (ICFCA 2012)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7278))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

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)

    MATH  Google 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)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ganter, B.: Attribute exploration with background knowledge. Theoretical Computer Science 217(2), 215–233 (1999)

    Article  MathSciNet  MATH  Google 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)

    Chapter  Google Scholar 

  8. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)

    Book  MATH  Google 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)

    MathSciNet  Google 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)

    Article  MathSciNet  MATH  Google 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)

    Chapter  Google Scholar 

  13. von Wright, G.H.: The Logic of Preference. Edinburgh University Press (1963)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Higher School of Economics, National Research University, Moscow, Russia

    Sergei Obiedkov

Authors
  1. Sergei Obiedkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, University of Nicosia, 46 Makedonitissas Ave., 1700, Nicosia, Cyprus

    Florent Domenach

  2. Higher School of Economics, National Research University, Pokrovsky Boulevard, 109028, Moscow, Russia

    Dmitry I. Ignatov

  3. Faculty of Business and Economics, Katholieke Universiteit Leuven, Naamsestraat 69, 3000, Leuven, Belgium

    Jonas Poelmans

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Obiedkov, S. (2012). Modeling Preferences over Attribute Sets in Formal Concept Analysis. In: Domenach, F., Ignatov, D.I., Poelmans, J. (eds) Formal Concept Analysis. ICFCA 2012. Lecture Notes in Computer Science(), vol 7278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29892-9_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29892-9_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29891-2

  • Online ISBN: 978-3-642-29892-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation