Skip to main content
SpringerLink
Log in

Parallel Attribute Exploration

  • Conference paper
  • First Online:
Graph-Based Representation and Reasoning (ICCS 2016)

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

Included in the following conference series:

Abstract

The canonical base of a formal context is a minimal set of implications that is sound and complete. A recent paper has provided a new algorithm for the parallel computation of canonical bases. An important extension is the integration of expert interaction for Attribute Exploration in order to explore implicational bases of inaccessible formal contexts. This paper presents and analyzes an algorithm that allows for Parallel Attribute Exploration.

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 EPUB and 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

References

  1. Angluin, D., Frazier, M., Pitt, L.: Learning conjunctions of horn clauses. Mach. Learn. 9, 147–164 (1992)

    MATH  Google Scholar 

  2. Arias, M., Balcázar, J.L.: Canonical Horn representations and query learning. In: Gavaldà, R., Lugosi, G., Zeugmann, T., Zilles, S. (eds.) ALT 2009. LNCS, vol. 5809, pp. 156–170. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. Borchmann, D.: Learning terminological knowledge with high confidence from erroneous data. Ph.D. thesis. Technische Universität Dresden (2014)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Ganter, B.: Two Basic Algorithms in Concept Analysis. FB4-Preprint 831. Darmstadt, Germany: Technische Hochschule Darmstadt (1984)

    Google Scholar 

  6. Ganter, B.: Two basic algorithms in concept analysis. In: Kwuida, L., Sertkaya, B. (eds.) ICFCA 2010. LNCS, vol. 5986, pp. 312–340. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

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

    Book  MATH  Google Scholar 

  8. Guigues, J.-L., Duquenne, V.: Famille minimale d’implications informatives résultant d’un tableau de données binaires. Mathématiques et Sci. Humaines 95, 5–18 (1986)

    MathSciNet  Google Scholar 

  9. Kriegel, F.: Concept Explorer FX. Software for Formal Concept Analysis (2010–2016). https://github.com/francesco-kriegel/conexp-fx

  10. Kriegel, F.: NextClosures - Parallel Exploration of Constrained Closure Operators. LTCS-Report 15–01. Dresden, Germany: Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden (2015)

    Google Scholar 

  11. Kriegel, F., Borchmann, D.: NextClosures: parallel computation of the canonical base. In: Proceedings of the 12th International Conference on Concept Lattices and Their Applications (CLA 2015), Clermont-Ferrand, France, 13–16 October 2015, pp. 181–192 (2015)

    Google Scholar 

  12. Maier, D.: The Theory of Relational Databases. Computer Science Press, Rockville (1983)

    MATH  Google Scholar 

  13. Stumme, G.: Attribute exploration with background implications and exceptions. In: Bock, H.-H., Polasek, W., et al. (eds.) Data Analysis and Information Systems. Studies in Classification, Data Analysis, and Knowledge Organization, pp. 457–469. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

Download references

Acknowledgements

The author gratefully thanks the anonymous reviewers for their constructive hints and helpful remarks.

Author information

Authors and Affiliations

  1. Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany

    Francesco Kriegel

Authors
  1. Francesco Kriegel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Francesco Kriegel .

Editor information

Editors and Affiliations

  1. Université Toulouse, Toulouse, France

    Ollivier Haemmerlé

  2. University of Brighton, Brighton, United Kingdom

    Gem Stapleton

  3. Université Nice Sophia Antipolis, Nice, France

    Catherine Faron Zucker

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Kriegel, F. (2016). Parallel Attribute Exploration. In: Haemmerlé, O., Stapleton, G., Faron Zucker, C. (eds) Graph-Based Representation and Reasoning. ICCS 2016. Lecture Notes in Computer Science(), vol 9717. Springer, Cham. https://doi.org/10.1007/978-3-319-40985-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-40985-6_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-40984-9

  • Online ISBN: 978-3-319-40985-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation