Skip to main content

Maintenance by a Committee of Experts: The MACE Approach to Case-Base Maintenance

  • Conference paper
Case-Based Reasoning Research and Development (ICCBR 2009)

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

Included in the following conference series:

Abstract

Case-base administrators face a choice of many maintenance algorithms. It is well-known that these algorithms have different biases that cause them to perform inconsistently over different datasets. In this paper, we demonstrate some of the biases of the most commonly-used maintenance algorithms. This motivates our new approach: maintenance by a committee of experts (MACE). We create composite algorithms that comprise more than one individual maintenance algorithm in the hope that the strengths of one algorithm will compensate for the weaknesses of another. In MACE, we combine algorithms in two ways: either we put them in sequence so that one runs after the other, or we allow them to run separately and then vote as to whether a case should be deleted or not. We define a grammar that describes how these composites are created. We perform experiments based on 27 diverse datasets. Our results show that the MACE approach allows us to define algorithms with different trade-offs between accuracy and the amount of deletion.

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. Asuncion, A., Newman, D.J.: UCI Machine Learning Repository (2007)

    Google Scholar 

  2. Brighton, H., Mellish, C.: On the Consistency of Information Filters for Lazy Learning Algorithms. In: Rauch, J., Zytkow, J.M. (eds.) PKDD 1999. LNCS, vol. 1704, pp. 283–288. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  3. Brodley, C.E., Friedl, M.A.: Identifying and Eliminating Mislabeled Training Instances. In: AAAI/IAAI, pp. 799–805. AAAI Press, Menlo Park (1996)

    Google Scholar 

  4. Cunningham, P., Zenobi, G.: Case Representation Issues for Case-Based Reasoning from Ensemble Research. In: Aha, D.W., Watson, I. (eds.) ICCBR 2001. LNCS, vol. 2080, pp. 146–157. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Delany, S.J., Cunningham, P.: An Analysis of Case-Based Editing in a Spam Filtering System. In: Funk, P., González-Calero, P. (eds.) ECCBR 2004. LNCS, vol. 3155, pp. 128–141. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Dietterich, T.G.: Ensemble Methods in Machine Learning. In: Kittler, J., Roli, F. (eds.) MCS 2000. LNCS, vol. 1857, pp. 1–15. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. Doyle, D., Cunningham, P., Bridge, D.G., Rahman, Y.: Explanation Oriented Retrieval. In: Funk, P., González Calero, P.A. (eds.) ECCBR 2004. LNCS, vol. 3155, pp. 157–168. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Ho, T.K., Basu, M.: Measuring the Complexity of Classification Problems. In: Procs. of the 15th International Conference on Pattern Recognition, 2000, pp. 43–47 (2000)

    Google Scholar 

  9. Leake, D.B., Sooriamurthi, R.: When Two Case Bases Are Better than One: Exploiting Multiple Case Bases. In: Aha, D.W., Watson, I. (eds.) ICCBR 2001. LNCS, vol. 2080, pp. 321–335. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. McKenna, E., Smyth, B.: Competence-Guided Case-Base Editing Techniques. In: Blanzieri, E., Portinale, L. (eds.) EWCBR 2000. LNCS, vol. 1898, pp. 186–197. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  11. Nicholson, R., Bridge, D., Wilson, N.: Decision Diagrams: Fast and Flexible Support for Case Retrieval and Recommendation. In: Roth-Berghofer, T., Göker, M.H., Altay Güvenir, H. (eds.) ECCBR 2006. LNCS (LNAI), vol. 4106, pp. 136–150. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Orecchioni, A., Wiratunga, N., Massie, S., Craw, S.: k-NN Aggregation with a Stacked Email Representation. In: Althoff, K.D., Bergmann, R., Minor, M., Hanft, A. (eds.) ECCBR 2008. LNCS, vol. 5239, pp. 415–429. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Plaza, E., McGinty, L.: Distributed Case-Based Reasoning. The Knowledge Engineering Review 20(3), 261–265 (2006)

    Article  Google Scholar 

  14. Quinlan, R.J.: Bagging, Boosting, and C4.5. In: AAAI/IAAI, vol. 1, pp. 725–730. AAAI Press, Menlo Park (1996)

    Google Scholar 

  15. Tomek, I.: An Experiment with the Edited Nearest-Neighbor Rule. IEEE Transactions on Systems, Man, and Cybernetics 6(6), 448–452 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  16. Wilson, D.R., Martinez, T.R.: Instance Pruning Techniques. In: Fisher, D. (ed.) Procs. of the 14th International Conference on Machine Learning, ICML, pp. 403–411. Morgan Kaufmann, San Francisco (1997)

    Google Scholar 

  17. Wiratunga, N., Craw, S., Rowe, R.: Learning to Adapt for Case-Based Design. In: Craw, S., Preece, A.D. (eds.) ECCBR 2002. LNCS, vol. 2416, pp. 421–435. Springer, Heidelberg (2002)

    Chapter  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

Cummins, L., Bridge, D. (2009). Maintenance by a Committee of Experts: The MACE Approach to Case-Base Maintenance. In: McGinty, L., Wilson, D.C. (eds) Case-Based Reasoning Research and Development. ICCBR 2009. Lecture Notes in Computer Science(), vol 5650. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02998-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02998-1_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02997-4

  • Online ISBN: 978-3-642-02998-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics