A mixture model is used to model data that come from more than one component. In recent years, it became an effective tool in drawing inferences about the complex data that we might come across in real life. Moreover, it can represent a tremendous confirmatory tool in classification observations based on similarities amongst them. In this paper, several mixture regression-based methods were conducted under the assumption that the data come from a finite number of components. A comparison of these methods has been made according to their results in estimating component parameters. Also, observation membership has been inferred and assessed for these methods. The results showed that the flexible mixture model outperformed the

 A mixture model is used to model data that come from more than one component. In recent years, it became an effective tool in drawing inferences about the complex data that we might come across in real life. Moreover, it can represent a tremendous confirmatory tool in classification observations based on similarities amongst them. In this paper, several mixture regression-based methods were conducted under the assumption that the data come from a finite number of components. A comparison of these methods has been made according to their results in estimating component parameters. Also, observation membership has been inferred and assessed for these methods. The results showed that the flexible mixture model outperformed the others

In this research, we use fuzzy nonparametric methods based on some smoothing techniques, were applied to real data on the Iraqi stock market especially the data about Baghdad company for soft drinks for the year (2016) for the period (1/1/2016-31/12/2016) .A sample of (148) observations was obtained in order to construct a model of the relationship between the stock prices (Low, high, modal) and the traded value by comparing the results of the criterion (G.O.F.) for three techniques , we note that the lowest value for this criterion was for the K-Nearest Neighbor at Gaussian function .

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.

Let R be a commutative ring with identity 1 ¹ 0, and let M be a unitary left module over R. A submodule N of an R-module M is called essential, if whenever N ⋂ L = (0), then L = (0) for every submodule L of M. In this case, we write N ≤e M. An R-module M is called extending, if every submodule of M is an essential in a direct summand of M. A submodule N of an R-module M is called semi-essential (denoted by N ≤sem M), if N ∩ P ≠ (0) for each nonzero prime submodule P of M. The main purpose of this work is to determine and study two new concepts (up to our knowledge) which are St-closed submodules and semi-extending modules. St-closed submodules is contained properly in the class of closed submodules, where a submodule N of

Dans la langue française, une forme d'auxiliarité, composée de deux éléments cohérents l'auxiliant et l'auxilié, fournit, en effet, à la phrase une diversité significative et structurale. L'auxiliarité, renvoie à l'unification de deux éléments grammaticaux afin de localiser l'énoncé sur l'axe du temps, d'aspect ou de mode. É. Benveniste définit l'auxiliarité en : « Il s'agit d'une forme linguistique unitaire qui se réalise, à travers des paradigmes entiers, en  deux éléments, dont chacun assume une partie des fonctions grammaticales, et qui sont à la fois liés et autonomes, distincts et complémentaires »[1]. Ces deux éléments d'auxiliarité possèden

Credit risk assessment has become an important topic in financial risk administration. Fuzzy clustering analysis has been applied in credit scoring. Gustafson-Kessel (GK) algorithm has been utilised to cluster creditworthy customers as against non-creditworthy ones. A good clustering analysis implemented by good Initial Centres of clusters should be selected. To overcome this problem of Gustafson-Kessel (GK) algorithm, we proposed a modified version of Kohonen Network (KN) algorithm to select the initial centres. Utilising similar degree between points to get similarity density, and then by means of maximum density points selecting; the modified Kohonen Network method generate clustering initial centres to get more reasonable clustering res