Community detection is useful for better understanding the structure of complex networks. It aids in the extraction of the required information from such networks and has a vital role in different fields that range from healthcare to regional geography, economics, human interactions, and mobility. The method for detecting the structure of communities involves the partitioning of complex networks into groups of nodes, with extensive connections within community and sparse connections with other communities. In the literature, two main measures, namely the Modularity (Q) and Normalized Mutual Information (NMI) have been used for evaluating the validation and quality of the detected community structures. Although many optimization algorithms have been implemented to unfold the structures of communities, the influence of NMI on the Q, and vice versa, between a detected partition and the correct partition in signed and unsigned networks is unclear. For this reason, in this paper, we investigate the correlation between Q and NMI in signed and unsigned networks. The results show that there is no direct relationship between Q and NMI in both types of networks.
Microfinance Institutions (MFIs) offers small loans with easy repayment system and till now these institutions have served millions of needy people around the globe. This study highlights the hurdles influence the smooth working and growth of Microfinance institution in Egypt. The structured interviews were conducted from the top and mid-level managers of MFI's. This study revealed that interest rate, political and economic conditions, corruption, customer outreach, competition and technology are the important elements for MFI's success. It is evident that lack of use of technology and less importance drawn on customer outreach programs are the main challenges of MFI's in Egypt. This study provides a roadmap for practitioners and strategic
... Show MoreEvolutionary algorithms are better than heuristic algorithms at finding protein complexes in protein-protein interaction networks (PPINs). Many of these algorithms depend on their standard frameworks, which are based on topology. Further, many of these algorithms have been exclusively examined on networks with only reliable interaction data. The main objective of this paper is to extend the design of the canonical and topological-based evolutionary algorithms suggested in the literature to cope with noisy PPINs. The design of the evolutionary algorithm is extended based on the functional domain of the proteins rather than on the topological domain of the PPIN. The gene ontology annotation in each molecular function, biological proce
... Show More