By Topic

An Improved Similarity Measure for Binary Features in Software Clustering

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Naseem, R. ; Dept. of Comput. Sci., Quaid-I-Azam Univ., Islamabad, Pakistan ; Maqbool, O. ; Muhammad, S.

In recent years, there has been increasing interest in exploring clustering as a technique to recover the architecture of software systems. The efficacy of clustering depends not only on the clustering algorithm, but also on the choice of entities, features and similarity measures used during clustering. It is also important to understand characteristics of the domain in which clustering is being applied, since the performance of different measures and algorithms may vary depending on these characteristics. In the software domain, the Jaccard similarity measure gives better results as compared to other similarity measures for binary features. In this paper, we highlight cases where the Jaccard measure may fail to capture similarity between entities appropriately. We propose a new similarity measure which overcomes these deficiencies. Our experimental results indicate the better performance of the new similarity measure for software systems exhibiting the defined characteristics.

Published in:

Computational Intelligence, Modelling and Simulation (CIMSiM), 2010 Second International Conference on

Date of Conference:

28-30 Sept. 2010