Classification Based on Attribute Dependency | SpringerLink
Skip to main content

Classification Based on Attribute Dependency

  • Conference paper
Data Warehousing and Knowledge Discovery (DaWaK 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3181))

Included in the following conference series:

Abstract

The decision tree learning algorithms, e.g., C5, are good at dataset classification. But those algorithms usually work with only one attribute at a time. The dependencies among attributes are not considered in those algorithms. Thus, it is very important to construct a model to discover the dependencies among attributes and to improve the accuracy of the decision tree learning algorithms. Association mining is a good choice for us to concern with the problems of attribute dependencies. Generally, these dependencies are classified into three types: categorical-type, numerical-type, and categorical- numerical-mixed dependencies. This paper proposes a CAM (Classification based on Association Mining) model to deal with such kind of dependency. The CAM model combines the association mining technologies and the traditional decision-tree learning capabilities to handle the complicated and real cases. According to the experiments on fifteen datasets from the UCI database repository, the CAM model can significantly improve both the accuracy and the rule size of C5. At the same time, the CAM model also outperforms the existing association-based classification models, i.e., ADT (Association-based Decision Tree) and CBA (Classification Based on Association).

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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.

Similar content being viewed by others

References

  1. Chen, M.S., Han, J., Yu, P.S.: Data Mining: An Overview from a Database Perspective. IEEE Transaction on Knowledge and Data Engineering 8(6), 866–882 (1996)

    Article  Google Scholar 

  2. Quinlan, J.R.: Improved Use of Continuous Attributes in C4. 5. Journal of Artificial Intelligence Approach 4, 77–90 (1996)

    MATH  Google Scholar 

  3. Lee, Y.S., Yen, S.J.: Neural-Based Approaches for Improving the Accuracy of Decision Trees. In: Proceedings of International Conference on Data Warehousing and Knowledge Discovery, pp. 114–123 (2002)

    Google Scholar 

  4. Chen, M.S.: On the Evaluation of Using Multiple Attributes for Mining Classification Rules. In: Proceedings of IEEE International Conference on Tools with Artificial Intelligence, pp. 130–137 (1998)

    Google Scholar 

  5. Liu, B., Hsu, W., Ma, Y.: Integrating Classification and Association Rule Mining. In: Proceedings of International Conference on Knowledge Discovery and Data Mining, pp. 80–86 (1998)

    Google Scholar 

  6. Wang, K., Zhou, S.Q., He, Y.: Growing Decision Trees on Support-Less Association Rules. In: Proceedings of International Conference on Knowledge Discovery and Data Mining, pp. 265–269 (2000)

    Google Scholar 

  7. Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In: Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 207–216 (1993)

    Google Scholar 

  8. Park, J.S., Chen, M.S., Yu, P.S.: Using a Hash-Based Method with Transaction Trimming for Mining Association Rules. IEEE Transactions on Knowledge and Data Engineering 9(5), 813–825 (1997)

    Article  Google Scholar 

  9. Pei, J., Han, J., Lu, H., Nishio, S., Tang, S., Yang, D.: H-Mine: Hyper-Structure Mining of Frequent Patterns in Large Databases. In: Proceedings of IEEE International Conference on Data Mining, pp. 441–448 (2001)

    Google Scholar 

  10. Han, J., Pei, J., Yin, Y., Mao, R.: Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach. Data Mining and Knowledge Discovery 1, 53–87 (2004)

    Article  MathSciNet  Google Scholar 

  11. Kamber, M., Han, J., Chiang, J.Y.: Metarule-Guided Mining of Multidimensional Association Rules Using Data Cubes. In: Proceedings of International Conference on Knowledge Discovery and Data Mining, pp. 207–210 (1997)

    Google Scholar 

  12. Merz, C.J., Murphy, P.: UCI repository of machine learning databases (1996), http://www.cs.uci.edu/mlearn/MLRepository.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, YS., Yen, SJ. (2004). Classification Based on Attribute Dependency. In: Kambayashi, Y., Mohania, M., Wöß, W. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2004. Lecture Notes in Computer Science, vol 3181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30076-2_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30076-2_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22937-7

  • Online ISBN: 978-3-540-30076-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics