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.
Several stress-strain models were used to predict the strengths of steel fiber reinforced concrete, which are distinctive of the material. However, insufficient research has been done on the influence of hybrid fiber combinations (comprising two or more distinct fibers) on the characteristics of concrete. For this reason, the researchers conducted an experimental program to determine the stress-strain relationship of 30 concrete samples reinforced with two distinct fibers (a hybrid of polyvinyl alcohol and steel fibers), with compressive strengths ranging from 40 to 120 MPa. A total of 80% of the experimental results were used to develop a new empirical stress-strain model, which was accomplished through the application of the parti
... Show More
(25)
(26)
This article dealt with the evolutionary interpretation in three parts: First, it focused on the conceptual framework of evolutionary interpretation of International Treaties, its philosophical and legal foundation and its determinants. As for the second topic, it dealt with the position of the International Court of Justice from the evolutionary interpretation, studying and analyzing its precedents in this aspect and the resulting proposed and adopted criteria. The third topic dealt with the position of the judiciary of human rights through analyzing the rulings of the European Court of Human Rights and the Inter - American Court of Human Rights based on the criteria that were produced by the judicial practices, which varied according t
... Show More
The road networks is considered to be one of the determinants that controls to specify the areas of human activities, which it depend on to specify the arrival cost , in addition it is useful to achieve the connectivity for interaction and human activities , and shorten the distance and time between the population and places of service. The density of the road network in any space directly affected by the density of population and the type of economic activities and administrative functions performed by the space. On this basis, the subject of this study is reflected in the quantitative analysis of the roads network in the Governorate of Karbala. The study consists the quantitative analysis for the roads network and the Urban Nodes in th
... Show MoreDigital image started to including in various fields like, physics science, computer science, engineering science, chemistry science, biology science and medication science, to get from it some important information. But any images acquired by optical or electronic means is likely to be degraded by the sensing environment. In this paper, we will study and derive Iterative Tikhonov-Miller filter and Wiener filter by using criterion function. Then use the filters to restore the degraded image and show the Iterative Tikhonov-Miller filter has better performance when increasing the number of iteration To a certain limit then, the performs will be decrease. The performance of Iterative Tikhonov-Miller filter has better performance for less de
... Show MoreGeneral medical fields and computer science usually conjugate together to produce impressive results in both fields using applications, programs and algorithms provided by Data mining field. The present research's title contains the term hygiene which may be described as the principle of maintaining cleanliness of the external body. Whilst the environmental hygienic hazards can present themselves in various media shapes e.g. air, water, soil…etc. The influence they can exert on our health is very complex and may be modulated by our genetic makeup, psychological factors and by our perceptions of the risks that they present. Our main concern in this research is not to improve general health, rather than to propose a data mining approach
... Show MoreIn this paper, we prove that our proposed localization algorithm named Improved
Accuracy Distribution localization for wireless sensor networks (IADLoc) [1] is the
best when it is compared with the other localization algorithms by introducing many
cases of studies. The IADLoc is used to minimize the error rate of localization
without any additional cost and minimum energy consumption and also
decentralized implementation. The IADLoc is a range free and also range based
localization algorithm that uses both type of antenna (directional and omnidirectional)
it allows sensors to determine their location based on the region of
intersection (ROI) when the beacon nodes send the information to the sink node and
the la
In this paper, we prove that our proposed localization algorithm named Improved
Accuracy Distribution localization for wireless sensor networks (IADLoc) [1] is the
best when it is compared with the other localization algorithms by introducing many
cases of studies. The IADLoc is used to minimize the error rate of localization
without any additional cost and minimum energy consumption and also
decentralized implementation. The IADLoc is a range free and also range based
localization algorithm that uses both type of antenna (directional and omnidirectional)
it allows sensors to determine their location based on the region of
intersection (ROI) when the beacon nodes send the information to the sink node and
the la
In this paper the diagrams and divided power of the place polarization
(k )
ij , with
its capelli identities have been used, to study the complex of Lascoux in case of the
partition (4,4,4).
Background: image processing of medical images is major method to increase reliability of cancer diagnosis.
Methods: The proposed system proceeded into two stages: First, enhancement stage which was performed using of median filter to reduce the noise and artifacts that present in a CT image of a human lung with a cancer, Second: implementation of k-means clustering algorithm.
Results: the result image of k-means algorithm compared with the image resulted from implementation of fuzzy c-means (FCM) algorithm.
Conclusion: We found that the time required for k-means algorithm implementation is less than that of FCM algorithm.MATLAB package (version 7.3) was used in writing the programming code of our w
The influx of data in bioinformatics is primarily in the form of DNA, RNA, and protein sequences. This condition places a significant burden on scientists and computers. Some genomics studies depend on clustering techniques to group similarly expressed genes into one cluster. Clustering is a type of unsupervised learning that can be used to divide unknown cluster data into clusters. The k-means and fuzzy c-means (FCM) algorithms are examples of algorithms that can be used for clustering. Consequently, clustering is a common approach that divides an input space into several homogeneous zones; it can be achieved using a variety of algorithms. This study used three models to cluster a brain tumor dataset. The first model uses FCM, whic
... Show More
(1)