Skip to main content

Formal Context Generation Using Dirichlet Distributions

  • Conference paper
  • First Online:

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

Abstract

Randomly generating formal contexts is an important task in the realm of formal concept analysis, in particular when comparing the performance of algorithms. We suggest an improved way to randomly generate formal contexts based on Dirichlet distributions. For this purpose we investigate the predominant method, coin-tossing, recapitulate some of its shortcomings and examine its stochastic model. Building upon this we propose our Dirichlet model and develop an algorithm employing this idea. Through an experimental evaluation we show that our approach is a significant improvement with respect to the variety of contexts generated.

Authors are given in alphabetical order. No priority in authorship is implied.

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

Buying options

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

Learn about institutional subscriptions

Notes

  1. 1.

    https://github.com/exot/conexp-clj.

  2. 2.

    https://github.com/maximilian-felde/formal-context-generator.

References

  1. Bazhanov, K., Obiedkov, S.A.: Comparing performance of algorithms for generating the Duquenne-Guigues basis. In: Napoli, A., Vychodil, V. (eds.) CLA. CEURWorkshop Proceedings, vol. 959, pp. 43–57. CEUR-WS.org (2011)

    Google Scholar 

  2. Borchmann, D.: Decomposing finite closure operators by attribute exploration. In: Domenach, F., Jäschke, R., Valtchev, P. (eds.) Contributions to ICFCA 2011, pp. 24–37. Univ. of Nicosia, May 2011

    Google Scholar 

  3. Borchmann, D., Hanika, T.: Some experimental results on randomly generating formal contexts. In: Huchard, M., Kuznetsov, S. (eds.) CLA, vol. 1624, pp. 57–69. CEUR-WS.org Proceedings (2016)

    Google Scholar 

  4. Dawkins, B.: Siobhan’s problem: the coupon collector revisited. Am. Stat. 45(1), 76–82 (1991)

    Google Scholar 

  5. Ferguson, T.S.: A Bayesian analysis of some nonparametric problems. Ann. Statist. 1(2), 209–230 (1973)

    Article  MathSciNet  Google Scholar 

  6. Ganter, B.: Random extents and random closure systems. In: Napoli, A., Vychodil, V. (eds.) CLA. CEUR Workshop Proceedings, vol. 959, pp. 309–318. CEUR-WS.org (2011)

    Google Scholar 

  7. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999). https://doi.org/10.1007/978-3-642-59830-2

    Book  MATH  Google Scholar 

  8. Kuznetsov, S.O., Obiedkov, S.A.: Comparing performance of algorithms for generating concept lattices. J. Exp. Theor. Artif. Intell. 14(2–3), 189–216 (2002)

    Article  Google Scholar 

  9. Rimsa, A., Song, M.A.J., Zárate, L.E.: SCGaz - a synthetic formal context generator with density control for test and evaluation of FCA algorithms. In: SMC, pp. 3464–3470. IEEE (2013)

    Google Scholar 

  10. Ulrich, W., Gotelli, N.J.: Pattern detection in null model analysis. Oikos 122(1), 2–18 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Maximilian Felde .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Felde, M., Hanika, T. (2019). Formal Context Generation Using Dirichlet Distributions. In: Endres, D., Alam, M., Şotropa, D. (eds) Graph-Based Representation and Reasoning. ICCS 2019. Lecture Notes in Computer Science(), vol 11530. Springer, Cham. https://doi.org/10.1007/978-3-030-23182-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-23182-8_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-23181-1

  • Online ISBN: 978-3-030-23182-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics