A novel approach for unsupervised learning of software components

C. Srinivas, C. V. Rao
{"title":"A novel approach for unsupervised learning of software components","authors":"C. Srinivas, C. V. Rao","doi":"10.1145/3330431.3330461","DOIUrl":null,"url":null,"abstract":"Clustering and classification are two important tasks in data mining and machine learning. These tasks have various applications in other related areas of research such as software engineering, text mining, image processing, and bio-informatics. Clustering is an NP-Hard problem, i.e. there is no proved polynomial time algorithm that can cluster a given set of input instances. However, approaches for evaluating cluster quality exist in the literature. This paper gives a new approach for software component learning by introducing an incremental learning approach for component clustering. Experiments are conducted by applying proposed approach on synthetic dataset and results proved the importance of proposed approach in terms of execution time and memory consumed.","PeriodicalId":196960,"journal":{"name":"Proceedings of the 5th International Conference on Engineering and MIS","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 5th International Conference on Engineering and MIS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3330431.3330461","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Clustering and classification are two important tasks in data mining and machine learning. These tasks have various applications in other related areas of research such as software engineering, text mining, image processing, and bio-informatics. Clustering is an NP-Hard problem, i.e. there is no proved polynomial time algorithm that can cluster a given set of input instances. However, approaches for evaluating cluster quality exist in the literature. This paper gives a new approach for software component learning by introducing an incremental learning approach for component clustering. Experiments are conducted by applying proposed approach on synthetic dataset and results proved the importance of proposed approach in terms of execution time and memory consumed.
软件组件无监督学习的新方法
聚类和分类是数据挖掘和机器学习中的两个重要任务。这些任务在其他相关研究领域有各种应用,如软件工程、文本挖掘、图像处理和生物信息学。聚类是一个np困难问题,即没有证明的多项式时间算法可以聚类给定的输入实例集。然而,文献中存在评估聚类质量的方法。本文通过引入一种用于组件聚类的增量学习方法,为软件组件学习提供了一种新的方法。将该方法应用于合成数据集上进行了实验,结果证明了该方法在执行时间和内存消耗方面的重要性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信