An Innovation Success Prediction Model of Android Application Using Logistic Regression Over MLC in Combination with PCA

A. Ranadheer, L. Parvathy
{"title":"An Innovation Success Prediction Model of Android Application Using Logistic Regression Over MLC in Combination with PCA","authors":"A. Ranadheer, L. Parvathy","doi":"10.1109/ICECONF57129.2023.10084279","DOIUrl":null,"url":null,"abstract":"The goal of this work is to assess the correctness and exactness of LR and Maximum Likelihood Classification (MLC) Classification algorithms in predicting the success of Android applications. A framework for predicting the success rate of Android applications that compares Logistic Regression and Maximum Likelihood classifiers has been proposed and developed. The sample size was determined using G powers to be 10 in each category. Sample size was calculated using clinical analysis, with alpha and beta numbers of 0.05 and 0.5, 95% assurance, and 80% well before power. The following results are obtained by running algorithms for various iterations. The Logistic Regression classifier predicts the success rate of an Android application with an accuracy of 80.3%, while the Maximum Likelihood classifier predicts it with 95.1%. The significance level is 0.001 $(\\mathbf{p}\\mathbf{0.005})$. As a result, Maximum Likelihood Classification outperforms LR classifiers. In terms of precision and accuracy, the results show that the Maximum Likelihood classification (MLC) outperforms the Logistic Regression.","PeriodicalId":436733,"journal":{"name":"2023 International Conference on Artificial Intelligence and Knowledge Discovery in Concurrent Engineering (ICECONF)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference on Artificial Intelligence and Knowledge Discovery in Concurrent Engineering (ICECONF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECONF57129.2023.10084279","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The goal of this work is to assess the correctness and exactness of LR and Maximum Likelihood Classification (MLC) Classification algorithms in predicting the success of Android applications. A framework for predicting the success rate of Android applications that compares Logistic Regression and Maximum Likelihood classifiers has been proposed and developed. The sample size was determined using G powers to be 10 in each category. Sample size was calculated using clinical analysis, with alpha and beta numbers of 0.05 and 0.5, 95% assurance, and 80% well before power. The following results are obtained by running algorithms for various iterations. The Logistic Regression classifier predicts the success rate of an Android application with an accuracy of 80.3%, while the Maximum Likelihood classifier predicts it with 95.1%. The significance level is 0.001 $(\mathbf{p}\mathbf{0.005})$. As a result, Maximum Likelihood Classification outperforms LR classifiers. In terms of precision and accuracy, the results show that the Maximum Likelihood classification (MLC) outperforms the Logistic Regression.
基于MLC与PCA相结合的Android应用创新成功预测模型
这项工作的目的是评估LR和最大似然分类(MLC)分类算法在预测Android应用成功方面的正确性和准确性。提出并开发了一个比较逻辑回归和最大似然分类器的Android应用成功率预测框架。样本量在每个类别中使用G的幂为10来确定。通过临床分析计算样本量,α和β值分别为0.05和0.5,95%的保证,80%的保证。通过运行各种迭代算法得到以下结果。逻辑回归分类器预测Android应用程序的成功率准确率为80.3%,而最大似然分类器预测成功率为95.1%。显著性水平为0.001 $(\mathbf{p}\mathbf{0.005})$。因此,最大似然分类优于LR分类器。在精密度和准确度方面,结果表明最大似然分类(MLC)优于逻辑回归。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信