Skip to main content
SpringerLink
Log in

Application of Discrimination Degree for Attributes Reduction in Concept Lattice

  • Conference paper
Advances in Knowledge Discovery and Data Mining (PAKDD 2007)

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

Included in the following conference series:

  • 1810 Accesses

Abstract

This paper presents a new concept, discrimination degree theory, which is complementary of inclusion degree. Then the theoretical and practical significance of the discrimination degree is discussed, and the concept formation theorem of discrimination degree is given. The relationship between the discrimination degree and discernibility matrix is explained in attributes reduction of formal context. Finally, under a biology formal context, concept lattice is built after attributes reduced. By comparison with the lattice which didn’t reduce attributes, it shows that reduction make the complexity of building lattice distinctly simplified while the key information is still retained.

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. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Berlin (1999)

    MATH  Google Scholar 

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

    Google Scholar 

  3. Yao, Y.Y.: Neighborhood systems and approximate retrieval. Information Sciences 176, 3431–3452 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  4. Li, H.-R., Zhang, W.-X., Wang, H.: Classification and reduction of attributes in concept lattices. In: IEEE International Conference on Granular Computing, Atlanta, pp. 142–147. IEEE Computer Society Press, Los Alamitos (2006)

    Google Scholar 

  5. Jaoua, A., Elloumi, S.: Galois connection, formal concepts and Galois lattice in real relations: application in a real classifier. The Journal of Systems and Software 60, 149–163 (2002)

    Article  Google Scholar 

  6. Besson, J., Robardet, C., Boulicaut, J.F.: Mining formal concepts with a bounded number of exceptions from transactional data. In: Goethals, B., Siebes, A. (eds.) KDID 2004. LNCS, vol. 3377, pp. 33–45. Springer, Heidelberg (2005)

    Google Scholar 

  7. Zhang, W.-X., Xu, Z.-B., Liang, Y., et al.: Inclusion degree theory (in Chinese). Fuzzy Systems and Mathematics 10, 1–9 (1996)

    MathSciNet  Google Scholar 

  8. Mi, J.-S., Zhang, W.-X., Wu, W.-Z.: Optimal Decision Rules Based on Inclusion Degree Theory. In: Proceedings of the First International Conference on Machine Learning and Cybernctics, Beijing, pp. 1223–1226. IEEE Computer Society Press, Los Alamitos (2002)

    Google Scholar 

  9. Burmeister, P., Holzer, R.: Treating Incomplete Knowledge in Formal Concept Analysis. In: Ganter, B., Stumme, G., Wille, R. (eds.) Formal Concept Analysis. LNCS (LNAI), vol. 3626, pp. 114–126. Springer, Heidelberg (2005)

    Google Scholar 

  10. Qu, K.-S., Zhai, Y.-H.: Posets, Inclusion Degree Theory and FCA (in Chinese). Chinese journal of computers 29, 219–226 (2006)

    MathSciNet  Google Scholar 

  11. Skowron, A., Rauszer, C.: The discernibility matrices and functions in information system. Kluwer Academic Publishers, Dordrecht (1992)

    Google Scholar 

  12. Valtchev, P., Missaoui, R., Godin, R.: Formal Concept Analysis for Knowledge Discovery and Data Mining: The New Challenges. In: Eklund, P.W. (ed.) ICFCA 2004. LNCS (LNAI), vol. 2961, pp. 352–371. Springer, Heidelberg (2004)

    Google Scholar 

  13. Godin, R., Missaoui, R., Alaoui, H.: Incremental concept formation algorithms based on Galois (concept) lattices. Computational Intelligence 11, 246–267 (1995)

    Article  Google Scholar 

  14. Yao, Y.Y.: Concept lattices in rough set theory. In: Proceedings of 2004 Annual Meeting of North American Fuzzy Information Processing Society, Canada, pp. 796–801 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer and Communication, Lanzhou University of Technology, Lanzhou, Gansu, 730050, P. R. China

    Ming Li & De-San Yang

Authors
  1. Ming Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. De-San Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zhi-Hua Zhou Hang Li Qiang Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Li, M., Yang, DS. (2007). Application of Discrimination Degree for Attributes Reduction in Concept Lattice. In: Zhou, ZH., Li, H., Yang, Q. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2007. Lecture Notes in Computer Science(), vol 4426. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71701-0_69

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71701-0_69

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71700-3

  • Online ISBN: 978-3-540-71701-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation