Skip to main content

Closed-Label Concept Lattice Based Rule Extraction Approach

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 6840))

Abstract

Concept lattice is an effective tool for data analysis and extracting classification rules. However, the classical concept lattice often produce a lot of redundant rules. Closed-label concept lattice realizes reduction of concept intention, which can be used to extract fewer rules than the classical concept lattice. This paper presents a method for classification rules extraction based on the closed-label concept lattice. Examples show that the proposed method is effective for extracting more concise classification rules.

This is a preview of subscription content, log in via an institution.

Buying options

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

Learn about 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-Boston (1982)

    Chapter  Google Scholar 

  2. Godin, R.: Incremental concept formation algorithm based on Galois (concept) lattice. Computational Intelligence 11(2), 246–267 (1995)

    Article  Google Scholar 

  3. Ho, T.B.: An approach to concept formation based on formal concept analysis. IEICE Transaction on Information and Systems E78-D(5), 553–559 (1995)

    Google Scholar 

  4. Godin, R., Missaoui, R.: An incremental concept formation approach for learning from databases. Theoretical Computer Science, Special Issue on Formal Metthods in Databases and Software Engineering 133, 387–419 (1994)

    MathSciNet  MATH  Google Scholar 

  5. Ho, T.B.: Discovering and using knowledge from unsupervised data, Decision Support System. Decision Support System 21(1), 27–41 (1997)

    Article  MathSciNet  Google Scholar 

  6. Liang, J.Y., Wang, J.H.: A new lattice structure and methor for extracting association rules based on concept lattcice. International Journal of Computer Science and Network Security 6(11), 107–114 (2006)

    Google Scholar 

  7. Yao, Y.Y.: A Comparative Study of Formal Concept Analysis and Rough Set Theory in Data Analysis. In: Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W. (eds.) RSCTC 2004. LNCS (LNAI), vol. 3066, pp. 59–68. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Yao, Y.Y., Chen, Y.H.: Rough Set Approximations in Formal Concept Analysis. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets V. LNCS, vol. 4100, pp. 285–305. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Shao, M.W., Liu, M., Zhang, W.X.: Set Approximations in Fuzzy Formal Concept Analysis. Fuzzy Sets and Systems 158(23), 2627–2640 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hu, K., Sui, Y., Lu, Y.-c., Wang, J., Shi, C.-Y.: Concept Approximation in Concept Lattice. In: Cheung, D., Williams, G.J., Li, Q. (eds.) PAKDD 2001. LNCS (LNAI), vol. 2035, pp. 167–173. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Qian, Y.H., Liang, J.Y., Pedrycz, W., Dang, C.Y.: Positive approximation: An accelerator for attribute reduction in rough set theory. Artificial Intelligence 174(9-10), 597–618 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  12. Wu, W.Z., Leung, Y., Mi, J.S.: Granular Computing and Knowledge Reduction in Formal Contexts. IEEE Transactions on Knowledge and Data Engineering 21(10), 1461–1474 (2009)

    Article  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  14. Liu, M., Shao, M.W., Zhang, W.X., Wu, C.: Reduction Method for Concept Lattices Based on Rough Set Theory and Its Application. Computers and Mathematics with Applications 53(9), 1390–1410 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  15. Jiang, G.Q., Chute, C.G.: Auditing the Semantic Completeness of SNOMED CT Using Formal Concept Analysis. Journal of the American Medical Informatics Association 16(1), 89–102 (2009)

    Article  Google Scholar 

  16. Tonella, P.: Using a concept lattice of decomposition slices for program understanding and impact analysis. IEEE Transactions on Software Engineering 29(6), 495–509 (2003)

    Article  Google Scholar 

  17. Yao, J.T., Yao, Y.Y.: A granular computing approach to machine learning. In: Proceedings of the 1st International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2002), Singapore, pp. 732–736 (2002)

    Google Scholar 

  18. Ganter, B., Wille, R.: Formal Concept Analysis, Mathematical Foundations. Springer, Berlin (1999)

    Book  MATH  Google Scholar 

  19. Quinlan, J.R.: Induction of decision trees. Machine Learning 1, 81–106 (1986)

    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

Wang, J., Liang, J., Qian, Y. (2012). Closed-Label Concept Lattice Based Rule Extraction Approach. In: Huang, DS., Gan, Y., Premaratne, P., Han, K. (eds) Bio-Inspired Computing and Applications. ICIC 2011. Lecture Notes in Computer Science(), vol 6840. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24553-4_91

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24553-4_91

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24552-7

  • Online ISBN: 978-3-642-24553-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics