Software architecture decomposition plays an important role in software design cascading effect on various development phases. Software designer decomposes software based on his/her experience. Though it may work well for some, in reality many systems failed to meet the requirements as a result of poor design. Software architecture decomposition using clustering techniques has been investigated in software engineering research. This paper presents an enhanced approach for software architecture decomposition. We used two hierarchical agglomerative clustering methods and adaptive K-nearest neighbor algorithm in this enhanced approach and applied it on two industrial software systems. Results show that the approach provides objective and insightful information for software designer.

Additional Metadata
Keywords Algorithms, Clustering, Design Software Architecture, Pattern Recognition
Persistent URL dx.doi.org/10.1109/CCECE.2013.6567812
Conference 2013 26th IEEE Canadian Conference on Electrical and Computer Engineering, CCECE 2013
Citation
Alkhalid, A. (Abdulaziz), Lung, C.H, & Ajila, S. (2013). Software architecture decomposition using adaptive K-nearest neighbor algorithm. Presented at the 2013 26th IEEE Canadian Conference on Electrical and Computer Engineering, CCECE 2013. doi:10.1109/CCECE.2013.6567812