Searcharxiv⌕ Search

arXiv subjects

Zamira Kholmatova

Publications and source records attributed to Zamira Kholmatova.

3 recordsLinked to original sources

Upper and lower limits of scales and the interchange of quantifiers

We define lower and upper limits for a family of structured subobjects of a fixed ambient object, as the direct limit of the meets over tails and the inverse limit of the joins over tails, and construct the canonical comparison morphism between them. The family need not be a diagram: its members are related only through the ambient object. We distinguish two senses in which the comparison may be invertible, before and after forgetting the structure, and prove that they coincide exactly when the forgetful functor reflects isomorphisms; they therefore agree for sets, for vector spaces and for Banach spaces, and separate for locally convex spaces. For countable scales of Banach spaces the separation cannot occur when the upper limit is ultrabornological, so under those hypotheses the obstruction is localised in the topology of that limit. Intermediate conditions correspond to factorisations of the forgetful functor, of which bornological convergence is one. In the cases that matter the comparison is an interchange of quantifiers: membership in the lower limit means that one value of the second index serves every value of the first, and membership in the upper limit that every value of the first is served by some value of the second. We exhibit this for spaces of test functions, for weighted Sobolev spaces, for Laurent series and for the adeles, and discuss three further conditions that suggest themselves.

math.OA↗

A Meta-analytical Comparison of Naive Bayes and Random Forest for Software Defect Prediction

Is there a statistical difference between Naive Bayes and Random Forest in terms of recall, f-measure, and precision for predicting software defects? By utilizing systematic literature review and meta-analysis, we are answering this question. We conducted a systematic literature review by establishing criteria to search and choose papers, resulting in five studies. After that, using the meta-data and forest-plots of five chosen papers, we conducted a meta-analysis to compare the two models. The results have shown that there is no significant statistical evidence that Naive Bayes perform differently from Random Forest in terms of recall, f-measure, and precision.

cs.SE↗

An experience in automatically extracting CAPAs from code repositories

TOM (stands for Theoretically Objective Measurements of Software Development Projects) is a set of services that are in charge of helping developers or teams in the process of identifying anomilies within their software development process, and providing a list of preventive or corrective actions (aka CAPAS) that positively impact the process. and in this way to improve the quality of the final product and its development process. In order to get help from TOM, it is as simple as adding our bot (@0capa) to the list of collaborators in your repository, and with this our bot will automatically take care of obtaining different metrics from your repository, in order to suggest actions to take into account to that in your future updates the identified anomalies are not repeated. This paper presents the underlying research on this idea.

cs.SE↗