Skip to main content
SpringerLink
Log in

One Decomposition Method of Concept Lattice

  • Conference paper
Genetic and Evolutionary Computing

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 329))

  • 1512 Accesses

Abstract

A method of decomposition into sub-concept lattices with the same attributes set is proposed. Based on the decomposition function, it is proved that when all the nodes of the concept lattice are arranged in ascending order of the extent base, the node of the sub-concept lattice is generated and its intent is equal to the intent of the node decomposed if the extent of the first decomposition; at the same time, the Hasse diagram of the sub-lattices is generated according to the route number of the node generated, then the method is described. Finally, the effectiveness of the developed method is illustrated by an example.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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.: Restructing lattice theory: an approach based on hierarchies of Concepts, pp. 445–470. Reidel Publishing Company, Dordrecht (1982)

    Google Scholar 

  2. Wang, D., Xie, Q., Huang, D., Yuan, H.: Analysis of association rule mining on quantitative concept lattice. In: Lei, J., Wang, F.L., Deng, H., Miao, D. (eds.) AICI 2012. LNCS (LNAI), vol. 7530, pp. 142–149. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  3. Eklund, P., Villerd, J.: A survey of hybrid representations of concept lattices in conceptual knowledge processing. In: Kwuida, L., Sertkaya, B. (eds.) ICFCA 2010. LNCS, vol. 5986, pp. 296–311. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  4. Yang, L., Xu, Y.: A decision method based on uncertainty reasoning of linguistic truth-valued concept lattice. International Journal of General Systems 39(3), 235–253 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. Stumme, G., Taouil, R., Bastide, Y., et al.: Computing iceberg concept lattices with TITANIC. Data & Knowledge Engineering 42, 189–222 (2002)

    Article  MATH  Google Scholar 

  6. Abderrahim, E., Ennouary, Y.: Formal Concept Analysis for Information Retieval. International Journal of Computer Science and Information Security (IJCSIS) 7(2), 119–125 (2010)

    Google Scholar 

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

    Google Scholar 

  8. Bai, X., Ma, Y., Zhang, X.-P.: Concept lattice of simplest subdirect concept and algorithm. Journal of Anshan University of Science and Technology 27(6), 428–431 (2004) (in Chinese)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Public Teaching, Anhui Xinhua University, Hefei, 230088, China

    Haixia Li, Jian Ding & Dongming Nie

  2. Harbin Institute of Technology Shenzhen Graduate School, Shenzhen, 518055, China

    Linlin Tang

Authors
  1. Haixia Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jian Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dongming Nie
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Linlin Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Haixia Li .

Editor information

Editors and Affiliations

  1. HIGH-TECH Industry Development Zone, Nanchang Institute of Technology, Jiangxi Province, China

    Hui Sun

  2. Department of Computer Science and Information Engineering, National Penghu University of Science and Technology, Magong City, Taiwan

    Chin-Yu Yang

  3. Innovative Information Industry Research Center, Shenzhen University Harbin Institute of Technology, Shenzhen, China

    Chun-Wei Lin

  4. Harbin Institute of Technology Innovative Info. Industry Res. Center, Shenzhen University, Shenzhen, China

    Jeng-Shyang Pan

  5. Department of Computer Science Faculty of Elec. Eng. & Comp. Sci., VSB-Technical University of Ostrava, Ostrava, Czech Republic

    Vaclav Snasel

  6. Scientific Network for Innovation and Research Excellence, Machine Intelligence Research Labs (MIR Labs), Auburn, Washington, USA

    Ajith Abraham

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Li, H., Ding, J., Nie, D., Tang, L. (2015). One Decomposition Method of Concept Lattice. In: Sun, H., Yang, CY., Lin, CW., Pan, JS., Snasel, V., Abraham, A. (eds) Genetic and Evolutionary Computing. Advances in Intelligent Systems and Computing, vol 329. Springer, Cham. https://doi.org/10.1007/978-3-319-12286-1_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12286-1_33

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12285-4

  • Online ISBN: 978-3-319-12286-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation