Skip to main content

Improving Rules Quality Generated by Rough Set Theory for the Diagnosis of Students with LDs through Mixed Samples Clustering

  • Conference paper
  • 2630 Accesses

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

Abstract

Due to the implicit characteristics of learning disabilities (LDs), the identification or diagnosis of students with LDs has long been a difficult issue. In this study, we apply rough set theory (RST), which may produce meaningful explanations or rules, to the LD identification application. We also propose to mix samples collected from sources with different LD diagnosis procedure and criteria. By pre-processing these mixed samples with some simple and readily available clustering algorithms, we are able to improve the quality of rules generated by RST. Our experiments also indicate that RST performs better in term of prediction certainty than other rule-based algorithms such as decision tree and ripper algorithms. Overall, we believe that RST may have the potential in playing an essential role in the field of LD diagnosis.

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   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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wu, T.-K., Huang, S.-C., Meng, Y.-R.: Evaluation of ANN and SVM Classifiers as Predictors to the Diagnosis of Students with Learning Disabilities. Expert Systems with Applications 34(3), 1846–1856 (2008)

    Article  Google Scholar 

  2. Baesens, B., Van Gestel, T., Viaene, S., Stepanova, M., Suykens, J., Vanthienen, J.: Benchmarking State-of-the-Art Classification Algorithms for Credit Scoring. Journal of the Operational Research Society 54, 627–635 (2003)

    Article  MATH  Google Scholar 

  3. Bishop, C.M.: Neural Networks for Pattern Recognition. Oxford University Press, Oxford (1995)

    MATH  Google Scholar 

  4. Cortes, C., Vapnik, V.: Support-Vector Machine Learning, vol. 20, pp. 237–297. Kluwer Academic Publisher, Dordrecht (1995)

    MATH  Google Scholar 

  5. Wu, T.-K., Huang, S.-C., Meng, Y.-R.: Improving ANN Classification Accuracy for the Identification of Students with LDs through Evolutionary Computation. In: Proceedings of the 2007 IEEE Congress on Evolutionary Computation, Singapore, September 25-28 (2007)

    Google Scholar 

  6. Pawlak, Z.: Rough sets. International Journal of Information and Computer Science 11(5), 341–356 (1982)

    Article  MATH  Google Scholar 

  7. Pawlak, Z.: A Primer on Rough Sets: a New Approach to Drawing Conclusions from Data. Cardozo Law Review 22, 1407–1415 (2001)

    Google Scholar 

  8. Suraj, Z.: An Introduction to Rough Set Theory and Its Applications - A tutorial. In: Suraj, Z. (ed.) ICENCO 2004, Cairo, Egypt, December 27-30 (2004)

    Google Scholar 

  9. An, A., Huang, Y., Huang, X., Cercone, N.: Feature Selection with Rough Sets for Web Page Classification. In: Peters, J.F., Skowron, A., Dubois, D., Grzymała-Busse, J.W., Inuiguchi, M., Polkowski, L. (eds.) Transactions on Rough Sets II. LNCS, vol. 3135, pp. 1–13. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Bazan, J.G., Szczuka, M.S.: RSES and rSESlib - A collection of tools for rough set computations. In: Ziarko, W.P., Yao, Y. (eds.) RSCTC 2000. LNCS (LNAI), vol. 2005, pp. 106–113. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Chen, C.-Y., Li, Z.-G., Qiao, S.-Y., Wen, S.-P.: Study on Discretization in Rough Set Based on Genetic Algorithm. In: Proceedings of the Second International Conference on Machine Learning and Cybernetics, Xi’an, November 2-5 (2003)

    Google Scholar 

  12. Nguyen, S.H., Nguyen, H.S.: Discretization Problems for Rough Set Methods. In: Knoop, J. (ed.) Optimal Interprocedural Program Optimization. LNCS (LNAI), vol. 1428, pp. 545–552. Springer, Heidelberg (1998)

    Google Scholar 

  13. Chau, M., Cheng, R., Kao, B., Ng, J.: Uncertain Data Mining: An Example in Clustering Location Data. In: Ng, W.-K., Kitsuregawa, M., Li, J., Chang, K. (eds.) PAKDD 2006. LNCS (LNAI), vol. 3918, pp. 199–204. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  14. Hartigan, J., Wong, M.: Algorithm AS136: A k-means clustering algorithm. Applied Statistics 28, 100–108 (1979)

    Article  MATH  Google Scholar 

  15. Kayard, M.: Two-Step Clustering Analysis in Researches: A Case Study. Eurasian Journal of Educational Research 28, 89–99 (2007)

    Google Scholar 

  16. Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers, San Francisco (1993)

    Google Scholar 

  17. Cohen, W.W.: Fast Effective Rule Induction. In: Proceedings of International Conference on Machine Learning, Lake Tahoe, CA (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, TK., Huang, SC., Meng, YR., Lin, YC. (2009). Improving Rules Quality Generated by Rough Set Theory for the Diagnosis of Students with LDs through Mixed Samples Clustering. In: Wen, P., Li, Y., Polkowski, L., Yao, Y., Tsumoto, S., Wang, G. (eds) Rough Sets and Knowledge Technology. RSKT 2009. Lecture Notes in Computer Science(), vol 5589. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02962-2_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02962-2_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02961-5

  • Online ISBN: 978-3-642-02962-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics