{"title":"基于支持向量机的软件工作量估计的类划分方法","authors":"Anurag Tiwari, Amrita Chaturvedi","doi":"10.1109/UPCON.2016.7894732","DOIUrl":null,"url":null,"abstract":"Software effort estimation consists of those procedures and activities which help to predict most accurate development effort as well as cost of a software product. After analyzing various proposed concept and theories regarding this we tried to give a new concept which works over partition of a data set. The partition procedure depends over the correlation of input features as well as output features. This algorithm is a generic concept which can be useful in other fields also. Previously proposed models and theories depend on the detection and prediction methodologies. In detection process, developers try to find out loopholes in the prior proposed models while in prediction model they try to develop a new theory that mitigates those loopholes. In our proposed approach we work over a mathematical model that can be a replacement of a well-known data mining algorithm K-NN (K nearest neighbor), which uses clusters for classification. Our proposed methodology is based on feature selection. This feature selection process is based on correlation coefficient that can be defined by the user. After feature selection, we tried to achieve the rate of change of the target attribute with respect to the other attributes. We have classified the data vectors according to the rate of change of target value (Effort) and attributes obtained after feature selection. Target value (Effort) will be fixing for whole processing. Finally we applied regression to obtain a mathematical model for the corresponding class.","PeriodicalId":151809,"journal":{"name":"2016 IEEE Uttar Pradesh Section International Conference on Electrical, Computer and Electronics Engineering (UPCON)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Class partition approach for software effort estimation using support vector machine\",\"authors\":\"Anurag Tiwari, Amrita Chaturvedi\",\"doi\":\"10.1109/UPCON.2016.7894732\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Software effort estimation consists of those procedures and activities which help to predict most accurate development effort as well as cost of a software product. After analyzing various proposed concept and theories regarding this we tried to give a new concept which works over partition of a data set. The partition procedure depends over the correlation of input features as well as output features. This algorithm is a generic concept which can be useful in other fields also. Previously proposed models and theories depend on the detection and prediction methodologies. In detection process, developers try to find out loopholes in the prior proposed models while in prediction model they try to develop a new theory that mitigates those loopholes. In our proposed approach we work over a mathematical model that can be a replacement of a well-known data mining algorithm K-NN (K nearest neighbor), which uses clusters for classification. Our proposed methodology is based on feature selection. This feature selection process is based on correlation coefficient that can be defined by the user. After feature selection, we tried to achieve the rate of change of the target attribute with respect to the other attributes. We have classified the data vectors according to the rate of change of target value (Effort) and attributes obtained after feature selection. Target value (Effort) will be fixing for whole processing. Finally we applied regression to obtain a mathematical model for the corresponding class.\",\"PeriodicalId\":151809,\"journal\":{\"name\":\"2016 IEEE Uttar Pradesh Section International Conference on Electrical, Computer and Electronics Engineering (UPCON)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE Uttar Pradesh Section International Conference on Electrical, Computer and Electronics Engineering (UPCON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/UPCON.2016.7894732\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Uttar Pradesh Section International Conference on Electrical, Computer and Electronics Engineering (UPCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UPCON.2016.7894732","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
摘要
软件工作评估由那些有助于预测最准确的开发工作和软件产品成本的过程和活动组成。在分析了各种相关的概念和理论之后,我们试图给出一个新的概念,它适用于数据集的划分。分割过程取决于输入特征和输出特征的相关性。该算法是一个通用概念,在其他领域也有应用价值。以前提出的模型和理论依赖于检测和预测方法。在检测过程中,开发人员试图找出先前提出的模型中的漏洞,而在预测模型中,他们试图开发新的理论来缓解这些漏洞。在我们提出的方法中,我们研究了一个数学模型,该模型可以替代著名的数据挖掘算法K- nn (K近邻),该算法使用聚类进行分类。我们提出的方法是基于特征选择。这个特征选择过程是基于用户可以定义的相关系数。在特征选择之后,我们试图获得目标属性相对于其他属性的变化率。我们根据目标值(Effort)的变化率和特征选择后得到的属性对数据向量进行分类。整个过程的目标值(努力)将被固定。最后运用回归方法得到了相应类别的数学模型。
Class partition approach for software effort estimation using support vector machine
Software effort estimation consists of those procedures and activities which help to predict most accurate development effort as well as cost of a software product. After analyzing various proposed concept and theories regarding this we tried to give a new concept which works over partition of a data set. The partition procedure depends over the correlation of input features as well as output features. This algorithm is a generic concept which can be useful in other fields also. Previously proposed models and theories depend on the detection and prediction methodologies. In detection process, developers try to find out loopholes in the prior proposed models while in prediction model they try to develop a new theory that mitigates those loopholes. In our proposed approach we work over a mathematical model that can be a replacement of a well-known data mining algorithm K-NN (K nearest neighbor), which uses clusters for classification. Our proposed methodology is based on feature selection. This feature selection process is based on correlation coefficient that can be defined by the user. After feature selection, we tried to achieve the rate of change of the target attribute with respect to the other attributes. We have classified the data vectors according to the rate of change of target value (Effort) and attributes obtained after feature selection. Target value (Effort) will be fixing for whole processing. Finally we applied regression to obtain a mathematical model for the corresponding class.