Skip to main content
SpringerLink
Log in

Knowledge Reduction in Concept Lattices Based on Irreducible Elements

  • Chapter
Book cover Transactions on Computational Science V

Part of the book series: Lecture Notes in Computer Science ((TCOMPUTATSCIE,volume 5540))

Abstract

As one of the important problems of knowledge discovery and data analysis, knowledge reduction can make the discovery of implicit knowledge in data easier and the representation simpler. In this paper, a new approach to knowledge reduction in concept lattices is developed based on irreducible elements, and characteristics of attributes and objects are also analyzed. Furthermore, algorithms for finding attribute and object reducts are provided respectively. The algorithm analysis shows that the approach to knowledge reduction involves less computation and is more tractable compared with the current methods.

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 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)

    Chapter  Google Scholar 

  2. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, New York (1999)

    Book  MATH  Google Scholar 

  3. Pawlak, Z.: Rough Sets. International Journal of Computer and Information Sciences 11, 341–356 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  4. Kent, R.E.: Rough Concept Analysis: a Synthesis of Rough Sets and Formal Concept Analysis. Fundamenta Informaticae 27, 169–181 (1996)

    MathSciNet  MATH  Google Scholar 

  5. Yao, Y.Y.: Concept Lattices in Rough Set Theory. In: 2004 Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS 2004), pp. 796–801. IEEE Press, Los Alamitos (2004)

    Chapter  Google Scholar 

  6. Oosthuizen, G.D.: Rough Sets and Concept Lattices. In: Rough Sets, and Fuzzy Sets and Knowledge Discovery (RSKD 1993), pp. 24–31. Springer, London (1994)

    Chapter  Google Scholar 

  7. Saquer, J., Deogun, J.: Formal Rough Concept Analysis. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) RSFDGrC 1999. LNCS(LNAI), vol. 1711, pp. 91–99. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  8. Saquer, J., Deogun, J.: Concept Approximations Based on Rough Sets and Similarity Measures. International Journal of Applied Mathematics and Computer Sciences 11, 655–674 (2001)

    MathSciNet  MATH  Google Scholar 

  9. Düntsch, I., Gediga, G.: Algebraic Aspects of Attribute Dependencies in Information Systems. Fundamenta Informaticae 29(1-2), 119–133 (1997)

    MathSciNet  MATH  Google Scholar 

  10. Pagliani, P.: From Concept Lattices to Approximation Spaces: Algebraic Structures of Some Spaces of Partial Objects. Fundamenta Informaticae 18(1), 1–25 (1993)

    MathSciNet  MATH  Google Scholar 

  11. Hu, K.Y., Lu, Y.C., Shi, C.Y.: Advances in Concept Lattice and Its Application. Journal of Tsinghua University (Science & Technology) 40(9), 77–81 (2000)

    Google Scholar 

  12. Ho, T.B.: An Approach to Concept Formation Based on Formal Concept Analysis. IEICE Transactions on Information and Systems E 782D(5), 553–559 (1995)

    Google Scholar 

  13. Carpineto, C., Romano, G.: GALOIS: an Order-theoretic Approach to Conceptual Clustering. In: The Tenth International Conference on Machine Learning, pp. 33–40. Elsevier, Amsterdam (1993)

    Google Scholar 

  14. Godin, R.: Incremental Concept Formation Algorithm Based on Galois (Concept) Lattices. Computational Intelligence 11(2), 246–267 (1995)

    Article  Google Scholar 

  15. Oosthuizen, G.D.: The Application of Concept Lattice to Machine Learning. Technical Report, University of Pretoria, South Africa (1996)

    Google Scholar 

  16. Grigoriev, P.A., Yevtushenko, S.A.: Elements of an Agile Discovery Environment. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS(LNAI), vol. 2843, pp. 309–316. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  17. Zhang, W.X., Wei, L., Qi, J.J.: Attribute Reduction Theory and Approach to Concept Lattice. Science in China Series F-Information Science 48(6), 713–726 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  18. Zhang, W.X., Wei, L., Qi, J.J.: Attribute Reduction in Concept Lattice Based on Discernibility Matrix. In: Ślȩzak, D., et al. (eds.) RSFDGrC 2005. LNCS(LNAI), vol. 3642, pp. 157–165. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  19. Zhang, W.X., Qiu, G.F.: Uncertain Decision Making Based on Rough Sets. Tsinghua University Publishing House, Beijing (2005)

    Google Scholar 

  20. Carpineto, C., Romano, G.: Concept Data Analysis. John Wiley & Sons, Ltd., Chichester (2004)

    Book  MATH  Google Scholar 

  21. Wang, X., Zhang, W.X.: Attribute Dependence and Reduction in Formal Contexts. International Journal of Computer Science and Knowledge Engineering 2(1), 35–49 (2008)

    Google Scholar 

  22. Wang, X., Ma, J.M.: A Novel Approach to Attribute Reduction in Concept Lattices. In: Wang, G., et al. (eds.) RSKT 2006. LNCS(LNAI), vol. 4062, pp. 522–529. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  23. Wang, X., Zhang, W.X.: Relations of Attribute Reduction Between Object and Property Oriented Concept Lattices. Knowledge-Based Systems 21(5), 398–403 (2008)

    Article  Google Scholar 

  24. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (2002)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Physics, Institute of Science, PLA University of Science and Technology, Nanjing, Jiangsu, 211101, China

    Xia Wang

  2. Institute for Information and System Sciences, Faculty of Science, Xi’an Jiaotong University, Email: bblylm@126.com, Xi’an, Shaan’xi, 710049, China

    Wenxiu Zhang

Authors
  1. Xia Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wenxiu Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Calgary, Department of Computer Science, 2500 University Drive N.W, T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  2. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  3. Theoretical and Empirical Software Engineering Research Centre (TESERC), University of Calgary, 2500 University Drive, NW, T2N 1N4, Calgary, Alberta, Canada

    Yingxu Wang

  4. Department of Computing, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong

    Keith C. C. Chan

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Wang, X., Zhang, W. (2009). Knowledge Reduction in Concept Lattices Based on Irreducible Elements. In: Gavrilova, M.L., Tan, C.J.K., Wang, Y., Chan, K.C.C. (eds) Transactions on Computational Science V. Lecture Notes in Computer Science, vol 5540. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02097-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02097-1_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02096-4

  • Online ISBN: 978-3-642-02097-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation