Performance Evaluation of Various Machine Learning Algorithms for User Story Clustering

In agile development, user stories are the primary method for defining requirements.These days, managing user stories effectively is difficult because software projects typically contain a large number of them.A project can involve a large amount of user stories, which should be clustered into different groups based on their functionality's similarity for systematic requirements analysis, effective mapping to developed features, and efficient maintenance.Unfortunately, the majority of user story clustering methods now in use require a great deal of manual work, which is error-prone and time-consuming.In this research, we suggest an automated framework that uses a family of machine learning algorithms to classify user stories.First, preprocessing the data is done in order to examine user stories and extract keywords from them.After that, features are taken out, which allow user stories to be automatically grouped into distinct categories.We use four feature extraction algorithms and six clustering algorithms.According to our experimental results, K-means and BIRCH clustering outperform other clustering methods, whereas cosine similarity and distance are the best feature extraction for user stories categorization to form the more balanced clusters as they both have the standard deviation is 3.08.In case of user stories cohesion, the silhouette coefficient value is 0.225 for spectral with (cosine similarity and cosine distance feature extraction) is best outcome than other clustering algorithms.The usefulness and applicability of the suggested framework are demonstrated by this study.Additionally, it offers some useful recommendations for enhancing the effectiveness of user stories clustering, for example through parameter adjustments for enhanced feature extraction and clustering.

Authors

Publication Details

Journal
International Journal of Modern Education and Computer Science
Published
2025-06-02
DOI
https://doi.org/10.5815/ijmecs.2025.03.07
Primary Topic
Network Security and Intrusion Detection
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Performance Evaluation of Various Machine Learning Algorithms for User Story Clustering

Dinesh C. Dobhal, Umesh Kumar Tiwari, Bhawnesh Kumar
International Journal of Modern Education and Computer Science
Network Security and Intrusion Detection
article

Performance Evaluation of Various Machine Learning Algorithms for User Story Clustering

Dinesh C. Dobhal, Umesh Kumar Tiwari, Bhawnesh Kumar
article en

Abstract

In agile development, user stories are the primary method for defining requirements.These days, managing user stories effectively is difficult because software projects typically contain a large number of them.A project can involve a large amount of user stories, which should be clustered into different groups based on their functionality's similarity for systematic requirements analysis, effective mapping to developed features, and efficient maintenance.Unfortunately, the majority of user story clustering methods now in use require a great deal of manual work, which is error-prone and time-consuming.In this research, we suggest an automated framework that uses a family of machine learning algorithms to classify user stories.First, preprocessing the data is done in order to examine user stories and extract keywords from them.After that, features are taken out, which allow user stories to be automatically grouped into distinct categories.We use four feature extraction algorithms and six clustering algorithms.According to our experimental results, K-means and BIRCH clustering outperform other clustering methods, whereas cosine similarity and distance are the best feature extraction for user stories categorization to form the more balanced clusters as they both have the standard deviation is 3.08.In case of user stories cohesion, the silhouette coefficient value is 0.225 for spectral with (cosine similarity and cosine distance feature extraction) is best outcome than other clustering algorithms.The usefulness and applicability of the suggested framework are demonstrated by this study.Additionally, it offers some useful recommendations for enhancing the effectiveness of user stories clustering, for example through parameter adjustments for enhanced feature extraction and clustering.

International Journal of Modern Education and Computer ScienceVol. 17(3)
Openalex Percentile: Top 87%
Network Security and Intrusion Detection
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.