A new source code repository for dynamic storing, browsing, and retrieval of source codes

Chakraborty, Prithwi Raj; Chowdhury, Sujan; Chowdhury, Alok Kumar; Hasan, Shahed Al

doi:10.1109/iciev.2013.6572624

Cited by 1 publication

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…proposing a new source code repository for dynamic storage, browsing, and retrieval of source codes, in which software is divided into software units including application >module >class >function >sub-function [30]; and introducing a repository of Android open-source applications including 4416 versions of 1179 applications through the mining of an Android open-source repository called F-Droid and sharing it on a personal website [31]. All these studies are summarized in Table 1.…”

Section: Previous Researchmentioning

confidence: 99%

Success prediction of android applications in a novel repository using neural networks

Dehkordi

Seifzadeh

Beydoun

et al. 2020

Complex Intell. Syst.

View full text Add to dashboard Cite

Nowadays, Android applications play a major role in software industry. Therefore, having a system that can help companies predict the success probability of such applications would be useful. Thus far, numerous research works have been conducted to predict the success probability of desktop applications using a variety of machine learning techniques. However, since features of desktop programs are different from those of mobile applications, they are not applicable to mobile applications. To our knowledge, there has not been a repository or even a method to predict the success probability of Android applications so far. In this research, we introduce a repository composed of 100 successful and 100 unsuccessful apps of Android operating system in Google PlayStoreTM including 34 features per application. Then, we use the repository to a neural network and other classification algorithms to predict the success probability. Finally, we compare the proposed method with the previous approaches based on the accuracy criterion. Experimental results show that the best accuracy which we achieved is 99.99%, which obtained when we used MLP and PCA, while the best accuracy achieved by the previous work in desktop platforms was 96%. However, the time complexity of the proposed approach is higher than previous methods, since the time complexities of NPR and MLP are O$$( n^3$$ ( n 3 ) and O$$( nph^koi$$ ( n p h k o i ), respectively.

show abstract

Section: Previous Researchmentioning

confidence: 99%