Skip to main content

Partition for the Rough Set-Based Text Classification

  • Conference paper
Advances in Web-Age Information Management (WAIM 2003)

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

Included in the following conference series:

  • 444 Accesses

Abstract

Text classification based on Rough Sets theory is an effective method for the automatic document classification problem. However, the computing multiple reducts is a problem in this method. When the number of training document is large, it takes much time and large memory for the computation. It is very hard to be applied in the real application system. In this paper, we propose an effective way of data partition, to solve the above problem. It reduces the computing time of generating reducts and maintains the classification accuracy. This paper describes our approach and experimental result.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /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
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

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. Joachims, T.: Text Classification with Support Vector Machines: Learning with Many Relevant Features. In: Nédellec, C., Rouveirol, C. (eds.) ECML 1998. LNCS, vol. 1398, pp. 170–178. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  2. Craven, M., Dipasquo, D., Freitag, D., McCallum, A., Mitchell, T., Nigam, K., Slattery, S.: Learning to Symbolic Knowledge from the World Wide Web. In: Proceeding of the 15th Na-tional Conference on Artificial Intelligence (AAAI 1998), pp. 509–516 (1998)

    Google Scholar 

  3. Lang, K.: Newsweeder: Learning to Filter Netnews. In: Machine Learning: Proceeding of the Twelfth International (ICML 1995), pp. 331–339 (1995)

    Google Scholar 

  4. Yang, Y.: An Evaluation of Statistical Approaches to Text Classification. Journal of Infor-mation Retrieval 1, 69–90 (1999)

    Article  Google Scholar 

  5. Pawlak, Z.: Rough Sets–Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

  6. Skowron, A., Rauszer, C.: The Discernibility Matrices and Functions in Information Systems. In: Slowinski, R. (ed.) Intelligent Decision Support – Handbook of Application and Advances of Rough Sets Theory, pp. 331–362. Kluwer Academic Publishers, Dordrecht (1992)

    Google Scholar 

  7. Chouchoulas, A., Shen, Q.: A Rough Set-Based Approach to Text Classification. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) RSFDGrC 1999. LNCS (LNAI), vol. 1711, pp. 118–129. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  8. Ishii, N., Bao, Y.: A Simple Method of Computing Value Reduction. In: Proceedings of CSITeA 2002, Brazil, pp. 76–80 (2002)

    Google Scholar 

  9. Bao, Y., Asai, D., Du, X., Yamada, K., Ishii, N.: An effective rough setbased method for text classification. In: Liu, J., Cheung, Y.-m., Yin, H. (eds.) IDEAL 2003. LNCS, vol. 2690. Springer, Heidelberg (2003) (in printing)

    Google Scholar 

  10. van Rijsbergen, C.J.: Information retrieval, Butterworths, United Kingdom (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bao, Y., Asai, D., Du, X., Ishii, N. (2003). Partition for the Rough Set-Based Text Classification. In: Dong, G., Tang, C., Wang, W. (eds) Advances in Web-Age Information Management. WAIM 2003. Lecture Notes in Computer Science, vol 2762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45160-0_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45160-0_18

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics