scispace - formally typeset
Search or ask a question
Author

Alireza Farasat

Bio: Alireza Farasat is an academic researcher from University at Buffalo. The author has contributed to research in topics: Social network analysis & Betweenness centrality. The author has an hindex of 7, co-authored 10 publications receiving 187 citations. Previous affiliations of Alireza Farasat include State University of New York System & University of Tehran.

Papers
More filters
Journal ArticleDOI
01 Sep 2010
TL;DR: A sexual reproduction known as a remarkable biological phenomenon, called as Asexual Reproduction Optimization (ARO), is proposed, and its adaptive search ability and its strong and weak points are described.
Abstract: This paper proposes a new individual based optimization algorithm, which is inspired from asexual reproduction known as a remarkable biological phenomenon, called as Asexual Reproduction Optimization (ARO). ARO can be essentially considered as an evolutionary based algorithm that mathematically models the budding mechanism of asexual reproduction. In ARO, each individual produces an offspring called bud through a reproduction mechanism; thereafter parent and its offspring compete according to a performance index obtained from the underlying objective function of the given optimization problem. This process leads to the fitter individual. ARO's adaptive search ability and its strong and weak points are described in this paper. Furthermore, the ARO convergence to the global optimum is mathematically analyzed. To approve the effectiveness of the ARO performance, it is tested with several benchmark functions frequently used in the area of optimization. Finally, the ARO performance is statistically compared with that of Particle Swarm Optimization (PSO). Results of simulation illustrate that ARO remarkably outperforms PSO.

62 citations

Journal ArticleDOI
TL;DR: Direct and undirected probabilistic graphical models (PGMs) are described and recent applications in modern SNA are highlighted, including the estimation and quantification of importance, propagation of influence, trust (and distrust), link and profile prediction, privacy protection, and news spread through microblogging.
Abstract: The advent and availability of technology has brought us closer than ever through social networks. Consequently, there is a growing emphasis on mining social networks to extract information for knowledge and discovery. However, methods for social network analysis (SNA) have not kept pace with the data explosion. In this review, we describe directed and undirected probabilistic graphical models (PGMs), and highlight recent applications to social networks. PGMs represent a flexible class of models that can be adapted to address many of the current challenges in SNA. In this work, we motivate their use with simple and accessible examples to demonstrate the modeling and connect to theory. In addition, recent applications in modern SNA are highlighted, including the estimation and quantification of importance, propagation of influence, trust (and distrust), link and profile prediction, privacy protection, and news spread through microblogging. Applications are selected to demonstrate the flexibility and predictive capabilities of PGMs in SNA. Finally, we conclude with a discussion of challenges and opportunities for PGMs in social networks.

42 citations

Journal ArticleDOI
TL;DR: The reported results shed light on the sensitivity of betweenness, closeness, and degree centrality metrics to fused graph inputs and the role of HVI identification as a test and evaluation tool for fusion process optimization.
Abstract: This paper reports on the utility of social network analysis methods in the data fusion domain. Given fused data that combine multiple intelligence reports from the same environment, social network extraction and high value individual (HVI) identification are of interest. The research on the feasibility of such activities may help not only in methodological developments in network science but also in testing and evaluation of fusion quality. This paper offers a parallel computing-based methodology to extract a social network of individuals from fused data, captured as a cumulative associated data graph (CDG). To obtain the desired social network, two approaches including a hop count weighted and a path salience approach are developed and compared. A supervised learning framework is implemented for parameterizing the extraction algorithms. Parameters utilized in the extraction algorithm consider paths between individuals within the social network, weighing relationships between these individuals based on the count weighted and the path salience calculation methodologies. An overall link strength value is then calculated by aggregating path hop count weights and saliences between unique individual pairs for the hop count weighted and path salience approaches, respectively. Ordered centrality-based HVI lists are obtained from the CDGs constructed from the Sunni criminal thread and Bath’est resurgence threads of the SYNCOIN data set, under various fusion system settings. The reported results shed light on the sensitivity of betweenness, closeness, and degree centrality metrics to fused graph inputs and the role of HVI identification as a test and evaluation tool for fusion process optimization. The computational results demonstrate superiority of path salience approach in identifying HVIs. The insights generated by these approaches and directions for future research are discussed.

28 citations

