Skip to main content

Char: An Automatic Way to Describe Characteristics of Data

  • Conference paper
Intelligent Data Engineering and Automated Learning – IDEAL 2004 (IDEAL 2004)

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

  • 1309 Accesses

Abstract

As e-business software prevails worldwide, large amount of data are accumulated automatically in databases of most sizable companies. Managers in organizations now face the problems of making sense out of the data. In this paper, an algorithm to automatically produce characteristic rules to describe the major characteristics of data in a table is proposed. In contrast to traditional Attribute Oriented Induction methods, the algorithm, named as Char Algorithm, does not need a concept tree and only requires setting a desired coverage threshold to generate a minimal set of characteristic rules to describe the given dataset. Our simulation results show that the characteristic rules found by Char are fairly consistent even when the number of records and attributes increase.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Piatetsky-Shapiro, G., Fayyad, W.J., Smith, P.: From data mining to knowledge discovery: An overview. In: Fayyad, U.M., Piatetsky-Shapiro, F., Smyth, P., Uthurusamy, R. (eds.) Advances in knowledge Discovery and Data Mining, pp. 1–35. AAAI/MIT Press (1996)

    Google Scholar 

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

    Article  Google Scholar 

  3. Agrawal, R., Imielinski, I., Swami, A.: Mining association rules between sets of items in large databases. In: Proc. of 1993 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD 1993), Washington, DC, May 1993, pp. 207–216 (1993)

    Google Scholar 

  4. Michalski, R.S., Carbonell, J.G., Mitchell, T.M.: Machine Learning: An Artificial Intelligence Approach, vol. 1. Morgan Kaufmann, San Mateo (1983)

    Google Scholar 

  5. Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann, San Francisco (2001)

    Google Scholar 

  6. Gupta, A., Harinarayan, V., Quass, D.: Aggregate-Query processing in data warehousing environment. In: Proc. 21st Int. Conf. Very Large Data Bases, Zurich, Switzerland, September 1995, pp. 358–369 (1995)

    Google Scholar 

  7. Harinarayan, V., Ullman, J.D., Rajaraman, A.: Implementing data cubes efficiently. In: Proc. 1996 Int’l Conf. on Data Mining and Knowledge Discovery (KDD 1996), Portland, Oregon (August 1996)

    Google Scholar 

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

    Google Scholar 

  9. Agrawal, R., Imielinski, T., Swami, A.: Database mining: a performance perspective. IEEE Transactions on knowledge and Data Engineering 5(6), 914–925 (1993)

    Article  Google Scholar 

  10. Shafer, J.C., Agrawal, R., Mehta, M.: SPRINT: A scalable parallel classifier for data mining. In: Proceedings of the 22nd International Conference on Very Large Databaes, Mumbai(Bombay), India, pp. 514–555 (1996)

    Google Scholar 

  11. Wang, M., Iyer, B., Vitter, J.S.: Scalable mining for classification rules in relation databases. In: Proceedings of International Database Engineering and Applications Symposium, Cardiff, Wales, UK, pp. 58–67 (1998)

    Google Scholar 

  12. MaCay, D.J.C.: Information Theory, Inference, Learning Algorithms, 6th edn. Cambridge University Press, Cambridge (September 2003)

    Google Scholar 

  13. Han, J., Fu, Y.: Dynamic generation and refinement of concept hierarchies for knowledge discovery in databases. In: Proc. AAAI 1994 Workshop on Knowledge Discovery in Databases (KDD 1994), Seattle, WA, July 1994, pp. 158–168 (1994)

    Google Scholar 

  14. Han, J., Fu, Y.: Exploration of the power of attribute-oriented induction in data mining. In: Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (eds.) Advances in Knowledge Discovery and Data Ming, pp. 399–421. AAAI/MIT Press (1996)

    Google Scholar 

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

Liu, YC., Hsu, PY. (2004). Char: An Automatic Way to Describe Characteristics of Data. In: Yang, Z.R., Yin, H., Everson, R.M. (eds) Intelligent Data Engineering and Automated Learning – IDEAL 2004. IDEAL 2004. Lecture Notes in Computer Science, vol 3177. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28651-6_54

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28651-6_54

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-28651-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics