In this paper, a new method of selection variables is presented to select some essential variables from large datasets. The new model is a modified version of the Elastic Net model. The modified Elastic Net variable selection model has been summarized in an algorithm. It is applied for Leukemia dataset that has 3051 variables (genes) and 72 samples. In reality, working with this kind of dataset is not accessible due to its large size. The modified model is compared to some standard variable selection methods. Perfect classification is achieved by applying the modified Elastic Net model because it has the best performance. All the calculations that have been done for this paper are in
The variation in wing morphological features was investigated using geometric morphometric technique of the Sand Fly from two Iraqi provinces Babylon and Diyala . We distributed eleven landmarks on the wings of Sand Fly species. By using the centroid size and shape together, all species were clearly distinguished. It is clear from these results that the wing analysis is an essential method for future geometric morphometry studies to distinguish the species of Sand Flies in Iraq.
Abstract:
The distribution or retention of profits is the third decision among financial management decisions in terms of priority, whether at the level of theory or practice, as the issue of distribution or retention is multi-party in terms of influence and impact, as determining the optimal percentage for each component is still the subject of intellectual debate because these decisions are linked to the future of the organization and several considerations, The research focus on the nature of the policies followed by the Iraqi banking sector As the sample chosen by the intentional sampling method was represented by the Commercial Bank of
... Show MoreThis article aims to explore the importance of estimating the a semiparametric regression function ,where we suggest a new estimator beside the other combined estimators and then we make a comparison among them by using simulation technique . Through the simulation results we find that the suggest estimator is the best with the first and second models ,wherealse for the third model we find Burman and Chaudhuri (B&C) is best.
By use the notions pre-g-closedness and pre-g-openness we have generalized a class of separation axioms in topological spaces. In particular, we presented in this paper new types of regulαrities, which we named ρgregulαrity and Sρgregulαrity. Many results and properties of both types have been investigated and have illustrated by examples.
A space X is named a πp – normal if for each closed set F and each π – closed set F’ in X with F ∩ F’ = ∅, there are p – open sets U and V of X with U ∩ V = ∅ whereas F ⊆ U and F’ ⊆ V. Our work studies and discusses a new kind of normality in generalized topological spaces. We define ϑπp – normal, ϑ–mildly normal, & ϑ–almost normal, ϑp– normal, & ϑ–mildly p–normal, & ϑ–almost p-normal and ϑπ-normal space, and we discuss some of their properties.
In this work the concept of semi-generalized regular topological space was introduced and studied via semi generalized open sets. Many properties and results was investigated and studied, also it was shown that the quotient space of semi-generalized regular topological space is not, in general semi-generalizedspace.
In this thesis, we introduce eight types of topologies on a finite digraphs and state the implication between these topologies. Also we studied some pawlak's concepts and generalization rough set theory, we introduce a new types for approximation rough digraphs depending on supra open digraphs. In addition, we present two various standpoints to define generalized membership relations, and state the implication between it, to classify the digraphs and help for measure exactness and roughness of digraphs. On the other hand, we define several kinds of fuzzy digraphs. We also introduce a topological space, which is induced by reflexive graph and tolerance graphs, such that the graph may be infinite. Furthermore, we offered some properties of th
... Show MoreThe primary objective of this paper, is to introduce eight types of topologies on a finite digraphs and state the implication between these topologies. Also we used supra open digraphs to introduce a new types for approximation rough digraphs.
The Detour distance is one of the most common distance types used in chemistry and computer networks today. Therefore, in this paper, the detour polynomials and detour indices of vertices identified of n-graphs which are connected to themselves and separated from each other with respect to the vertices for n≥3 will be obtained. Also, polynomials detour and detour indices will be found for another graphs which have important applications in Chemistry.