Skip to main content

Using Approximate Reduct and LVQ in Case Generation for CBR Classifiers

  • Chapter
Transactions on Rough Sets VII

Part of the book series: Lecture Notes in Computer Science ((TRS,volume 4400))

  • 521 Accesses

Abstract

Case generation is a process of extracting representative cases to form a compact case base. In order to build competent and efficient CBR classifiers, we develop a case generation approach which integrates fuzzy sets, rough sets and learning vector quantization (LVQ). If the feature values of the cases are numerical, fuzzy sets are firstly used to discretize the feature spaces. Secondly, a fast rough set-based feature selection method is applied to identify the significant features. Different from the traditional discernibility function-based methods, the feature reduction method is based on a new concept of approximate reduct. The representative cases (prototypes) are then generated through LVQ learning process on the case bases after feature selection. LVQ is the supervised version of self-organizing map (SOM), which is more suitable to classification problems. Finally, a few of prototypes are generated as the representative cases of the original case base. These prototypes can be also considered as the extracted knowledge which improves the understanding of the case base. Three real life data are used in the experiments to demonstrate the effectiveness of this case generation approach. Several evaluation indices, such as classification accuracy, the storage space, case retrieval time and clustering performance in terms of intro-similarity and inter-similarity, are used in these testing.

This work is supported by the Hong Kong government CERG research grant BQ-496.

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

References

  1. Kolodner, J.: Case-Based Reasoning. Morgan Kaufmann, San Francisco (1993)

    Google Scholar 

  2. Pal, S.K., Shiu, S.C.K.: Foundations of Soft Case-Based Reasoning. John Wiley, New York (2004)

    Google Scholar 

  3. Kalapanidas, E., Avouris, N.: Short-term air quality prediction using a case-based classifier. Environmental Modelling & Software 16(3), 263–272 (2001)

    Article  Google Scholar 

  4. Emam, K.E., et al.: Comparing case-based reasoning classifiers for predicting high risk software components. Journal of Systems and Software 55(3), 301–320 (2001)

    Article  Google Scholar 

  5. Garrell, J.M., et al.: Automatic diagnosis with genetic algorithms and case-based reasoning. Artificial Intelligence in Engineering 13(4), 367–372 (1999)

    Article  Google Scholar 

  6. Pawlak, Z.: Rough sets: Theoretical aspects of reasoning about data. Kluwer Academic Publishers, Boston (1991)

    MATH  Google Scholar 

  7. Nguyen, H.S., Skowron, A.: Boolean reasoning for feature extraction problems. In: Proceedings of the 10th International Symposium on Methodologies for Intelligent Systems, pp. 117–126 (1997)

    Google Scholar 

  8. Wang, J., Wang, J.: Reduction algorithms based on discernibility matrix: The ordered attributes method. Journal of Computer Science & Technology 16(6), 489–504 (2001)

    Article  MATH  Google Scholar 

  9. Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Slowinski, K. (ed.) Intelligent Decision Support-Handbook of Applications and Advances of the Rough Sets Theory, pp. 331–362. Kluwer, Dordrecht (1992)

    Google Scholar 

  10. Shen, Q., Chouchoulas, A.: A rough-fuzzy approach for generating classification rules. Pattern Recognition 35, 2425–2438 (2002)

    Article  MATH  Google Scholar 

  11. Kohonen, T.: Self-organization and associative memory. Springer, New York (1988)

    MATH  Google Scholar 

  12. Kohonen, T.: Self-organizing maps. Springer, New York (1997)

    MATH  Google Scholar 

  13. Mangiameli, P., Chen, S.K., West, D.: A comparison of SOM neural network and hierarchical clustering methods. European Journal of Operational Research 93, 402–417 (1996)

    Article  MATH  Google Scholar 

  14. Pal, S.K., Dasgupta, B., Mitra, P.: Rough-self organizing map. Applied Intelligence 21(3), 289–299 (2004)

    Article  MATH  Google Scholar 

  15. Han, J., Hu, X., Lin, T.Y.: Feature subset selection based on relative dependency between attributes. In: Tsumoto, S., et al. (eds.) RSCTC 2004. LNCS (LNAI), vol. 3066, pp. 176–185. Springer, Heidelberg (2004)

    Google Scholar 

  16. Bazan, J., et al.: Rough Set Algorithms in Classification Problem. In: Polkowski, L., Tsumoto, S., Lin, T.Y. (eds.) Rough Set Methods and Applications, pp. 49–88. Physica, Heidelberg (2000)

    Google Scholar 

  17. UCI Machine Learning Data Repository: http://www.ics.uci.edu/~mlearn/MLRepository.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

James F. Peters Andrzej Skowron Victor W. Marek Ewa Orłowska Roman Słowiński Wojciech Ziarko

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this chapter

Cite this chapter

Li, Y., Shiu, S.CK., Pal, S.K., Liu, J.NK. (2007). Using Approximate Reduct and LVQ in Case Generation for CBR Classifiers. In: Peters, J.F., Skowron, A., Marek, V.W., Orłowska, E., Słowiński, R., Ziarko, W. (eds) Transactions on Rough Sets VII. Lecture Notes in Computer Science, vol 4400. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71663-1_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71663-1_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71662-4

  • Online ISBN: 978-3-540-71663-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics