Skip to main content

A Classification Rule Acquisition Algorithm Based on Constrained Concept Lattice

  • Conference paper

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

Abstract

Concept lattice is an effective tool for data analysis. Constrained concept lattice, with the characteristics of higher constructing efficiency, practicability and pertinence, is a new concept lattice structure. For classification rule acquisition, a classification rule acquisition algorithm based on the constrained concept lattice is presented by using the concept of partition support according to the relationship between node’s extent of constrained concept lattice and equivalence partition of data set. The experiment results validate the higher classification efficiency and correctness of the algorithm by taking UCI (University of California Irvine) data sets as the formal contexts.

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. Ma, J., Chen, Y.: A Data Mining Algorithm Based on Rough Set Theory. Computer Science 35(6), 213–216 (2008)

    Google Scholar 

  2. Zhang, D., Wang, Y., Huang, H.: Fuzzy Rough Model Based Rough Neural Network Modeling. Acta Automatica Sinica 34(8), 1016–1023 (2008)

    Article  MathSciNet  Google Scholar 

  3. Hu, K., Lu, Y., Shi, C.: An Integrated Mining Approach for Classification and Association Rule Based on Concept Lattice. Journal of Software 11(11), 1479–1484 (2000)

    Google Scholar 

  4. Wang, H., Hu, X., Zhao, W.: The Discovery of Classification Rules Based on Quantitative Relatively Reduced Concept Lattice. Journal of Fudan University 43(5), 761–765 (2004)

    Google Scholar 

  5. Xie, K., Zhao, J., Zhang, D., et al.: A Fast Multi-Dimensional Packet Classification Algorithm Using Counting Bloom Filter. Acta Electronica Sinica 38(5), 1046–1052 (2010)

    Google Scholar 

  6. Sahami, M.: Learning classification rules using lattices. In: Proceeding of the ECML 1995, pp. 343–346 (1995)

    Google Scholar 

  7. Wang, Y., Li, M.: Classification Rule Acquisition Based on Extended Concept Lattice. Journal of Computer Applications 27(10), 2376–2378 (2007)

    Google Scholar 

  8. Zhang, J., Zhang, S., Hu, L.: Constrained Concept Lattice and Its Construction Method. CAAI Transactions on Intelligent Systems 2(1), 31–38 (2006)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhao, X. (2011). A Classification Rule Acquisition Algorithm Based on Constrained Concept Lattice. In: Deng, H., Miao, D., Lei, J., Wang, F.L. (eds) Artificial Intelligence and Computational Intelligence. AICI 2011. Lecture Notes in Computer Science(), vol 7002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23881-9_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23881-9_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23880-2

  • Online ISBN: 978-3-642-23881-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics