...
首页> 外文期刊>The international arab journal of information technology >An Approach for Clustering Class Coupling Metrics to Mine Object Oriented Software Components
【24h】

An Approach for Clustering Class Coupling Metrics to Mine Object Oriented Software Components

机译:一种将类耦合度量聚类到矿井面向对象软件组件的方法

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Unsupervised learning methods such as clustering techniques are a natural choice for analyzing software quality by mining its related metrics. It is well known that clustering plays an important role in data mining tasks like in data analysis and information retrieval. In this paper, we have proposed an approach to cluster the pool of java classes based on the proximity between them. To know the proximity, coupling between each pair of classes is calculated in terms of weights using the weighted coupling measures. We modified document representations scheme as per our requirement to represent collected class coupling measures before applying k-mean clustering algorithm. In order to, reduce the dependency of k-mean clustering results efficiency on the choice of initial centroids, neighbor and link based criteria's for selecting initial k centroids have been proposed in the context of Object Oriented (OO) design artifacts i.e., classes. We demonstrate our work in detail and compare results of K-mean algorithm based on random and neighbor and link based initial centroids selection criteria's. Further the results of clustering are analyzed through purity and F-measure. It has been observed that definition of neighbor and link can be interpreted well in terms of the coupling between OO classes and produces best K-mean clustering results. Our approach of software component clustering may become an integral part of a framework to analyze and predict software quality attributes.
机译:诸如聚类技术之类的无监督学习方法是通过挖掘软件的相关指标来分析软件质量的自然选择。众所周知,集群在诸如数据分析和信息检索之类的数据挖掘任务中起着重要作用。在本文中,我们提出了一种基于Java类库之间的接近度对其进行聚类的方法。为了知道接近度,使用加权耦合度量以权重来计算每对类别之间的耦合。在应用k均值聚类算法之前,我们根据要求修改了文档表示方案,以表示收集的类耦合度量。为了减少k均值聚类结果效率对初始质心的选择的依赖性,已经在面向对象(OO)设计工件即类别的背景下提出了用于选择初始k质心的基于邻居和链接的标准。我们详细演示了我们的工作,并比较了基于随机和邻居以及基于链接的初始质心选择标准的K-mean算法的结果。此外,通过纯度和F度量分析了聚类的结果。已经观察到,根据OO类之间的耦合可以很好地解释邻居和链接的定义,并且可以产生最佳的K均值聚类结果。我们的软件组件聚类方法可能会成为分析和预测软件质量属性的框架的组成部分。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号