Journal ArticleDOI
TL;DR: This paper presents a new individual based optimization algorithm, which is inspired from asexual reproduction known as a remarkable biological phenomenon, called as a sexual reproduction optimization (ARO).
Abstract: This paper presents a new individual based optimization algorithm, which is inspired from asexual reproduction known as a remarkable biological phenomenon, called as asexual reproduction optimization (ARO). ARO can be essentially considered as an evolutionary based algorithm that mathematically models the budding mechanism of asexual reproduction. In ARO, a parent produces a bud through a reproduction operator; thereafter the parent and its bud compete to survive according to a performance index obtained from the underlying objective function of the optimization problem; this leads to the fitter individual. ARO adaptive search ability along with its strength and weakness points are fully described in the paper. Furthermore, the ARO convergence to the global optimum is mathematically analyzed. To approve the effectiveness of the ARO performance, it is tested with several benchmark functions frequently used in the area of optimization. Finally, the ARO performance is statistically compared with that of an improved genetic algorithm (GA). Results of simulation illustrate that ARO remarkably outperforms GA.

26 citations

Journal ArticleDOI
TL;DR: This paper describes LK-TFP as a tree search procedure and discusses the reasons of its effectiveness, as well as proposing a methodological toolbox that incorporates social structures into TFP.

25 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: The MFO algorithm is compared with other well-known nature-inspired algorithms on 29 benchmark and 7 real engineering problems and the statistical results show that this algorithm is able to provide very promising and competitive results.
Abstract: In this paper a novel nature-inspired optimization paradigm is proposed called Moth-Flame Optimization (MFO) algorithm. The main inspiration of this optimizer is the navigation method of moths in nature called transverse orientation. Moths fly in night by maintaining a fixed angle with respect to the moon, a very effective mechanism for travelling in a straight line for long distances. However, these fancy insects are trapped in a useless/deadly spiral path around artificial lights. This paper mathematically models this behaviour to perform optimization. The MFO algorithm is compared with other well-known nature-inspired algorithms on 29 benchmark and 7 real engineering problems. The statistical results on the benchmark functions show that this algorithm is able to provide very promising and competitive results. Additionally, the results of the real problems demonstrate the merits of this algorithm in solving challenging problems with constrained and unknown search spaces. The paper also considers the application of the proposed algorithm in the field of marine propeller design to further investigate its effectiveness in practice. Note that the source codes of the MFO algorithm are publicly available at http://www.alimirjalili.com/MFO.html.

2,892 citations

Journal Article

383 citations

Journal ArticleDOI
TL;DR: This article enriched the researches of the networked Medical Device (MD) systems to increase the efficiency and safety of the healthcare.
Abstract: Medical cyber-physical systems (MCPS) are healthcare critical integration of a network of medical devices. These systems are progressively used in hospitals to achieve a continuous high-quality healthcare. The MCPS design faces numerous challenges, including inoperability, security/privacy, and high assurance in the system software. In the current work, the infrastructure of the cyber-physical systems (CPS) are reviewed and discussed. This article enriched the researches of the networked Medical Device (MD) systems to increase the efficiency and safety of the healthcare. It also can assist the specialists of medical device to overcome crucial issues related to medical devices, and the challenges facing the design of the medical device's network. The concept of the social networking and its security along with the concept of the wireless sensor networks (WSNs) are addressed. Afterward, the CPS systems and platforms have been established, where more focus was directed toward CPS-based healthcare. The big data framework of CPSs is also included.

134 citations

Journal ArticleDOI
TL;DR: In this article, Brainstorm Optimization Algorithm (BSOA) is employed to find optimal location and setting of flexible AC transmission system (FACTS) devices in IEEE 57 bus system.

130 citations

Journal ArticleDOI
TL;DR: In this paper, the authors present a taxonomy of nature-inspired and bio-inspired algorithms, and provide a critical summary of design trends and similarities between them, and the identification of the most similar classical algorithm for each reviewed paper.
Abstract: In recent algorithmic family simulates different biological processes observed in Nature in order to efficiently address complex optimization problems. In the last years the number of bio-inspired optimization approaches in literature has grown considerably, reaching unprecedented levels that dark the future prospects of this field of research. This paper addresses this problem by proposing two comprehensive, principle-based taxonomies that allow researchers to organize existing and future algorithmic developments into well-defined categories, considering two different criteria: the source of inspiration and the behavior of each algorithm. Using these taxonomies we review more than three hundred publications dealing with nature-inspired and bio-inspired algorithms, and proposals falling within each of these categories are examined, leading to a critical summary of design trends and similarities between them, and the identification of the most similar classical algorithm for each reviewed paper. From our analysis we conclude that a poor relationship is often found between the natural inspiration of an algorithm and its behavior. Furthermore, similarities in terms of behavior between different algorithms are greater than what is claimed in their public disclosure: specifically, we show that more than one-third of the reviewed bio-inspired solvers are versions of classical algorithms. Grounded on the conclusions of our critical analysis, we give several recommendations and points of improvement for better methodological practices in this active and growing research field.

109 citations