An approach to classify software maintenance requests (original) (raw)

2002, Software Maintenance, …

Abstract

When a software system critical for an organization exhibits a problem during its operation, it is relevant to fix it in a short period of time, to avoid serious economical losses. The problem is therefore noticed to the organization having in charge the maintenance, and it should be correctly and quickly dispatched to the right maintenance team.

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

References (19)

  1. IEEE std 1219: Standard for Software maintenance. 1998.
  2. G. Antoniol, G. Casazza, G. A. Di Lucca, M. Di Penta, and F. Rago. A queue theory-based approach to staff software maintenance centers. In Proceedings of IEEE International Conference on Software Maintenance, November 2001.
  3. L. Bain and M. Engelhardt. Introduction to Probability and Mathematical statistics. Duxburry Press, Belmont,CA, 1992.
  4. L. Breiman, J. Friedman, R. Olshen, and C. Stone. Classifi- cation and Regression Trees. Chapman & Hall, New York, 1984.
  5. E. Burch and K. H.J. Modeling software maintenance re- quests: A case study. In Proceedings of IEEE International Conference on Software Maintenance, pages 40-47, 1997.
  6. R. De Mori. Spoken dialogues with computers. Academic Press, Inc., Orlando, Florida 32887, 1998.
  7. M. Di Penta, G. Casazza, G. Antoniol, and E. Merlo. Model- ing web maintenance centers through queue models. In Con- ference on Software Maintenance and Reengineering, pages 131-138, March 2001.
  8. S. Dumais, J. Platt, D. Heckerman, and M. Sahami. In- ductive learning algorithm and representation for text cat- egorization. In Conference on Information and Knowledge Management, pages 148-155, November 1998.
  9. J. Goldberg. Cdm: an approach to learning in text cate- gorization. International Journal on Artificial Intelligence Tools, 5(1/2):229-253, 1996.
  10. D. Harman. Ranking algorithms. In Information Retrival: Data Structures and Algorithms, pages 363-392. Prentice- Hall, Englewood Cliffs, NJ, 1992.
  11. T. Joachims. Text categorization with support vector ma- chines: Learning with many relevant features. In European Conference in Machine Learning, 1998.
  12. D. Lewis and M. Ringuette. A comparison of two learning algorithms for text categorization. In Third Annual Sympo- sium on Document Analysis and Information retrivial, pages 81-93, Las Vegas, NV, April 1994.
  13. T. Mitchell. Machine Learning. McGraw-Hill, USA, 1997.
  14. A. Mockus and L. Votta. Idenitifying reasons for software changes using historic database. In Proceedings of IEEE International Conference on Software Maintenance, pages 120-130, San Jose, California, October 2000.
  15. H. New and U. Essen. On smoothing techniques for bigram- bases natural language modelling. In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, volume S12.11, pages 825-828, Toronto Canada, 1991.
  16. G. Salton and C. Buckley. Term-weighting approaches in automatic text retrieval. Information Processing and Man- agement, 24(5):513-523, 1988.
  17. M. Stone. Cross-validatory choice and assesment of statisti- cal predictions (with discussion). Journal of the Royal Sta- tistical Society B, 36:111-147, 1974.
  18. V. Vapnik. The Nature of Statistical Learning Theory. Springer-Verlag, Berlin, Germany, 1995.
  19. I. H. Witten and T. C. Bell. The zero-frequency problem: Estimating the probabilities of novel events in adaptive text compression. IEEE Trans. Inform. Theory, IT-37(4):1085- 1094, 1991.