Skip to main content

A Bottom-Up Incremental Algorithm of Building Concept Lattice

  • Conference paper
  • First Online:
Software Engineering and Knowledge Engineering: Theory and Practice

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 115))

  • 1226 Accesses

Abstract

The construction algorithm of concept lattice is an important topic in formal concept analysis. So far, a series of algorithms have been proposed, which can be divided into two categories: Batch and incremental algorithms. Because it is easy to maintain, the incremental algorithms are very promising algorithms. Based on analysis to the process of incremental construction of concept lattice, a bottom-up incremental algorithm of building concept lattice has been proposed. The tests show that this algorithm outperforms classical Godin algorithm for most types of contexts.

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 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Berlin (1999)

    Book  MATH  Google Scholar 

  2. Maddouri, M.: Towards a machine learning approach based on incremental concept formation. Intelligent Data Analysis 8, 267–280 (2004)

    Google Scholar 

  3. Shyng, J.Y., Shieh, H.M., Tzeng, G.H.: An integration method combining Rough Set Theory with formal concept analysis for personal investment portfolios. Knowledge-Based System 23, 586–597 (2010)

    Article  Google Scholar 

  4. Snasel, V., Horak, Z., Kocibova, J., et al.: A analyzing social networks using FCA: complexity aspects. In: International Joint Conferences On Web Intelligence And Intelligent Agent Technologies, pp. 38–41. IEEE, Milan (2009)

    Chapter  Google Scholar 

  5. Bordat, J.: Calcul pratique du treillis de Galois d’une correspondance. Math. Sci. Hum. 96, 31–47 (1986)

    MathSciNet  MATH  Google Scholar 

  6. Nourine, L., Raynaud, O.: A Fast Algorithm for Building Lattices. Information Processing Letters 71, 199–204 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  7. Godin, R., Missaoui, T., Alaui, H.: An incremental Concept Formation Algorithm based on Galois (Concept) Lattices. Computational Intelligence 11, 246–267 (1995)

    Article  Google Scholar 

  8. Shi, B., Liu, Z., Yu, H.: Algorithm of Building Concept Lattice Based on Its Structure. Computer Engineering 33, 12–14 (2007)

    Google Scholar 

  9. Shen, X., Han, D., Liu, Z., et al.: Improvement on Constructing Algorithm of Concept Lattices. Computer Engineering and Applications 40, 100–103 (2004)

    Google Scholar 

  10. Kuznetsov, S.O., Obiedkov, S.A.: Algorithms for the Construction of Concept Lattices and Their Diagram Graphs. In: Siebes, A., De Raedt, L. (eds.) PKDD 2001. LNCS (LNAI), vol. 2168, pp. 289–300. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to LingLing Lv .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag GmbH Berlin Heidelberg

About this paper

Cite this paper

Lv, L., Zhang, L., Jia, P., Zhou, F. (2012). A Bottom-Up Incremental Algorithm of Building Concept Lattice. In: Wu, Y. (eds) Software Engineering and Knowledge Engineering: Theory and Practice. Advances in Intelligent and Soft Computing, vol 115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25349-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25349-2_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25348-5

  • Online ISBN: 978-3-642-25349-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics