Skip to main content

Selecting Important Concepts Using Weights

  • Conference paper
Formal Concept Analysis (ICFCA 2011)

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

Included in the following conference series:

Abstract

We present an approach that enables one to select a reasonable small number of possibly important formal concepts from the set of all formal concepts of a given input data. The problem to select a small number of concepts appears in applications of formal concept analysis when the number of all formal concepts of the input data is large. Namely, a user often asks for a list of “important concepts” in such case. In the present approach, attributes of the input data are assigned weights from which values of formal concepts are determined. Formal concepts with larger values are considered more important. The attribute weights are supposed to be set by the users. The approach is a continuation of our previous approaches that utilize background knowledge, i.e. additional knowledge of a user, to select parts of concept lattices. In addition to the approach, we present illustrative examples.

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

Access this chapter

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. Belohlavek, R., Košt’ák, M., Osicka, P.: Reconstruction of belemnite evolution using formal concept analysis. In: Trappl, R. (ed.) Proc. of the 20th European Meeting on Cybernetics and Systems Research 2010, Vienna, Austria, pp. 32–38 (2010), ISBN 3–85206–178–8

    Google Scholar 

  2. Belohlavek, R., Sklenář, V.: Formal concept analysis constrained by attribute-dependency formulas. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol. 3403, pp. 176–191. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Belohlavek, R., Vychodil, V.: Formal concept analysis with constraints by closure operators. In: Schärfe, H., Hitzler, P., Øhrstrøm, P. (eds.) ICCS 2006. LNCS (LNAI), vol. 4068, pp. 131–143. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Belohlavek, R., Vychodil, V.: Formal concept analysis with background knowledge: attribute priorities. IEEE Trans. Systems, Man, and Cybernetics, Part C 39(4), 399–409 (2009), doi:10.1109/TSMCC.2008.2012168

    Article  Google Scholar 

  5. Boulicaut, J.-F., Jeudy, B.: Constraint-based data mining. In: Maimon, O., Rokach, L. (eds.) The Data Mining and Knowledge Discovery Handbook, pp. 399–416. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Carpineto, C., Romano, G.: Concept Data Analysis. Theory and Applications. J. Wiley, Chichester (2004)

    Book  MATH  Google Scholar 

  7. Cellier, P., Ferré, S., Ridoux, O., Ducassé, M.: A parameterized algorithm to explore formal contexts with a taxonomy. Int. J. Found. Comput. Sci. 2, 319–343 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. Dias, S.M., Vieira, N.J.: Reducing the size of concept lattices: The JBOS Approach. In: Proc. CLA 2010. CEUR WS, vol. 672, pp. 80–91 (2010) ISBN 978-84-614-4027-6, ISSN 1613–0073

    Google Scholar 

  9. Ganter, B.: Attribute exploration with background knowledge. Theor. Comput. Sci. 217, 215–233 (1999)

    Article  MathSciNet  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  11. Grabisch, M., Marichal, J.-L., Mesiar, R., Pap, E.: Aggregation Functions. Cambridge University Press, Cambridge (2009)

    Book  MATH  Google Scholar 

  12. Kwuida, L., Missaoui, R., Ben Amor, B., Boumedjout, L., Vaillancourt, J.: Restrictions on concept lattices for pattern management. In: Proc. CLA 2010. CEUR WS, vol. 672, pp. 235–246 (2010), ISBN 978-84-614-4027-6 , ISSN 1613–0073

    Google Scholar 

  13. Roberts, F.S.: Measurement Theory. Cambridge University Press, Cambridge (1985)

    Google Scholar 

  14. Xie, Z.: Φ-generalized concept lattice models: From power concepts to formal concepts, and then to robust concepts. In: Proc. CLA 2006, pp. 219–230 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Belohlavek, R., Macko, J. (2011). Selecting Important Concepts Using Weights. In: Valtchev, P., Jäschke, R. (eds) Formal Concept Analysis. ICFCA 2011. Lecture Notes in Computer Science(), vol 6628. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20514-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20514-9_7

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics