A network (or formally a graph) can be described by a set of nodes and a set of edges connecting these nodes. Networks model many real-world phenomena in various research domains, such as biology, engineering and sociology. Community mining is discovering the groups in a network where individuals group of membership are not explicitly given. Detecting natural divisions in such complex networks is proved to be extremely NP-hard problem that recently enjoyed a considerable interest. Among the proposed methods, the field of evolutionary algorithms (EAs) takes a remarkable interest. To this end, the aim of this paper is to present the general statement of community detection problem in social networks. Then, it visits the problem as an optimization problem where a modularity-based ( ) and normalized mutual information ( ) metrics are formulated to describe the problem. An evolutionary algorithm is then expressed in the light of its characteristic components to tackle the problem. The presentation will highlight the possible alternative that can be adopted in this study for individual representation, fitness evaluations, and crossover and mutation operators. The results point out that adopting as a fitness function carries out more correct solutions than adopting the modularity function . Moreover, the strength of mutation has a background role. When coupled with non elite selection, increasing mutation probability could results in better solutions. However, when elitism is used, increasing mutation probability could bewilder the behavior of EA.
A network (or formally a graph) can be described by a set of nodes and a set of edges connecting these nodes. Networks model many real-world phenomena in various research domains, such as biology, engineering and sociology. Community mining is discovering the groups in a network where individuals group of membership are not explicitly given. Detecting natural divisions in such complex networks is proved to be extremely NP-hard problem that recently enjoyed a considerable interest. Among the proposed methods, the field of evolutionary algorithms (EAs) takes a remarkable interest. To this end, the aim of this paper is to present the general statement of community detection problem in social networks. Then, it visits the problem as an optimization problem where a modularity-based ( ) and normalized mutual information ( ) metrics are formulated to describe the problem. An evolutionary algorithm is then expressed in the light of its characteristic components to tackle the problem. The presentation will highlight the possible alternative that can be adopted in this study for individual representation, fitness evaluations, and crossover and mutation operators. The results point out that adopting as a fitness function carries out more correct solutions than adopting the modularity function . Moreover, the strength of mutation has a background role. When coupled with non elite selection, increasing mutation probability could results in better solutions. However, when elitism is used, increasing mutation probability could bewilder the behavior of EA.
This research presents a model for surveying networks configuration which is designed and called a Computerized Integrated System for Triangulation Network Modeling (CISTNM). It focuses on the strength of figure as a concept then on estimating the relative error (RE) for the computed side (base line) triangulation element. The CISTNM can compute the maximum elevations of the highest
obstacles of the line of sight, the observational signal tower height, the contribution of each triangulation station with their intervisibility test and analysis. The model is characterized by the flexibility to select either a single figure or a combined figures network option. Each option includes three other implicit options such as: triangles, quadri
Application of pesticide on vegetables will protect them from pest injury, but in another hand will hold pesticide residues inside vegetables. These residues have harmful effect against all consumers. Detection about pesticide residues has been carried out for some Iraqi vegetables (tomato, cucumber, eggplant, and zucchini) by using Gas Chromatography/Mass Spectroscopy (GC/MS). (Quick, Easy, Cheap, Effective, Rugged, and Safe) QuEChERS method has been applied for extraction pesticide residues from targeted vegetables. The GC/MS has been carried out before the treatment of residues for distinguish the vegetables that are suffering from hyper concentration in pesticide residues more than maximum residues limits (MRLs). Three kinds of solut
... Show MoreIn this paper, the complex of Lascoux in the case of partition (3,3,2) has been studied by using diagrams ,divided power of the place polarization ) (k ij ,Capelli identites and the idea of mapping Cone .
<span>As a result of numerous applications and low installation costs, wireless sensor networks (WSNs) have expanded excessively. The main concern in the WSN environment is to lower energy consumption amidst nodes while preserving an acceptable level of service quality. Using multi-mobile sinks to reduce the nodes' energy consumption have been considered as an efficient strategy. In such networks, the dynamic network topology created by the sinks mobility makes it a challenging task to deliver the data to the sinks. Thus, in order to provide efficient data dissemination, the sensor nodes will have to readjust the routes to the current position of the mobile sinks. The route re-adjustment process could result in a significant m
... Show More
(2)
(1)
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
... Show More
(8)
The search is an application for one of the problems of mathematics in the computer; as providing construction and design of a major program to calculate the inverse permutations of the symmetric group Sn , where 1 ≤ n ≤ 13; using some of the methods used in the Number Theory by computer . Also the research includes design flow chart for the main program and design flow chart for the program inverse permutations and we give some illustrative examples for different symmetric groups and their inverse permutations.
(8)
(2)
Artificial neural networks usage, as a developed technique, increased in many fields such as Auditing business. Contemporary auditor should cope with the challenges of the technology evolution in the business environment by using computerized techniques such as Artificial neural networks, This research is the first work made in the field of modern techniques of the artificial neural networks in the field of auditing; it is made by using thesample of neural networks as a sample of the artificial multi-layer Back Propagation neural networks in the field of detecting fundamental mistakes of the financial statements when making auditing. The research objectives at offering a methodology for the application of theartificial neural networks wi
... Show More
Gumbel distribution was dealt with great care by researchers and statisticians. There are traditional methods to estimate two parameters of Gumbel distribution known as Maximum Likelihood, the Method of Moments and recently the method of re-sampling called (Jackknife). However, these methods suffer from some mathematical difficulties in solving them analytically. Accordingly, there are other non-traditional methods, like the principle of the nearest neighbors, used in computer science especially, artificial intelligence algorithms, including the genetic algorithm, the artificial neural network algorithm, and others that may to be classified as meta-heuristic methods. Moreover, this principle of nearest neighbors has useful statistical featu
... Show More