A Feature Vector Based Approach for Software Component Clustering and Reuse Using K-means

C. Srinivas, C. V. Rao
{"title":"A Feature Vector Based Approach for Software Component Clustering and Reuse Using K-means","authors":"C. Srinivas, C. V. Rao","doi":"10.1145/2832987.2833080","DOIUrl":null,"url":null,"abstract":"Software component clustering is an unsupervised learning approach which is used to cluster the software components. These clusters may then be used to study, analyze, understand behavior of the software components. In this paper, we use the k-means clustering algorithm to cluster the software components. The main difference lies in the use of distance measure which is designed to find the similarity between the software components. We use the distance measure [12], to find the pair wise project distance matrix and apply the k-means algorithm on this distance matrix. The main idea is to use more than one distance measure, to explore consensus based technique, so as to cluster software components, instead of using only one measure to cluster the components. This approach may also be applied for software architecture recovery problem by using our distance measure.","PeriodicalId":416001,"journal":{"name":"Proceedings of the The International Conference on Engineering & MIS 2015","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the The International Conference on Engineering & MIS 2015","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2832987.2833080","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

Software component clustering is an unsupervised learning approach which is used to cluster the software components. These clusters may then be used to study, analyze, understand behavior of the software components. In this paper, we use the k-means clustering algorithm to cluster the software components. The main difference lies in the use of distance measure which is designed to find the similarity between the software components. We use the distance measure [12], to find the pair wise project distance matrix and apply the k-means algorithm on this distance matrix. The main idea is to use more than one distance measure, to explore consensus based technique, so as to cluster software components, instead of using only one measure to cluster the components. This approach may also be applied for software architecture recovery problem by using our distance measure.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于特征向量的k均值软件组件聚类与重用方法
软件组件聚类是一种用于对软件组件进行聚类的无监督学习方法。这些集群可以用来研究、分析和理解软件组件的行为。本文采用k-means聚类算法对软件组件进行聚类。主要区别在于使用距离度量,该度量旨在找到软件组件之间的相似性。我们使用距离度量[12]来找到对项目距离矩阵,并对该距离矩阵应用k-means算法。主要思想是使用多个距离度量,探索基于共识的技术,从而聚类软件组件,而不是仅使用一个度量来聚类组件。这种方法也可以通过使用我们的距离度量来应用于软件架构恢复问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Hybrid Discrete Flower Pollination Algorithm for Graph Coloring Problem QoS web service Security Access Control case study using HTTP Secured Socket Layer Approach An improved k-Means Clustering algorithm for Intrusion Detection using Gaussian function A Feature Vector Based Approach for Software Component Clustering and Reuse Using K-means A Proposed Method to Recognize the Research Trends using Web-based Search Engines
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1