Benefits of applying clustering algorithms to finding change request patterns

Group change requests according to text similarity

From the developerWorks archives

Luis Quintela

Date archived: December 20, 2016 | First published: April 17, 2012

This article describes an approach for analyzing IBM Rational Team Concert change request patterns by applying machine learning techniques, specifically clustering algorithms, to group the change requests according to text similarity. By performing this analysis, software development projects benefit in quality improvement, reuse, process, and team collaboration. The analysis described in this article as an example relies on the Apache Mahout library implementation of the k-means clustering algorithm.

This content is no longer being updated or maintained. The full article is provided "as is" in a PDF file. Given the rapid evolution of technology, some steps and illustrations may have changed.



static.content.url=http://www.ibm.com/developerworks/js/artrating/
SITE_ID=1
Zone=Rational
ArticleID=810167
ArticleTitle=Benefits of applying clustering algorithms to finding change request patterns
publish-date=04172012