Skip to main content

A CUDA-Based Algorithm for Constructing Concept Lattices

  • Conference paper
Rough Sets and Current Trends in Computing (RSCTC 2012)

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

Included in the following conference series:

Abstract

This paper presents a GPGPU (General-purpose computing on graphics processing units) implement of the concept lattice construction algorithm CloseByOne based on CUDA (Compute Unified Device Architecture), and compares it with the corresponding single-threaded and multi-threaded algorithms on the CPU by experiment. Experiment results show that, GPGPU can be used to generate concept lattices, but it has more restricts than CPU, the improvement of speed is not noteworthy. In the future, with the progress of graphics hardware, especially the improvement of memory capacity and branch prediction, the efficiency of GPGPU-based algorithms for generating concept lattices may be significantly increased.

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. Wille, R.: Restructuring lattice theory: An approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445–470. Reidel, Dordrecht (1982)

    Google Scholar 

  2. Carpineto, C., Romano, G.: Concept Data Analysis. Theory and Applications. Wiley, New York (2004)

    Book  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  4. Fu, H.G., Nguifo, E.M.: A Parallel Algorithm to Generate Formal Concepts for Large Data. In: Eklund, P. (ed.) ICFCA 2004. LNCS (LNAI), vol. 2961, pp. 394–401. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Krajca, P., Outrata, J., Vychodil, V.: Parallel Recursive Algorithm for FCA. In: Concept Lattices and Their Applications, pp. 71–82. Palacky University, Olomouc (2008)

    Google Scholar 

  6. Langdon, W.B., Yoo, S., Harman, M.: Formal Concept Analysis on Graphics Hardware. In: CLA 2011, Nancy, France, pp. 413–416 (2011)

    Google Scholar 

  7. Sanders, J., Kandrot, E.: CUDA by Example: an introduction to general purpose GPU programming. Pearson Education, Inc. (2010)

    Google Scholar 

  8. Zhang, S., Chu, Y.L.: The high performance computing with CUDA based on GPU. China WaterPower Press (2009) (in chinese)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shan, B., Qi, J., Liu, W. (2012). A CUDA-Based Algorithm for Constructing Concept Lattices. In: Yao, J., et al. Rough Sets and Current Trends in Computing. RSCTC 2012. Lecture Notes in Computer Science(), vol 7413. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32115-3_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32115-3_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32114-6

  • Online ISBN: 978-3-642-32115-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics